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 501–600 of 1,049
Divergent discourse between protests and counter-protests: #BlackLivesMatter and #AllLivesMatter
Gallagher, R. J., Reagan, A. J., Danforth, C. M., & Dodds, P. S. (2018) · PLOS ONE · doi:10.1371/journal.pone.0195644 · Cited by 157
“In order to extract the most central topics of #BlackLivesMatter and #AllLivesMatter during each time period, we compare the results of three centrality measures, betweenness centrality [54], random walk betweeness centrality [55], and PageRank [56] on the topic networks at significance level α = 0.”
MethodSub2Vec: Feature Learning for Subgraphs
Adhikari, B., Zhang, Y., Ramakrishnan, N., & Prakash, B. A. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-93037-4_14 · Cited by 213
“Here we show how to leverage Sub2Vec for the well-known community detection problem [2, 3].”
BackgroundMethodApproaching human language with complex networks
Cong, J., & Liu, H. (2014) · Physics of Life Reviews · doi:10.1016/j.plrev.2014.04.004 · Cited by 212
“For instance, many real-world networks are found to have such group-level properties as community structure [171, 172], i.”
BackgroundDe Domenico, M., Lancichinetti, A., Arenas, A., & Rosvall, M. (2015) · Physical Review X · doi:10.1103/physrevx.5.011027 · Cited by 211
A new method of identifying influential nodes in complex networks based on TOPSIS
Du, Y., Gao, C., Hu, Y., Mahadevan, S., & Deng, Y. (2014) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2013.12.031 · Cited by 211
Fitness model for the Italian interbank money market
De Masi, G., Iori, G., & Caldarelli, G. (2006) · Physical Review E · doi:10.1103/physreve.74.066112 · Cited by 210
Complex network analysis of keywords co-occurrence in the recent efficiency analysis literature
Lozano, S., Calzada-Infante, L., Adenso-Díaz, B., & García, S. (2019) · Scientometrics · doi:10.1007/s11192-019-03132-w · Cited by 209
Adaptive networks: Coevolution of disease and topology
Marceau, V., Noël, P.-A., Hébert-Dufresne, L., Allard, A., & Dubé, L. J. (2010) · Physical Review E · doi:10.1103/physreve.82.036116 · Cited by 209
Edge overload breakdown in evolving networks
Holme, P. (2002) · Physical Review E · doi:10.1103/physreve.66.036119 · Cited by 209
Task activations produce spurious but systematic inflation of task functional connectivity estimates
Cole, M. W., Ito, T., Schultz, D., Mill, R., Chen, R., & Cocuzza, C. (2019) · NeuroImage · doi:10.1016/j.neuroimage.2018.12.054 · Cited by 208
“We constructed a series of large-scale network communities, given the presence of such communities in many real-world networks (Girvan and Newman, 2002) including the human brain (Power et al., 2011; Yeo et al., 2011).”
BackgroundA Molecular Signature of Depression in the Amygdala
Sibille, E., Wang, Y., Joeyen-Waldorf, J., Gaiteri, C., Surget, A., Oh, S., Belzung, C., Tseng, G. C., & Lewis, D. A. (2009) · American Journal of Psychiatry · doi:10.1176/appi.ajp.2009.08121760 · Cited by 208
“Although the organic representation of the networks showed some differences (Figure 4C,D), the internal topology was well conserved, with a ~40% concordance of individual links across species, or ~57% using correlation of “betweenness centrality,” a more general measure of network similarity (36).”
Fuzzy overlapping communities in networks
Gregory, S. (2011) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2011/02/p02017 · Cited by 209
“Numerous community detection algorithms have been developed, using a variety of techniques: removal of high-betweenness edges [1], modularity optimization [2, 3], detection of dense subgraphs [4], statistical inference [5] and many more.”
Comparing community detection algorithms in psychometric networks: A Monte Carlo simulation
Christensen, A. P., Garrido, L. E., Guerra-Peña, K., & Golino, H. F. (2023) · Behavior Research Methods · doi:10.3758/s13428-023-02106-4 · Cited by 215
Reflections on Conceptualizing and Measuring Tie Strength
Marsden, P. V., & Campbell, K. E. (2012) · Social Forces · doi:10.1093/sf/sos112 · Cited by 207
Scalable Motif-aware Graph Clustering
Tsourakakis, C. E., Pachocki, J., & Mitzenmacher, M. (2017) · International World Wide Web Conference (WWW) · doi:10.1145/3038912.3052653 · Cited by 207
“As our competitors we use a list of popular graph clustering methods: MCL [14], Infomap [31], the Girvan-Newman (GN) algorithm [18], the Louvain method [11], the ClausetNewman-Moore (CNM) [12] , Cfinder [4], spectral clustering (SC) [29], and triangle spectral clustering (tSC) [10, 36].”
MethodGeneral optimization technique for high-quality community detection in complex networks
Sobolevsky, S., Campari, R., Belyi, A., & Ratti, C. (2014) · Physical Review E · doi:10.1103/physreve.90.012811 · Cited by 206
Evolutionary Computation for Community Detection in Networks: A Review
Pizzuti, C. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2737600 · Cited by 206
Veh, A., Göbel, M., & Vogel, R. (2018) · BuR - Business Research · doi:10.1007/s40685-018-0080-4 · Cited by 207
Using Transactional Information to Predict Link Strength in Online Social Networks
Kahanda, I., & Neville, J. (2009) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v3i1.13957 · Cited by 205
“Recent work on data fusion methods has focused on applications in biological (Lanckriet et al. 2004) and web-based datasets (Xu, King, and Lyu 2007).”
BackgroundA Network Approach for Analyzing Spatially Structured Populations in Fragmented Landscape
Bodin, Ö., & Norberg, J. (2007) · Landscape Ecology · doi:10.1007/s10980-006-9015-0 · Cited by 205
“We have chosen to use a divisive hierarchical decomposition algorithm called Community Structure recently proposed by Girvan and Newman (2002).”
MethodRanking stability and super-stable nodes in complex networks
Ghoshal, G., & Barabási, A.-L. (2011) · Nature Communications · doi:10.1038/ncomms1396 · Cited by 205
Blockchain Technologies in Logistics and Supply Chain Management: A Bibliometric Review
Rejeb, A., Rejeb, K., Simske, S., & Treiblmaier, H. (2021) · Logistics · doi:10.3390/logistics5040072 · Cited by 206
Dunn, R., Dudbridge, F., & Sanderson, C. M. (2005) · BMC Bioinformatics · doi:10.1186/1471-2105-6-39 · Cited by 204
Community Detection and Stochastic Block Models
Abbe, E. A. (2018) · Foundations and Trends® in Communications and Information Theory · doi:10.1561/0100000067 · Cited by 206
Identifying and evaluating community structure in complex networks
Steinhaeuser, K., & Chawla, N. V. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2009.11.001 · Cited by 203
“Application areas include the analysis of social networks (Girvan and Newman, 2002; Wasserman and Faust, 1994), chemical interactions between proteins (Asur et al., 2007; Enright et al., 2002), transactions of goods and services (Clauset et al., 2004), and many others.”
BackgroundRelmasira, S. C., Lai, Y. C., & Donaldson, J. P. (2023) · Sustainability · doi:10.3390/su151813595 · Cited by 206
A formal analysis of cytokine networks in chronic fatigue syndrome
Broderick, G., Fuite, J., Kreitz, A., Vernon, S. D., Klimas, N., & Fletcher, M. A. (2010) · Brain Behavior and Immunity · doi:10.1016/j.bbi.2010.04.012 · Cited by 202
Robust network community detection using balanced propagation
Šubelj, L., & Bajec, M. (2011) · The European Physical Journal B · doi:10.1140/epjb/e2011-10979-2 · Cited by 202
Information Flow Analysis of Interactome Networks
Missiuro, P. V., Liu, K., Zou, L., Ross, B. C., Zhao, G., Liu, J. S., & Ge, H. (2009) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000350 · Cited by 202
“Betweenness determines the centrality of a protein in an interactome network based on the total number of shortest paths going through the given protein [12,13].”
BackgroundClique graphs and overlapping communities
Evans, T. (2010) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2010/12/p12037 · Cited by 202
Comparative analysis of two discretizations of Ricci curvature for complex networks
Samal, A., Pushpa, S. R., Gu, J., Liu, S., Saucan, E., & Jost, J. (2018) · Scientific Reports · doi:10.1038/s41598-018-27001-3 · Cited by 202
Origin of compartmentalization in food webs
Guimerà, R., Stouffer, D. B., Sales-Pardo, M., Leicht, E. A., Newman, M. E. J., & Amaral, L. A. N. (2010) · Ecology · doi:10.1890/09-1175.1 · Cited by 201
“…Cattin et al. 2004, Stouffer et al. 2006, Allesina et al. 2008), and compartmentalization (May 1972, Pimm 1979, Pimm and Lawton 1980, Yodzis 1982, Girvan and Newman 2002, Krause et al. 2003, Allesina and Pascual 2009, Rezende et al. 2009), are thought to play a central role in the propagation of…”
BackgroundSelf-citationMapping allosteric communications within individual proteins
Wang, J., Jain, A., McDonald, L. R., Gambogi, C., Lee, A. L., & Dokholyan, N. V. (2020) · Nature Communications · doi:10.1038/s41467-020-17618-2 · Cited by 201
Clustering coefficient and community structure of bipartite networks
Zhang, P., Wang, J., Li, X., Li, M., Di, Z., & Fan, Y. (2008) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2008.09.006 · Cited by 201
Measuring mixing patterns in complex networks by Spearman rank correlation coefficient
Zhang, W.-Y., Wei, Z.-W., Wang, B.-H., & Han, X.-P. (2016) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2016.01.056 · Cited by 201
Arabidopsis gene co-expression network and its functional modules
Mao, L., Van Hemert, J. L., Dash, S., & Dickerson, J. A. (2009) · BMC Bioinformatics · doi:10.1186/1471-2105-10-346 · Cited by 200
A Survey of Models and Algorithms for Social Influence Analysis
Sun, J., & Tang, J. (2011) · Social Network Data Analytics · doi:10.1007/978-1-4419-8462-3_7 · Cited by 199
“More detailed studies on clustering methods are presented in the work by Girvan and Newman [29].”
MethodInfluentialNetwork analysis of particles and grains
Papadopoulos, L., Porter, M. A., Daniels, K. E., & Bassett, D. S. (2018) · Journal of Complex Networks · doi:10.1093/comnet/cny005 · Cited by 198
“One can also compute a geodesic edge betweenness centrality by calculating the fraction of shortest paths (either unweighted or weighted) that traverse it [92].”
BackgroundEvaluating local community methods in networks
Bagrow, J. P. (2008) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2008/05/p05001 · Cited by 198
An Introduction to Search Engines and Web Navigation
Levene, M. (2010) · Wiley eBooks · doi:10.1002/9780470874233 · Cited by 197
Extraction and classification of dense communities in the web
Dourisboure, Y., Geraci, F., & Pellegrini, M. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242635 · Cited by 197
A Unified Semi-Supervised Community Detection Framework Using Latent Space Graph Regularization
Yang, L., Cao, X., Jin, D., Wang, X., & Meng, D. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2377154 · Cited by 197
Local resolution-limit-free Potts model for community detection
Ronhovde, P., & Nussinov, Z. (2010) · Physical Review E · doi:10.1103/physreve.81.046114 · Cited by 197
Community detection based on modularity and an improved genetic algorithm
Shang, R., Bai, J., Jiao, L., & Jin, C. (2013) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2012.11.003 · Cited by 197
“Newman and Girvan proposed the GN algorithm, which is a kind of split method [3].”
BackgroundMethodScalable Gromov-Wasserstein Learning for Graph Partitioning and MatchingPreprint
Xu, H., Luo, D., & Carin, L. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.07645 · Cited by 197
“All of these methods explore the clustering structure of nodes heuristically based on the modularitymaximization principle [16, 12].”
BackgroundMethodInfluentialNonparametric Bayesian inference of the microcanonical stochastic block model
Peixoto, T. P. (2017) · Physical Review E · doi:10.1103/physreve.95.012317 · Cited by 196
“7 American college football [59] 115 10.”
Spatiotemporal signal propagation in complex networks
Hens, C., Harush, U., Haber, S., Cohen, R., & Barzel, B. (2019) · Nature Physics · doi:10.1038/s41567-018-0409-0 · Cited by 196
Evolutionary Conservation of Species’ Roles in Food Webs
Stouffer, D. B., Sales-Pardo, M., Sirer, M. I., & Bascompte, J. (2012) · Science · doi:10.1126/science.1216556 · Cited by 196
Wang, J., Li, M., Chen, J., & Pan, Y. (2011) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2010.75 · Cited by 196
CoFIM: A community-based framework for influence maximization on large-scale networks
Shang, J., Zhou, S., Li, X., Liu, L., & Wu, H. (2017) · Knowledge-Based Systems · doi:10.1016/j.knosys.2016.09.029 · Cited by 196
Listing All Maximal Cliques in Large Sparse Real-World Graphs
Eppstein, D., & Strash, D. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20662-7_31 · Cited by 196
Personal Networks and Ethnic Identifications: The Case of Migrants in Spain
Lubbers, M. J., Molina, J. L., & McCarty, C. (2007) · International Sociology · doi:10.1177/0268580907082255 · Cited by 194
Lopes, P. C., Block, P., & König, B. (2016) · Scientific Reports · doi:10.1038/srep31790 · Cited by 194
Social Influence on Travel Behavior: A Simulation Example of the Decision to Telecommute
Páez, A., & Scott, D. M. (2007) · Environment and Planning A: Economy and Space · doi:10.1068/a37424 · Cited by 194
Sharma, A., Menche, J., Huang, C. C., Ort, T., Zhou, X., Kitsak, M., Sahni, N., Thibault, D., Voung, L., Guo, F., et al. (2015) · Human Molecular Genetics · doi:10.1093/hmg/ddv001 · Cited by 194
“Locally dense neighborhoods of a biological network, called ‘topological modules’, can be uncovered using community detection algorithms (21,22).”
BackgroundA Novel Representation Learning for Dynamic Graphs Based on Graph Convolutional Networks
Gao, C., Zhu, J., Zhang, F., Wang, Z., & Li, X. (2023) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2022.3159661 · Cited by 194
“By some careful investigations, we find that synthetic networks generated by Girvan and Newman benchmarks [67] show a relatively clear community structure when μ 0 .”
MethodAutomated Creation of District Metered Area Boundaries in Water Distribution Systems
Diao, K., Zhou, Y., & Rauch, W. (2013) · Journal of Water Resources Planning and Management · doi:10.1061/(asce)wr.1943-5452.0000247 · Cited by 194
Replacing GDP by 2030: Towards a Common Language for the Well-being and Sustainability Community
Hoekstra, R. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108608558 · Cited by 194
Construction and analysis of protein–protein interaction networks
Raman, K. (2010) · Automated Experimentation · doi:10.1186/1759-4499-2-2 · Cited by 193
“A similar definition for ‘ edge betweenness ’ was given by Girvan and Newman [65].”
Šubelj, L., & Bajec, M. (2011) · Physical Review E · doi:10.1103/physreve.83.036103 · Cited by 193
Extensive signal integration by the phytohormone protein network
Altmann, M., Altmann, S., Rodriguez, P. A., Weller, B., Elorduy Vergara, L., Palme, J., Marín-de la Rosa, N., Sauer, M., Wenig, M., Villaécija-Aguilar, J. A., et al. (2020) · Nature · doi:10.1038/s41586-020-2460-0 · Cited by 193
Community detection in dense random networks
Verzélen, N., & Arias-Castro, E. (2014) · The Annals of Applied Probability · doi:10.1214/14-aap1080 · Cited by 193
“…problem identifying communities in networks, e.g., circles of friends in social networks, or groups of genes in graphs of gene co-occurrences (Bickel and Chen, 2009; Girvan and Newman, 2002; Lancichinetti and Fortunato, 2009; Newman, 2006; Newman and Girvan, 2004; Reichardt and Bornholdt, 2006).”
BackgroundMultilevel local search algorithms for modularity clustering
Rotta, R., & Noack, A. (2011) · ACM Journal of Experimental Algorithmics · doi:10.1145/1963190.1970376 · Cited by 194
“…[Lusseau et al. 2003]; PolBooks, a co-purchasing graph of books about U.S. politics [Krebs 2008]; AFootball, a network of college football matches [Girvan and Newman 2002]; Jazz, a collaboration network of 198 Jazz musicians [Gleiser and Danon 2003]; Celeg metab, a metabolic network of the…”
BackgroundGrowth of international collaboration in science: revisiting six specialties
Wagner, C. S., Whetsell, T. A., & Leydesdorff, L. (2017) · Scientometrics · doi:10.1007/s11192-016-2230-9 · Cited by 192
“Connections are explored at the nation-to-nation level with the assumption that nations represent an underlying political and cultural structure of scientific support (Girvan and Newman 2002).”
BackgroundMethodOverlapping communities in dynamic networks: their detection and mobile applications
Nguyen, N. P., Dinh, T. N., Tokala, S., & Thai, M. T. (2011) · Proceedings of the 17th annual international conference on Mobile computing and networking · doi:10.1145/2030613.2030624 · Cited by 192
Big Data and Urban Informatics: Innovations and Challenges to Urban Planning and Knowledge Discovery
Thakuriah, P., Tilahun, N. Y., & Zellner, M. (2017) · Springer Geography · doi:10.1007/978-3-319-40902-3_2 · Cited by 191
“Related developments in computational network perspectives to study a variety of phenomenon have also entered modeling practice, including studies of community structure (Girvan and Newman, 2002) and susceptibility of power grids to failure (Kinney et al., 2005).”
BackgroundBipartite graphs in systems biology and medicine: a survey of methods and applications
Pavlopoulos, G. A., Kontou, P. I., Pavlopoulou, A., Bouyioukos, C., Markou, E., & Bagos, P. G. (2018) · GigaScience · doi:10.1093/gigascience/giy014 · Cited by 191
Noise Bridges Dynamical Correlation and Topology in Coupled Oscillator Networks
Ren, J., Wang, W.-X., Li, B., & Lai, Y.-C. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.058701 · Cited by 191
Similarity of Neural Network Models: A Survey of Functional and Representational Measures
Klabunde, M., Schumacher, T., Strohmaier, M., & Lemmerich, F. (2025) · ACM Computing Surveys · doi:10.1145/3728458 · Cited by 191
The life and death of online groups: predicting group growth and longevity
Kairam, S. R., Wang, D. J., & Leskovec, J. (2012) · Proceedings of the fifth ACM international conference on Web search and data mining · doi:10.1145/2124295.2124374 · Cited by 190
“While extensive research has focused on identifying implicit communities within networks [10, 15, 21], this is not our present goal.”
BackgroundChae, B. (. (2019) · International Journal of Information Management · doi:10.1016/j.ijinfomgt.2018.10.023 · Cited by 190
Identification of global oil trade patterns: An empirical research based on complex network theory
Ji, Q., Zhang, H.-Y., & Fan, Y. (2014) · Energy Conversion and Management · doi:10.1016/j.enconman.2013.12.072 · Cited by 190
“Community structure The community structure of a network can be described as network nodes joining together in tightly-knit groups among which there are only looser connections [17].”
Comparative evaluation of community detection algorithms: a topological approach
Orman, G. K., Labatut, V., & Cherifi, H. (2012) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2012/08/p08001 · Cited by 192
“They can therefore be considered as complementary, and we recommend applying both of them in order to perform a complete and accurate assessment.”
MethodRate-optimal graphon estimation
Gao, C., Lu, Y., & Zhou, H. H. (2015) · The Annals of Statistics · doi:10.1214/15-aos1354 · Cited by 189
“Network analysis [20] has gained considerable research interests in both theories [7] and applications [19, 49].”
BackgroundA Network Analysis of Countries’ Export Flows: Firm Grounds for the Building Blocks of the Economy
Caldarelli, G., Cristelli, M., Gabrielli, A., Pietronero, L., Scala, A., & Tacchella, A. (2012) · PLoS ONE · doi:10.1371/journal.pone.0047278 · Cited by 189
“Similarity, like analogous correlation indicators, can be used to detect the inner structure of a network; while different methods for community detection vary in their detailed implementation [24,25], they give reasonably similar qualitative results when the indicators contain the same information.”
BackgroundCommunity Detection in Complex Networks: Multi–objective Enhanced Firefly Algorithm
Amiri, B., Hossain, L., Crawford, J. W., & Wigand, R. T. (2013) · Knowledge-Based Systems · doi:10.1016/j.knosys.2013.01.004 · Cited by 189
Palla, G., Farkas, I. J., Pollner, P., Derényi, I., & Vicsek, T. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/186 · Cited by 190
Structure and Overlaps of Ground-Truth Communities in Networks
Yang, J., & Leskovec, J. (2014) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2594454 · Cited by 189
An overview of social network analysis
Oliveira, M., & Gama, J. (2012) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1048 · Cited by 188
Tolerating the community detection resolution limit with edge weighting
Berry, J. W., Hendrickson, B., LaViolette, R. A., & Phillips, C. A. (2011) · Physical Review E · doi:10.1103/physreve.83.056119 · Cited by 188
Epidemic spreading on complex networks with community structures
Stegehuis, C., van der Hofstad, R., & van Leeuwaarden, J. S. H. (2016) · Scientific Reports · doi:10.1038/srep29748 · Cited by 188
Evolution of Complex Modular Biological Networks
Hintze, A., & Adami, C. (2008) · PLoS Computational Biology · doi:10.1371/journal.pcbi.0040023 · Cited by 188
“Such nodes are distinguished not by their connectivity, but by being major signal thoroughfares: the shortest path of many pairs of nodes runs through them ([44,45], see Methods).”
BackgroundBrain Hodotopy: From Esoteric Concept to Practical Surgical Applications
De Benedictis, A., & Duffau, H. (2011) · Neurosurgery · doi:10.1227/neu.0b013e3182124690 · Cited by 188
Large-Scale Survey of Gut Microbiota Associated With MHE Via 16S rRNA-Based Pyrosequencing
Zhang, Z., Zhai, H., Geng, J., Yu, R., Ren, H., Fan, H., & Shi, P. (2013) · American Journal of Gastroenterology · doi:10.1038/ajg.2013.221 · Cited by 188
Graph clustering with network structure indices
Rattigan, M. J., Maier, M. E., & Jensen, D. D. (2007) · International Conference on Machine Learning · doi:10.1145/1273496.1273595 · Cited by 188
“The Girvan-Newman algorithm ( Girvan & Newman, 2002 ) is a divisive clustering technique based on the concept of edge betweenness centrality.”
MethodMachine learning meets complex networks via coalescent embedding in the hyperbolic space
Muscoloni, A., Thomas, J. M., Ciucci, S., Bianconi, G., & Cannistraci, C. V. (2017) · Nature Communications · doi:10.1038/s41467-017-01825-5 · Cited by 187
Electrical centrality measures for electric power grid vulnerability analysis
Wang, Z., Scaglione, A., & Thomas, R. J. (2010) · 49th IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2010.5717964 · Cited by 187
“Girvan and Newman (2002) investigated the property of community structure in which network nodes are joined together in tightly knit groups, between which there are only looser connections [9].”
BackgroundGraph-based term weighting for information retrieval
Blanco, R., & Lioma, C. (2012) · Information Retrieval · doi:10.1007/s10791-011-9172-x · Cited by 187
Havlin, S., Kenett, D. Y., Ben-Jacob, E., Bunde, A., Cohen, R., Hermann, H., Kantelhardt, J. W., Kertész, J., Kirkpatrick, S., Kurths, J., et al. (2012) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2012-01695-x · Cited by 187
Hyper-optimized tensor network contraction
Gray, J., & Kourtis, S. (2021) · Quantum · doi:10.22331/q-2021-03-15-410 · Cited by 186
Community Detection in Temporal Multilayer Networks, with an Application to Correlation Networks
Bazzi, M., Porter, M. A., Williams, S., McDonald, M., Fenn, D. J., & Howison, S. D. (2016) · Multiscale Modeling & Simulation · doi:10.1137/15m1009615 · Cited by 186
“Analysis of community structure has been very useful in a wide range of applications, many of which are described in [24, 26, 55, 61].”
Network Medicine in the Age of Biomedical Big Data
Sonawane, A. R., Weiss, S. T., Glass, K., & Sharma, A. (2019) · Frontiers in Genetics · doi:10.3389/fgene.2019.00294 · Cited by 186
“These clusters can be identified using network topologybased methods like community detection (Girvan and Newman, 2002), modularity maximization (Newman, 2004), K-means clustering (Stuart et al.”
BackgroundIncorporating uncertainty into the study of animal social networks
Lusseau, D., Whitehead, H., & Gero, S. (2008) · Animal Behaviour · doi:10.1016/j.anbehav.2007.10.029 · Cited by 186
“It has proven useful in understanding social interactions among humans and nonhumans and how global properties emerge from them ( Girvan & Newman, 2002; Watts et al., 2002; Dodds et al., 2003; Lusseau, 2003; Lusseau & Newman, 2004; Croft et al., 2005; Flack et al., 2006; Lusseau, 2007b).”
BackgroundCoding long COVID: characterizing a new disease through an ICD-10 lens
Pfaff, E. R., Madlock-Brown, C., Baratta, J. M., Bhatia, A., Davis, H., Girvin, A., Hill, E., Kelly, E., Kostka, K., Loomba, J., et al. (2023) · BMC Medicine · doi:10.1186/s12916-023-02737-6 · Cited by 186
“In order to detect conditions that are more likely to co-occur in our study population than at random, we tested the Louvain [27], Walktrap [28], and Girvan-Newman [29] algorithms for community detection.”
A Scalable Generative Graph Model with Community Structure
Kolda, T. G., Pınar, A., Plantenga, T. D., & Seshadhri, C. (2014) · SIAM Journal on Scientific Computing · doi:10.1137/130914218 · Cited by 186
“The clustering coefficients of real-world graphs are much higher than those of random graphs with the same degree distribution [18].”
BackgroundGraph Partitioning using Quantum Annealing on the D-Wave System
Ushijima-Mwesigwa, H., Negre, C. F. A., & Mniszewski, S. M. (2017) · Proceedings of the Second International Workshop on Post Moores Era Supercomputing · doi:10.1145/3149526.3149531 · Cited by 185
“Community detection (CD) gives a high level “skeleton” view of the general structure of a graph based on a modularity metric [17, 32].”
BackgroundSeed‐dispersal interactions in fragmented landscapes – a metanetwork approach
Emer, C., Galetti, M., Pizo, M. A., Guimarães, P. R., Moraes, S., Piratelli, A., & Jordano, P. (2018) · Ecology Letters · doi:10.1111/ele.12909 · Cited by 185
“…maximising modularity (Beckett 2016) that identifies groups of nodes (here, BSD-interactions) that interact more strongly within than among modules (Girvan & Newman 2002), (4) interaction centrality: to identify which interactions show greater redundancy and potential for metanetwork connectivity…”
BackgroundGraph Structure Estimation Neural Networks
Wang, R., Mou, S., Wang, X., Xiao, W., Ju, Q., Shi, C., & Xie, X. (2021) · International World Wide Web Conference (WWW) · doi:10.1145/3442381.3449952 · Cited by 185
“GNNs, as low-pass filters [1, 23, 45] which smooth neighborhood to make the representations of proximal nodes similar, are suitable to graphs with community structure [12].”
BackgroundA gene ontology inferred from molecular networks
Dutkowski, J., Kramer, M., Surma, M. A., Balakrishnan, R., Cherry, J. M., Krogan, N. J., & Ideker, T. (2013) · Nature Biotechnology · doi:10.1038/nbt.2463 · Cited by 184
20 years of network community detection
Fortunato, S., & Newman, M. E. J. (2022) · Nature Physics · doi:10.1038/s41567-022-01716-7 · Cited by 184
Self-citation
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.