PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
June 11, 2002Proceedings of the National Academy of Sciences15,781 citationsOpen Access

Community structure in social and biological networks

View Full Paper
MGMichelle GirvanMNM. E. J. Newman

Key Points

  • To develop and evaluate a computational method based on centrality indices to identify and extract natural community structures within complex networks.
  • Designed a community detection algorithm that calculates edge centrality indices to locate and separate boundaries between tightly knit node clusters.
  • Validated the algorithm using synthetic benchmark graphs and real-world networks with pre-established, known community structures.
  • Applied the method to uncharacterized empirical networks, specifically a scientific collaboration network and an ecological food web.
  • Demonstrated high sensitivity and reliability in identifying known modular subdivisions within both computer-generated benchmarks and real-world graphs.
  • Successfully detected significant, informative community structures and functional sub-units within previously uncharacterized collaboration networks and food webs.

Abstract

A number of recent studies have focused on the statistical properties of networked systems such as social networks and the Worldwide Web. Researchers have concentrated particularly on a few properties that seem to be common to many networks: the small-world property, power-law degree distributions, and network transitivity. In this article, we highlight another property that is found in many networks, the property of community structure, in which network nodes are joined together in tightly knit groups, between which there are only looser connections. We propose a method for detecting such communities, built around the idea of using centrality indices to find community boundaries. We test our method on computer-generated and real-world graphs whose community structure is already known and find that the method detects this known structure with high sensitivity and reliability. We also apply the method to two networks whose community structure is not well known—a collaboration network and a food web—and find that it detects significant and informative community divisions in both cases.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Girvan et al. (2002) studied this question.

synapsesocial.com/papers/69430d4716ab0f2a6c22c09chttps://doi.org/10.1073/pnas.122653799
Ask AI
Helpful
Bookmark
Share
View Full Paper