Community structure in social and biological networks
Open accessThe DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source doesn’t support the claim as written.
In the citing paper
“Community detection algorithms such as Louvain (Blondel et al., 2008) or Newman Girvan (Girvan and Newman, 2002) determine the approximate number of communities by optimizing modularity, or the density of links within communities versus links between communities.”
From Mapping the multiscale structure of biological systems (2021) · cites this paper as Girvan and Newman, 2002
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Although prosocial behaviors in different strategic domains may manifest in different ways, such as trust games or dictator games, the desire to pay costs to benefit others has a substantial degree of domain generality [49].”
From Strategy evolution on dynamic networks (2023) · cites this paper as [49]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
A Set of Measures of Centrality Based on Betweenness
Freeman, L. C. (1977) · Sociometry · doi:10.2307/3033543 · Cited by 10,295 · cited 4×
“To find which edges in a network are most between other pairs of vertices, we generalize Freeman’s betweenness centrality to edges and define the edge betweenness of an edge as the number of shortest paths between pairs of vertices that run along it.”
BackgroundInfluentialStrogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302 · cited 2×
“The degree of a vertex in a network is the number of other vertices to which it is connected, and one finds that there are typically many vertices in a network with low degree and a small number with high degree, the precise distribution often following a power-law or exponential form [1, 5, 15].”
BackgroundNetwork Flows: Theory, Algorithms, and Applications.
Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1994) · The Journal of the Operational Research Society · doi:10.2307/2583863 · Cited by 8,034 · cited 1×
“Numbers of independent paths can be computed quickly by using polynomial-time ‘‘max-flow’’ algorithms such as the augmenting path algorithm (22).”
Method(2017) · The SAGE Encyclopedia of Communication Research Methods · doi:10.4135/9781483381411.n575 · Cited by 6,008
Social Network Analysis: A Handbook.
Pappi, F. U., & Scott, J. (1993) · Contemporary Sociology · doi:10.2307/2075047 · Cited by 5,969
The Large-Scale Organization of Metabolic Networks
Jeong, H., Tombor, B., Albert, R., Oltvai, Z. N., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35036627 · Cited by 4,972
The small-world problem: (400002009-005)
Milgram, S. (1967) · PsycEXTRA Dataset · doi:10.1037/e400002009-005 · Cited by 4,790
Research works printed but not linked: 1
- S Milgram Psychol Today 2, 60–67 (1967).
Cited by
Items 801–900 of 1,049
Ardesch, D. J., Scholtens, L. H., Li, L., Preuss, T. M., Rilling, J. K., & van den Heuvel, M. P. (2019) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1818512116 · Cited by 152
“These three connection classes were then compared in terms of their weighted edge betweenness centrality, a graph theoretical measure of the importance of a connection within the network (28).”
BackgroundComputational approaches to mapping allosteric pathways
Feher, V. A., Durrant, J. D., Van Wart, A. T., & Amaro, R. E. (2014) · Current Opinion in Structural Biology · doi:10.1016/j.sbi.2014.02.004 · Cited by 138
“Multiple methods such as normal mode analysis [17–19], correlation matrices [20–22], community-network analysis [23], mutual information [24] and dynamical network analysis [25–27] have been applied to evaluate and identify pathways or regions of correlated residue motions presumably related to…”
MethodMixing local and global information for community detection in large networks
Meo, P. D., Ferrara, E., Fiumara, G., & Provetti, A. (2013) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2013.03.012 · Cited by 153
“The concept of network modularity or, in short, modularity was introduced by Girvan and Newman [21].”
BackgroundMethodInfluentialRicci curvature of the Internet topology
Ni, C.-C., Lin, Y.-Y., Gao, J., Gu, X. D., & Saucan, E. (2015) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2015.7218668 · Cited by 152
LabelRank: A stabilized label propagation algorithm for community detection in networks
Xie, J., & Szymanski, B. K. (2013) · IEEE Network Science Workshop (NSW) · doi:10.1109/nsw.2013.6609210 · Cited by 152
Steinig, E. J., Duchene, S., Robinson, D. A., Monecke, S., Yokoyama, M., Laabei, M., Slickers, P., Andersson, P., Williamson, D., Kearns, A., et al. (2019) · mBio · doi:10.1128/mbio.01105-19 · Cited by 150
“We ran three commonly used community detection algorithms as implemented in igraph to limit the parameter choice to an appropriate range for detecting fine-scale population structure: fast-greedy modularity optimization (85), Infomap (86), and Walktrap (87).”
Zhou, H., & Lipowsky, R. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24688-6_137 · Cited by 152
“The American football network collected by Girvan and Newman [14] contains 115 vertices (football teams) and 613 unweighted edges (matches).”
MethodInfluentialA computational approach to ‘The Image of the City’
Filomena, G., Verstegen, J. A., & Manley, E. (2019) · Cities · doi:10.1016/j.cities.2019.01.006 · Cited by 151
“This algorithm optimises modularity [15], an index that measures the goodness of a network division.”
Graph theoretical framework of brain networks in multiple sclerosis: a review of concepts
Fleischer, V., Radetz, A., Ciolac, D., Muthuraman, M., Gonzalez-Escamilla, G., Zipp, F., & Groppa, S. (2019) · Neuroscience · doi:10.1016/j.neuroscience.2017.10.033 · Cited by 151
Integrating protein-protein interaction networks with phenotypes reveals signs of interactions
Vinayagam, A., Zirin, J. D., Roesel, C. L., Hu, Y., Yilmazel, B., Samsonova, A. A., Neumüller, R. A., Mohr, S. E., & Perrimon, N. (2013) · Nature Methods · doi:10.1038/nmeth.2733 · Cited by 151
Toward Self-Constructing Materials: A Systems Chemistry Approach
Giuseppone, N. (2012) · Accounts of Chemical Research · doi:10.1021/ar2002655 · Cited by 151
Patent keyword network analysis for improving technology development efficiency
Choi, J., & Hwang, Y.-S. (2013) · Technological Forecasting and Social Change · doi:10.1016/j.techfore.2013.07.004 · Cited by 151
Pizzuti, C., & Rombo, S. E. (2014) · Bioinformatics · doi:10.1093/bioinformatics/btu034 · Cited by 151
“the minimum cut algorithm in Hartuv et al. (2000) and the survey on graph clustering proposed in Schaeffer (2007)].”
BackgroundMethodInfluentialA Multi-objective Genetic Algorithm for Community Detection in Networks
Pizzuti, C. (2009) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/ictai.2009.58 · Cited by 151
“We adopted an external measure, the Normalized Mutual Information , to estimate the similarity between the true partitions and the detected ones, and an internal one, the modularity introduced by Girvan and Newman.”
MethodInfluentialSemi-supervised clustering algorithm for community structure detection in complex networks
Ma, X., Gao, L., Yong, X., & Fu, L. (2009) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2009.09.018 · Cited by 150
“The famous karate club network introduced by [30] is widely used as a test example for methods of identifying communities in networks [1,8,14,9].”
BackgroundMethodInfluentialLeifeld, P. (2016) · Oxford University Press eBooks · doi:10.1093/oxfordhb/9780190228217.013.25 · Cited by 150
“They can be identified using graph-theoretic community detection algorithms such as community detection based on edge betweenness (Girvan and Newman, 2002), modularity maximization (Newman and Girvan, 2004; Newman, 2006), or other techniques suitable for identifying subgroups in networks.”
MethodCytoCluster: A Cytoscape Plugin for Cluster Analysis and Visualization of Biological Networks
Li, M., Li, D., Tang, Y. F., Wu, F., & Wang, J. (2017) · International Journal of Molecular Sciences · doi:10.3390/ijms18091880 · Cited by 150
“For example, G-N (Girvan-Newman) [17], MoNet (Modular organization of protein interaction Networks) [18], FAG-EC (Fast AGglomerate algorithm for mining functional modules based on the Edge Clustering coefficients) [19], EAGLE (agglomerativE hierarchicAl clusterinG based on maximaL cliquE) [20],…”
BackgroundMotif-based communities in complex networks
Arenas, A., Fernández, A., Fortunato, S., & Gómez, S. (2008) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/41/22/224001 · Cited by 123
“Modular structure in complex networks has become a challenging subject of study starting with its very definition [1].”
BackgroundCoupling learning of complex interactions
Cao, L. (2015) · Information Processing & Management · doi:10.1016/j.ipm.2014.08.007 · Cited by 135
“Coupling is one critical aspect of non-IIDness [6] (the other is heterogeneity or so-called personalization, which is not the main concern in this paper, although coupling may be heterogeneous and involve heterogeneity in data).”
BackgroundNonparametric weighted stochastic block models
Peixoto, T. P. (2018) · Physical review. E · doi:10.1103/physreve.97.012306 · Cited by 149
“Most often, however, this is done by searching for assortative modules [27], i.e. groups of nodes more connected to themselves than with the rest of the network — a pattern commonly called community structure [1, 28].”
BackgroundThree new bibliometric indicators/approaches derived from keyword analysis
Wang, M., & Chai, L. (2018) · Scientometrics · doi:10.1007/s11192-018-2768-9 · Cited by 149
“Among the algorithms (Kernighan and Lin 1970; Girvan and Newman 2002, 2004; Newman 2003; Blondel et al. 2008), the one proposed by Blondel et al. (2008) is advantageous in rapidly detecting communities in a large network.”
MethodGA-Based Q-Attack on Community Detection
Chen, J., Chen, L., Chen, Y.-X., Zhao, M., Yu, S., Xuan, Q., & Yang, X. (2019) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2019.2912801 · Cited by 150
An Improved Louvain Algorithm for Community Detection
Zhang, J., Fei, J., Song, X., & Feng, J. (2021) · Mathematical Problems in Engineering · doi:10.1155/2021/1485592 · Cited by 151
Coarse-graining and self-dissimilarity of complex networks
Itzkovitz, S., Levitt, R., Kashtan, N., Milo, R., Itzkovitz, M., & Alon, U. S. (2005) · Physical Review E · doi:10.1103/physreve.71.016127 · Cited by 149
Network-Based Functional Regions
Farmer, C. J. Q., & Fotheringham, A. S. (2011) · Environment and Planning A Economy and Space · doi:10.1068/a44136 · Cited by 149
Reconstruction of the Mouse Otocyst and Early Neuroblast Lineage at Single-Cell Resolution
Durruthy-Durruthy, R., Gottlieb, A., Hartman, B. H., Waldhaus, J., Laske, R. D., Altman, R., & Heller, S. (2014) · Cell · doi:10.1016/j.cell.2014.03.036 · Cited by 148
A Survey of Data Mining Techniques for Social Media Analysis
Adedoyin-Olowe, M., Gaber, M. M., & Stahl, F. (2014) · Journal of Data Mining & Digital Humanities · doi:10.46298/jdmdh.5 · Cited by 65
“Different authors ha ve applied diverse clustering techniques to detect communities on soci al network [35]; [32]; 68], with hierarchical clustering being mostly used [62].”
On the permanence of vertices in network communities
Chakraborty, T., Srinivasan, S., Ganguly, N., Mukherjee, A., & Bhowmick, S. (2014) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2623330.2623707 · Cited by 148
Ruan, J., & Zhang, W. (2007) · Proceedings · doi:10.1109/icdm.2007.72 · Cited by 148
“For the football network, Kcut correctly revealed the official NCAA conference structure of the football teams [12], except for a few teams that do not belong to any conference.”
BackgroundMethodInfluentialA Survey on Centrality Metrics and Their Network Resilience Analysis
Wan, Z., Mahajan, Y., Kang, B. W., Moore, T. J., & Cho, J.-H. (2021) · IEEE Access · doi:10.1109/access.2021.3094196 · Cited by 148
“A variant of this centrality adapted for edges is popularly used to detect community structure [135].”
MethodA Survey of Community Detection in Complex Networks Using Nonnegative Matrix Factorization
He, C., Fei, X., Cheng, Q., Li, H., Hu, Z., & Tang, Y. Z. (2021) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2021.3114419 · Cited by 148
Emergence of segregation in evolving social networks
Henry, A. D., Prałat, P., & Zhang, C.-Q. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1014486108 · Cited by 120
“*Note that d(a>(u),a>(v)) e [0,1] andp e (0,1], so the probability distribution is well-defined.”
BackgroundInfluentialNetwork Community Detection: A Review and Visual SurveyPreprint
Khan, B. S., & Niazi, M. A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1708.00977 · Cited by 154
CollabSeer: a search engine for collaboration discovery
Chen, H., Gou, L., Zhang, X., & Giles, C. L. (2011) · ACM/IEEE Joint Conference on Digital Libraries · doi:10.1145/1998076.1998121 · Cited by 147
“It has been shown that networks in real world scenarios have distinctive statistical and structure characteristics, such as power law distributions [2], small world phenomenon [35], community structure [10], and spatial models [9].”
BackgroundHierarchical Graph Transformer with Adaptive Node Sampling
Zhang, Z., Liu, Q., Hu, Q., & Lee, C. (2022) · neural information processing systems · doi:10.52202/068431-1539 · Cited by 147
Axhausen, K. W. (2007) · Mobilities · doi:10.1080/17450100601106203 · Cited by 147
“( 2002 ) for empirical measurement of such clustering in non‐localised professional contexts.”
BackgroundDetecting hierarchical genome folding with network modularity
Norton, H. K., Emerson, D. J., Huang, H., Kim, J., Titus, K. R., Gu, S., Bassett, D. S., & Phillips-Cremins, J. E. (2018) · Nature Methods · doi:10.1038/nmeth.4560 · Cited by 146
Who is on your sofa?: TV audience communities and second screening social networks
Doughty, M., Rowland, D., & Lawson, S. (2012) · Proceedings of the 10th European Conference on Interactive TV and Video · doi:10.1145/2325616.2325635 · Cited by 120
Review of statistical network analysis: models, algorithms, and software
Salter‐Townshend, M., White, A., Gollini, I., & Murphy, T. B. (2012) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.11146 · Cited by 146
Entropy of stochastic blockmodel ensembles
Peixoto, T. P. (2012) · Physical Review E · doi:10.1103/physreve.85.056122 · Cited by 146
Li, M., Wu, X., Wang, J., & Pan, Y. F. (2012) · BMC Bioinformatics · doi:10.1186/1471-2105-13-109 · Cited by 146
“Over the past decade, many computational methods have been proposed for clustering PPI networks, such as G-N [2], MCODE[3], RNSC[4], LCMA[5], DPClus [6], MoNet [7], IPCA [8], COACH [9], and SPICi [10].”
Gharehchopogh, F. S. (2022) · Journal of Bionic Engineering · doi:10.1007/s42235-022-00303-z · Cited by 146
Higher-order interactions shape collective human behaviour
Battiston, F., Capraro, V., Karimi, F., Lehmann, S., Migliano, A. B., Sadekar, O., Sánchez, Á., & Perc, M. (2025) · Nature Human Behaviour · doi:10.1038/s41562-025-02373-5 · Cited by 147
“At the macro-scale, much attention has been devoted to the organization of individuals into social clusters or communities 19,20 .”
Secure open source collaboration: an empirical study of linus' law
Meneely, A., & Williams, L. A. (2009) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1653662.1653717 · Cited by 146
Small-world link structures across an academic web space:a library and information science approach
Björneborn, L. (2004) · Research at the University of Copenhagen (University of Copenhagen) · Cited by 146
On the Meanings of Self-Regulation: Digital Humanities in Service of Conceptual Clarity
Burman, J. T., Green, C. D., & Shanker, S. G. (2015) · Child Development · doi:10.1111/cdev.12395 · Cited by 146
“(For a clear but technical discussion of how such an approach can be used to identify communities from the interconnections thus de fi ned, see Girvan & Newman, 2002.)”
BackgroundNetworks uncover hidden lexical borrowing in Indo-European language evolution
Sathi, S. N., List, J., Geisler, H., Fangerau, H., Gray, R. D., Martin, W. F., & Dagan, T. (2010) · Proceedings of the Royal Society B Biological Sciences · doi:10.1098/rspb.2010.1917 · Cited by 145
Garcia, J. O., Ashourvan, A., Muldoon, S. F., Vettel, J. M., & Bassett, D. S. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2017.2786710 · Cited by 146
Roles for the Two-hybrid System in Exploration of the Yeast Protein Interactome
Ito, T., Ota, K., Kubota, H., Yamaguchi, Y., Chiba, T., Sakuraba, K., & Yoshida, M. (2002) · Molecular & Cellular Proteomics · doi:10.1074/mcp.r200005-mcp200 · Cited by 126
“Recently an intriguing approach was developed to dissect complex network into communities based solely on the topology of the network and was successfully applied to biological and social networks (17).”
BackgroundDetecting tourism destinations using scalable geospatial analysis based on cloud computing platform
Zhou, X., Xu, C. G., & Kimmons, B. (2015) · Computers Environment and Urban Systems · doi:10.1016/j.compenvurbsys.2015.07.006 · Cited by 144
“In complex networks, a network comprises a community structure if some nodes of the network can be grouped into several sets so that the nodes in the set are densely connected while nodes between sets are loosely connected (Girvan & Newman, 2002).”
BackgroundFinding a needle in a haystack of reviews: cold start context-based hotel recommender system
Levi, A., Mokryn, O., Diot, C., & Taft, N. (2012) · ACM Conference on Recommender Systems (RecSys) · doi:10.1145/2365952.2365977 · Cited by 144
“To account for the sparsity and the overlapping characteristics in the network of word features, we build upon an unsupervised community detection(2) [17, 16] technique based on [18].”
MethodAn LDA-based Community Structure Discovery Approach for Large-Scale Social Networks
Zhang, H., Qiu, B., Giles, C. L., Foley, H. C., & Yen, J. (2007) · IEEE International Conference on Intelligence and Security Informatics (ISI) · doi:10.1109/isi.2007.379553 · Cited by 144
Ethnicity and Population Structure in Personal Naming Networks
Mateos, P., Longley, P., & O’Sullivan, D. (2011) · PLoS ONE · doi:10.1371/journal.pone.0022943 · Cited by 144
Complex Networks Theory For Modern Smart Grid Applications: A Survey
Chu, C., & Iu, H. H. (2017) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2017.2692243 · Cited by 144
“Another common feature associated with CNs is the community structure, or called the module, which reflects the tendency for nodes to divide into groups, with dense connections within groups and only sparser connections between them [36], [37].”
BackgroundMixed membership estimation for social networks
Jin, J., Ke, Z. T., & Luo, S. (2023) · Journal of Econometrics · doi:10.1016/j.jeconom.2022.12.003 · Cited by 144
Modular synchronization in complex networks
Oh, E., Rho, K., Hong, H., & Kahng, B. (2005) · Physical Review E · doi:10.1103/physreve.72.047101 · Cited by 144
Basic Phylogenetic Combinatorics
Dress, A., Huber, K. T., Koolen, J. H., Moulton, V., & Spillner, A. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9781139019767 · Cited by 143
Community detection: Topological vs. topical
Ding, Y. (2011) · Journal of Informetrics · doi:10.1016/j.joi.2011.02.006 · Cited by 143
“Girvan and Newman (2002) proposed the Girvan-Newman algorithm to extract community by gradually removing edges with high betweenness centralities in a descending order, which avoided the arbitrary bisection. The number of communities to be extracted can be measured using modularity (Newman, 2004), which measures the q…”
MethodInfluentialFunctional Clusters, Hubs, and Communities in the Cortical Microconnectome
Shimono, M., & Beggs, J. M. (2014) · Cerebral Cortex · doi:10.1093/cercor/bhu252 · Cited by 143
“We observed how connectivity probability changed depending on the number of common neighbors.”
BackgroundMethodResearch Commentary—Information in Digital, Economic, and Social Networks
Sundararajan, A., Provost, F., Oestreicher-Singer, G., & Aral, S. (2013) · Information Systems Research · doi:10.1287/isre.1120.0472 · Cited by 115
Is There a Best Quality Metric for Graph Clusters?
de Almeida, H. M. P., Guedes, D. O., Meira, W., & Zaki, M. J. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23780-5_13 · Cited by 143
“The other small dataset used was the American College football team’s matches [5].”
BackgroundMethodA Consensus Community-Based Particle Swarm Optimization for Dynamic Community Detection
Zeng, X., Wang, W., Chen, C., & Yen, G. G. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2938895 · Cited by 143
“A community is intuitively regarded as a group of nodes with dense intraconnections and sparse interconnections [3].”
BackgroundNetwork science and sustainable performance of family businesses in tourism
Baggio, R., & Valeri, M. (2020) · Journal of Family Business Management · doi:10.1108/jfbm-06-2020-0048 · Cited by 144
Analyzing Cellular Biochemistry in Terms of Molecular Networks
Xia, Y., Yu, H., Jansen, R., Seringhaus, M., Baxter, S., Greenbaum, D., Zhao, H., & Gerstein, M. (2004) · Annual Review of Biochemistry · doi:10.1146/annurev.biochem.73.011303.073950 · Cited by 135
Social Topic Models for Community Extraction
Pathak, N., DeLong, C., Banerjee, A., & Erickson, K. (2008) · University of Minnesota Digital Conservancy (University of Minnesota) · Cited by 143
Donges, J. F., Heitzig, J., Beronov, B., Wiedermann, M., Runge, J., Feng, Q., Tupikina, L., Stolbova, V., Donner, R. V., Marwan, N., et al. (2015) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4934554 · Cited by 142
Luthe, T., & Wyss, R. (2016) · Ecology and Society · doi:10.5751/es-08234-210127 · Cited by 143
“…exist when a small number of central actors or hubs hold a disproportionate amount of connections, while most other nodes maintain few relationships (Girvan and Newman 2002, Guimerà et al. 2003, Newman and Girvan 2004, Guimerà and Amaral 2005a, Hojman and Szeidl 2008, Rombach et al. 2014).”
BackgroundAnalysis of vulnerabilities in maritime supply chains
Liu, H., Tian, Z., Huang, A., & Yang, Z. (2017) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2017.09.018 · Cited by 142
Statistical inference links data and theory in network science
Peel, L., Peixoto, T. P., & Domenico, M. D. (2022) · Nature Communications · doi:10.1038/s41467-022-34267-9 · Cited by 142
Peng, Y., Zhao, Y., & Hu, J. (2022) · Information Sciences · doi:10.1016/j.ins.2022.11.101 · Cited by 142
Identifying Critical Locations in a Spatial Network with Graph Theory
Demšar, U., Špatenková, O., & Virrantaus, K. (2008) · Transactions in GIS · doi:10.1111/j.1467-9671.2008.01086.x · Cited by 142
Biogeography Revisited with Network Theory: Retracing the History of Hydrothermal Vent Communities
Moalic, Y., Desbruyères, D., Duarte, C. M., Rozenfeld, A., Bachraty, C., & Arnaud‐Haond, S. (2011) · Systematic Biology · doi:10.1093/sysbio/syr088 · Cited by 142
“2 3 Comparative analysis---- A set of four methods based on community detection 4 were additionally tested on this dataset to infer their potential for biogeographic analysis 5 on our dataset (Blondel et al., 2008; Dongen, 2008; Girvan and Newman, 2002; 2008).”
MethodThe Development of Social Network Analysis – with an Emphasis on Recent Events
Freeman, L. C. (2014) · SAGE Publications Ltd eBooks · doi:10.4135/9781446294413.n3 · Cited by 142
“Girvan and Newman (2002), for example, cited 8 social network articles among their 29 citations.”
BackgroundMethodTatarynowicz, A., Sytch, M., & Gulati, R. (2015) · Administrative Science Quarterly · doi:10.1177/0001839215609083 · Cited by 141
“Unlike connectedness, community structure captures the distribution (rather than existence) of network ties throughout the network (Granovetter, 1973; Girvan and Newman, 2002; Sytch and Tatarynowicz, 2014a).”
BackgroundMethodBader, D. A., & Madduri, K. (2008) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2008.4536261 · Cited by 140
“anomalous patterns in social networks (in general, smallworld networks) are well-studied [21, 35].”
BackgroundPhase transitions in semidefinite relaxations
Javanmard, A., Andrea Montanari, A., & Ricci‐Tersenghi, F. (2016) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1523097113 · Cited by 141
A textual-based technique for Smell Detection
Palomba, F., Panichella, A., Lucia, A. D., Oliveto, R., & Zaidman, A. (2016) · IEEE International Conference on Program Comprehension (ICPC) · doi:10.1109/icpc.2016.7503704 · Cited by 141
“As for Promiscuous Package , we compared TACO with the clustering-based algorithm proposed in [33], where classes are grouped using the dependencies among them.”
MethodJournal De La Société Française De Statistique
Caussinus, H., & de Falguerolles, A. (2005) · Wiley eBooks · doi:10.1002/0471667196.ess7017 · Cited by 141
Computational Approaches for Protein Function Prediction: A Survey
Pandey, G. S., Kumar, V., & Steinbach, M. S. (2006) · University of Minnesota Digital Conservancy (University of Minnesota) · Cited by 141
Collective behavior of cryptocurrency price changes
Stošić, D., Stošić, D., Ludermir, T. B., & Stošić, T. (2018) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2018.05.050 · Cited by 140
Finding instabilities in the community structure of complex networks
Gfeller, D., Chappelier, J.-C., & De Los Rios, P. (2005) · Physical Review E · doi:10.1103/physreve.72.056135 · Cited by 126
Clustering of high throughput gene expression data
Pirim, H., Ekşioğlu, B., Perkins, A., & Yüceer, Ç. (2012) · Computers & Operations Research · doi:10.1016/j.cor.2012.03.008 · Cited by 140
Quantifying and identifying the overlapping community structure in networks
Shen, H., Cheng, X., & Guo, J. (2009) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2009/07/p07042 · Cited by 140
Role models for complex networks
Reichardt, J., & White, D. R. (2007) · The European Physical Journal B · doi:10.1140/epjb/e2007-00340-y · Cited by 116
Cuzzocrea, A., Papadimitriou, A., Katsaros, D., & Manolopoulos, Y. (2011) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2011.06.001 · Cited by 139
Improved community structure detection using a modified fine-tuning strategy
Sun, Y., Danila, B., Josić, K., & Bassler, K. E. (2009) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/86/28004 · Cited by 126
Greedy discrete particle swarm optimization for large-scale social network clustering
Cai, Q., Gong, M., Ma, L., Ruan, S., Yuan, F., & Jiao, L. (2014) · Information Sciences · doi:10.1016/j.ins.2014.09.041 · Cited by 139
“Network #Node #Edge Weighted Directed #Clusters Reference Karate 34 78 No No 2 [51] Dolphin 62 159 No No 2 [26] Football 115 613 Yes No 12 [10] SFI 118 200 Yes No Unknown [10] E-mail 1133 5451 No No Unknown [14] Netscience 1589 2742 Yes No Unknown [30] Power grid 4941 6594 No No Unknown [48] PGP 10680 24340 No No Unkn…”
BackgroundMethodImmunization and Targeted Destruction of Networks using Explosive Percolation
Clusella, P., Grassberger, P., Pérez‐Reche, F. J., & Politi, A. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.208301 · Cited by 139
Networks, Dynamics, and Modularity
Variano, E. A., McCoy, J., & Lipson, H. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.188701 · Cited by 139
Statistical significance of communities in networks
Lancichinetti, A., Radicchi, F., & Ramasco, J. J. (2010) · Physical Review E · doi:10.1103/physreve.81.046110 · Cited by 120
Clustering algorithm for determining community structure in large networks
Pujol, J. M., Béjar, J., & Delgado, J. (2006) · Physical Review E · doi:10.1103/physreve.74.016107 · Cited by 139
Gloor, P. A., Laubacher, R., Dynes, S., & Zhao, Y. (2003) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/956863.956875 · Cited by 139
Barreto, E., Hunt, B. R., Ott, E., & So, P. (2008) · Physical Review E · doi:10.1103/physreve.77.036107 · Cited by 139
Tactical Innovation in Social Movements: The Effects of Peripheral and Multi-Issue Protest
Wang, D. J., & Soule, S. A. (2016) · American Sociological Review · doi:10.1177/0003122416644414 · Cited by 109
High-Reproducibility and High-Accuracy Method for Automated Topic Classification
Lancichinetti, A., Sirer, M. I., Wang, J. X., Acuna, D. E., Kording, K. P., & Amaral, L. A. N. (2015) · Physical Review X · doi:10.1103/physrevx.5.011007 · Cited by 137
Spectral properties of networks with community structure
Chauhan, S., Girvan, M., & Ott, E. (2009) · Physical Review E · doi:10.1103/physreve.80.056114 · Cited by 138
Self-citationA survey on network community detection based on evolutionary computation
Cai, Q., Ma, L., Gong, M., & Tian, D. (2016) · International Journal of Bio-Inspired Computation · doi:10.1504/ijbic.2016.076329 · Cited by 138
“In recent years, another outstanding property of networks, i.e., the community structure (Girvan and Newman, 2002), has become a hot research topic.”
BackgroundTixier, A. J. ‐., Hallowell, M. R., Rajagopalan, B., & Bowman, D. (2016) · Automation in Construction · doi:10.1016/j.autcon.2016.11.001 · Cited by 139
Gao, J. G., Zhang, Y., & Zhou, T. (2019) · Physics Reports · doi:10.1016/j.physrep.2019.05.002 · Cited by 138
“After applying a community detection algorithm [376], they found a two-level hierarchical organization embedded in the interaction network, where the bottom-level communities respect the county boundaries, and the top-level communities respect the prefecture-level unit boundaries.”
MethodMPC-Based Decentralized Voltage Control in Power Distribution Systems With EV and PV Coordination
Wang, L., Dubey, A., Gebremedhin, A. H., Srivastava, A. K., & Schulz, N. N. (2022) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2022.3156115 · Cited by 138
Metadata
- Authors
- Girvan, M., & Newman, M. E. J.
- Affiliations
- Santa Fe Institute (US)
- Venue
- Proceedings of the National Academy of Sciences
- Publisher
- National Academy of Sciences
- Published
- 2002-06-11
- Volume
- 99
- Issue
- 12
- Pages
- 7821-7826
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- PMC
- PMC122977
- OpenAlex
- W1971421925
- Cited by
- 15,502
- References
- 32
- Citations by year
- 2026: 377 · 2025: 665 · 2024: 733 · 2023: 805 · 2022: 889 · 2021: 990 · 2020: 1050 · 2019: 1053 · 2018: 1042 · 2017: 959 · 2016: 924 · 2015: 862 · 2014: 905 · 2013: 828 · 2012: 714
- FWCI
- 50.71
- Type
- journal article
- Language
- en
- Open access
- green
- www.ncbi.nlm.nih.gov
- Locations
- Proceedings of the National Academy of Sciences (publishedVersion)
- Europe PMC (PubMed Central) (publishedVersion)
- PubMed Central (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Science Foundation (9870631, 0109086, 9910217)
- Topics
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Bioinformatics and Genomic Networks
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Graph theory and applications
- Keywords
- community structure, community detection, social networks, biological networks, centrality indices, network topology, collaboration networks, food webs, small-world property, power-law degree distribution, network transitivity
- MeSH terms
- Algorithms, Animals, Computer Simulation, Humans, Models, Theoretical, Nerve Net, Social Behavior, Neural Networks, Computer, Community Networks
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.