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 701–800 of 1,049
Kao, R. R., Green, D. M., Johnson, J., & Kiss, I. Z. (2007) · Journal of The Royal Society Interface · doi:10.1098/rsif.2007.1129 · Cited by 166
“This property is related to networkbased definitions of community structure, i.e. the existence of more closely linked nodes in subgroups of the population (e.g. Girvan & Newman 2002; Palla et al. 2005).”
BackgroundSemantic integration to identify overlapping functional modules in protein interaction networks
Cho, Y.-R., Hwang, W., Ramanathan, M., & Zhang, A. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-265 · Cited by 166
Inference for multiple heterogeneous networks with a common invariant subspace
Arroyo, J., Athreya, A., Cape, J., Chen, G., Priebe, C. E., & Vogelstein, J. T. (2019) · PubMed · doi:10.48550/arxiv.1906.10026 · Cited by 166
Network landscape from a Brownian particle’s perspective
Zhou, H. (2003) · Physical Review E · doi:10.1103/physreve.67.041908 · Cited by 144
Evidence for social role in a dolphin social network
Lusseau, D. (2007) · Evolutionary Ecology · doi:10.1007/s10682-006-9105-0 · Cited by 148
“Individuals with high betweenness tend to be information brokers in human societies (Girvan and Newman 2002) and potentially in bottlenose dolphin societies as well (Lusseau and Newman 2004).”
BackgroundCombining complex networks and data mining: Why and how
Zanin, M., Papo, D., Sousa, P. A., Menasalvas, E., Nicchi, A., Kubik, E., & Boccaletti, S. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.04.005 · Cited by 165
Detecting community structure in complex networks via node similarity
Pan, Y., Li, D.-H., Liu, J.-G., & Liang, J.-Z. (2010) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2010.03.006 · Cited by 165
“College football network [5] represents the schedule of games betweenAmerican college football teams in a single season.”
BackgroundMethodInfluentialUnderstanding the bias of call detail records in human mobility research
Zhao, Z., Shaw, S., Xu, Y., Lu, F., Chen, J., & Yin, L. (2016) · International Journal of Geographical Information Systems · doi:10.1080/13658816.2015.1137298 · Cited by 169
“, social network) in a city often establish a structure of communities that are more tightly connected internally and structurally distinct from others (Girvan and Newman 2002).”
BackgroundPerspective: Advances, Challenges, and Insight for Predictive Coarse-Grained Models
Noid, W. G. (2023) · The Journal of Physical Chemistry B · doi:10.1021/acs.jpcb.2c08731 · Cited by 145
Opinion space: a scalable tool for browsing online comments
Faridani, S., Bitton, E., Ryokai, K., & Goldberg, K. (2010) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1753326.1753502 · Cited by 164
Population Structure and Inbreeding From Pedigree Analysis of Purebred Dogs
Calboli, F. C. F., Sampson, J., Fretwell, N., & Balding, D. J. (2008) · Genetics · doi:10.1534/genetics.107.084954 · Cited by 164
Detecting criminal organizations in mobile phone networks
Ferrara, E., De Meo, P., Catanese, S., & Fiumara, G. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.03.024 · Cited by 164
“of the criminal network discusses as case study in this paper 235 we use our tool LogAnalysis. This framework includes two strategies to detect and explore communities: i) Girvan and Newman algorithm [36] (in the following, GN) and ii) a variant based on modularity optimization, known as Newman’s algorithm [49] fast e…”
MethodEfficient modularity optimization by multistep greedy algorithm and vertex mover refinement
Schuetz, P., & Caflisch, A. (2008) · Physical Review E · doi:10.1103/physreve.77.046112 · Cited by 164
Li, H.-J., Bu, Z., Li, A., Liu, Z., & Shi, Y. (2016) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2016.2563425 · Cited by 164
“Finally, the proposed algorithm is applied on a large-scale scientific collaboration network [64], which illustrates the investigation cooperation among 56,276 physicists according to their coauthored papers posted on the Physics E-print Archive at arxiv:org .”
MethodMixing Patterns and Community Structure in Networks
Newman, M. E. J., & Girvan, M. (2003) · Lecture notes in physics · doi:10.1007/978-3-540-44943-0_5 · Cited by 164
Self-citationMultiplicative Attribute Graph Model of Real-World Networks
Kim, M., & Leskovec, J. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-18009-5_7 · Cited by 164
“05b ], navigability [ Milgram 67 , Kleinberg 00 ], emergence of network community structure [ Fortunato 10 , Girvan and Newman 02 , Leskovec et al.”
BackgroundSpectral Coarse Graining of Complex Networks
Gfeller, D., & De Los Rios, P. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.038701 · Cited by 139
Microbial coexistence through chemical-mediated interactions
Niehaus, L., Boland, I., Liu, M., Chen, K., Fu, D., Henckel, C., Chaung, K., Miranda, S. E., Dyckman, S., Crum, M., et al. (2019) · Nature Communications · doi:10.1038/s41467-019-10062-x · Cited by 164
SlashBurn: Graph Compression and Mining beyond Caveman Communities
Lim, Y., Kang, U., & Faloutsos, C. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2320716 · Cited by 163
Yang, Y., Heppenstall, A., Turner, A., & Comber, A. (2019) · Computers, Environment and Urban Systems · doi:10.1016/j.compenvurbsys.2019.101361 · Cited by 163
A rule-of-thumb based on social affiliation explains collective movements in desert baboons
King, A. J., Sueur, C., Huchard, E., & Cowlishaw, G. (2011) · Animal Behaviour · doi:10.1016/j.anbehav.2011.09.017 · Cited by 163
Multilayer Stochastic Block Models Reveal the Multilayer Structure of Complex Networks
Vallès-Català, T., Massucci, F. A., Guimerà, R., & Sales‐Pardo, M. (2016) · Physical Review X · doi:10.1103/physrevx.6.011036 · Cited by 164
The Structure of Spatial Networks and Communities in Bicycle Sharing Systems
Austwick, M. Z., O’Brien, O., Strano, E., & Viana, M. P. (2013) · PLoS ONE · doi:10.1371/journal.pone.0074685 · Cited by 163
“For a directed weighted network described by Yij, we can use the following, usually called the modularity after [17] and [18]:”
MethodAslam, F., Mohmand, Y. T., Ferreira, P., Memon, B. A., Khan, M. H., & Khan, M. (2020) · Borsa Istanbul Review · doi:10.1016/j.bir.2020.09.003 · Cited by 163
Mitigation potential of global ammonia emissions and related health impacts in the trade network
Ma, R., Li, K., Guo, Y., Zhang, B., Zhao, X., Linder, S., Guan, C., Chen, G. Q., Gan, Y., & Meng, J. (2021) · Nature Communications · doi:10.1038/s41467-021-25854-3 · Cited by 163
Using artificial intelligence to document the hidden RNA virosphere
Hou, X., He, Y., Fang, P., Mei, S.-Q., Xu, Z., Wu, W.-C., Tian, J.-H., Zhang, S., Zeng, Z.-Y., Gou, Q.-Y., et al. (2024) · Cell · doi:10.1016/j.cell.2024.09.027 · Cited by 162
Minimax rates of community detection in stochastic block models
Zhang, A. Y., & Zhou, H. H. (2016) · The Annals of Statistics · doi:10.1214/15-aos1428 · Cited by 162
Analysis of the air cargo transport network using a complex network theory perspective
Bombelli, A., Santos, B. F., & Tavasszy, L. (2020) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2020.101959 · Cited by 162
Introducing the biogeographic species pool
Carstensen, D. W., Lessard, J., Holt, B. G., Krabbe Borregaard, M., & Rahbek, C. (2013) · Ecography · doi:10.1111/j.1600-0587.2013.00329.x · Cited by 162
“The network analysis approach allows the grouping of species and sites into distinct compartments, or modules (Girvan and Newman 2002, Newman and Girvan 2004).”
MethodA Maximal Clique Based Multiobjective Evolutionary Algorithm for Overlapping Community Detection
Wen, X., Chen, W.-N., Lin, Y., Gu, T., Zhang, H., Li, Y., Yin, Y., & Zhang, J. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2605501 · Cited by 162
Evolutionary Nonnegative Matrix Factorization Algorithms for Community Detection in Dynamic Networks
Ma, X., & Dong, D. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2657752 · Cited by 162
“In scientific collaboration networks, communities correspond to the groups of scientists with same or similar research directions [3].”
BackgroundTime series clustering via community detection in networks
Ferreira, L. N., & Zhao, L. (2016) · Information Sciences · doi:10.1016/j.ins.2015.07.046 · Cited by 162
“Such structures are commonly observed in real world networks [18].”
BackgroundLocal modularity measure for network clusterizations
Muff, S., Rao, F., & Caflisch, A. (2005) · Physical Review E · doi:10.1103/physreve.72.056107 · Cited by 162
Multi-tissue coexpression networks reveal unexpected subnetworks associated with disease
Dobrin, R., Zhu, J., Molony, C., Argman, C., Parrish, M. L., Carlson, S., Allan, M. F., Pomp, D., & Schadt, E. E. (2009) · Genome Biology · doi:10.1186/gb-2009-10-5-r55 · Cited by 162
Altered Anatomical Network in Early Blindness Revealed by Diffusion Tensor Tractography
Shu, N., Liu, Y., Li, J., Li, Y., Yu, C., & Jiang, T. (2009) · PLoS ONE · doi:10.1371/journal.pone.0007228 · Cited by 152
“The betweenness Bi of a node i is defined as the number of shortest paths between pairs of other nodes that pass through the node i [90,91].”
BackgroundAnalysis of next-generation genomic data in cancer: accomplishments and challenges
Ding, L., Wendl, M. C., Koboldt, D. C., & Mardis, E. R. (2010) · Human Molecular Genetics · doi:10.1093/hmg/ddq391 · Cited by 163
A Dependency Graph Approach for Fault Detection and Localization Towards Secure Smart Grid
He, M., & Zhang, J. (2011) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2011.2129544 · Cited by 162
“For the multiscale decomposition, we apply the clustering algorithm in [26] and group the GMRF into 16 clusters at the second scale, and 4 clusters at the third scale.”
MethodEstablishing a link between sex-related differences in the structural connectome and behaviour
Tunç, B., Solmaz, B., Parker, D., Satterthwaite, T. D., Elliott, M. A., Calkins, M. E., Ruparel, K., Gur, R. E., Gur, R. C., & Verma, R. (2016) · Philosophical Transactions of the Royal Society B: Biological Sciences · doi:10.1098/rstb.2015.0111 · Cited by 150
Self-similar disk packings as model spatial scale-free networks
Doye, J. P. K., & Massen, C. P. (2005) · Physical Review E · doi:10.1103/physreve.71.016128 · Cited by 149
Tang, E., Giusti, C., Baum, G. L., Gu, S., Pollock, E., Kahn, A. E., Roalf, D. R., Moore, T. M., Ruparel, K., Gur, R. C., et al. (2017) · Nature Communications · doi:10.1038/s41467-017-01254-4 · Cited by 161
On the Problem of Reconstructing an Unknown Topology via Locality Properties of the Wiener Filter
Materassi, D., & Salapaka, M. V. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2183170 · Cited by 161
“While networks of dynamical systems are well studied and analyzed in physics [18, 19, 20] and engineering [21, 22, 23], there are fewer results that address the problem of reconstructing an unknown dynamical network, since it poses formidable theoretical and practical challenges [24].”
BackgroundCommunity detection using a neighborhood strength driven Label Propagation Algorithm
Xie, J., & Szymanski, B. K. (2011) · 2011 IEEE Network Science Workshop · doi:10.1109/nsw.2011.6004645 · Cited by 161
Structural characteristics of complex supply chain networks
Wiedmer, R., & Griffis, S. E. (2021) · Journal of Business Logistics · doi:10.1111/jbl.12283 · Cited by 161
Multi-level Algorithms for Modularity Clustering
Noack, A., & Rotta, R. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02011-7_24 · Cited by 163
“graph size subdivision coarsening local search math prog SS+ML karate [42] 34 [29] .419 [41] .4198 [12] .4188 [1] .4197 .4197 dolphins [22] 62 [29] .4893 [31] .5171 [33] .5285 [40] .5285 .5276 polBooks [21] 105 [29] .3992 [37] .5269 [4] .5204 [1] .5272 .5269 afootball [ 14 ] 115 [39] .602 [41] .605 [4] .6045 [1] .6046…”
The dynamic functional core network of the human brain at rest
Kabbara, A., Falou, W. E., Khalil, M. A., Wendling, F., & Hassan, M. (2017) · Scientific Reports · doi:10.1038/s41598-017-03420-6 · Cited by 161
Maritime constellations: a complex network approach to shipping and ports
Ducruet, C., & ZAIDI, F. A. (2012) · Maritime Policy & Management · doi:10.1080/03088839.2011.650718 · Cited by 161
“Some methods are based on various algorithms, such as divisive hierarchical clustering based on edge betweenness [33].”
MethodBirkett, M., & Espelage, D. L. (2015) · Social Development · doi:10.1111/sode.12085 · Cited by 160
Who Is the Best Player Ever? A Complex Network Analysis of the History of Professional Tennis
Radicchi, F. (2011) · PLoS ONE · doi:10.1371/journal.pone.0017249 · Cited by 160
Krasnov, B. R., Fortuna, M. A., Mouillot, D., Khokhlova, I. S., Shenbrot, G. I., & Poulin, R. (2012) · The American Naturalist · doi:10.1086/664612 · Cited by 160
“Modular structure has been found to be ubiquitous in both ecological and nonecological networks (Girvan and Newman 2002; Amaral and Ottino 2004; Guimerà and Amaral 2005a).”
BackgroundRecent advances in clustering methods for protein interaction networks
Wang, J., Li, M., Deng, Y., & Pan, Y. (2010) · BMC Genomics · doi:10.1186/1471-2164-11-s3-s10 · Cited by 160
“Girvan and Newman [28] discussed this strategy and found that it did not work well because there was no guarantee that all edges between modules would have high betweenness when there were more than one edges between two modules.”
BackgroundMethodInfluentialEcological Systems as Complex Systems: Challenges for an Emerging Science
Anand, M., Gonzalez, A., Guichard, F., Kolasa, J., & Parrott, L. (2010) · Diversity · doi:10.3390/d2030395 · Cited by 161
The centrality of pivotal points in the evolution of scientific networks
Chen, C. (2005) · ACM International Conference on Intelligent User Interfaces (IUI) · doi:10.1145/1040830.1040859 · Cited by 160
“The following review focuses on intelligent and user interface aspects of identifying thematic trends in scientific literature.”
BackgroundRevisiting Date and Party Hubs: Novel Approaches to Role Assignment in Protein Interaction Networks
Agarwal, S., Deane, C. M., Porter, M. A., & Jones, N. S. (2010) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000817 · Cited by 139
“We use a measure of link significance known as betweenness centrality [12,25] and examine its relation to phenomena such as protein co-expression and functional overlap.”
BackgroundMethodFluid Communities: A Competitive, Scalable and Diverse Community Detection Algorithm
Parés, F., García-Gasulla, D., Vilalta, A., Moreno, J., Ayguadé, E., Labarta, J., Cortés, U., & Suzumura, T. (2017) · Studies in computational intelligence · doi:10.1007/978-3-319-72150-7_19 · Cited by 160
“…et al [16], where the following eight algorithms were compared in terms of Normalized Mutual Information (NMI) and computing time: Edge Betweenness [4], Fast greedy [2], Infomap [14, 15], Label Propagation [11], Leading Eigenvector [8], Multilevel (i.e., Louvain) [1], Spinglass [12] and Walktrap…”
MethodHypergraph reconstruction from network data
Young, J.-G., Petri, G., & Peixoto, T. P. (2021) · Communications Physics · doi:10.1038/s42005-021-00637-w · Cited by 160
MAGUS: machine learning and graph theory assisted universal structure searcher
Wang, J., Gao, H., Han, Y., Ding, C., Pan, S., Wang, Y., Jia, Q., Wang, H., Xing, D., & Sun, J. (2023) · National Science Review · doi:10.1093/nsr/nwad128 · Cited by 161
A comprehensive review of community detection in graphs
Li, J., Lai, S., Shuai, Z., Tan, Y., Jia, Y., Yu, M., Song, Z., Peng, X., Xu, Z., Ni, Y., et al. (2024) · Neurocomputing · doi:10.1016/j.neucom.2024.128169 · Cited by 160
Zhuge, H. (2009) · Artificial Intelligence · doi:10.1016/j.artint.2009.11.014 · Cited by 160
“Complex network analysis is to find the rules and structure such as the scale-free and community structures hidden in large-scale complex networks [1,5,19,20,26].”
BackgroundLearning structures: Predictive representations, replay, and generalization
Momennejad, I. (2020) · Current Opinion in Behavioral Sciences · doi:10.1016/j.cobeha.2020.02.017 · Cited by 159
The dynamics of social networks among female Asian elephants
de Silva, S., Ranjeewa, A. D., & Kryazhimskiy, S. (2011) · BMC Ecology · doi:10.1186/1472-6785-11-17 · Cited by 159
“We then identify social clusters within the network using the GirvanNewman algorithm for community detection [70].”
MethodCommunity structure in Congressional cosponsorship networks
Zhang, Y., Friend, A. J., Traud, A. L., Porter, M. A., Fowler, J. H., & Mucha, P. J. (2008) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2007.11.004 · Cited by 159
Engineering Parallel Algorithms for Community Detection in Massive Networks
Staudt, C. L., & Meyerhenke, H. (2016) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2015.2390633 · Cited by 159
“The quality measure modularity [14] formalizes the notion of a good community detection solution by comparing its coverage (fraction of edges within communities) to an expected value based on a random edge distribution model which preserves the degree distribution.”
BackgroundTag-Aware Recommender Systems: A State-of-the-Art Survey
Zhang, Z.-K., Zhou, T., & Zhang, Y.-C. (2011) · Journal of Computer Science and Technology · doi:10.1007/s11390-011-0176-1 · Cited by 159
“combined LDA and GN community detection algorithm[91-92] to observe the topic distributions of communities, as well as community evolving over time in social tagging systems.”
MethodSytch, M., & Tatarynowicz, A. (2014) · Academy of Management Journal · doi:10.5465/amj.2011.0655 · Cited by 159
“In many sparsely connected social systems, these communities typically do not overlap (e.g., Girvan & Newman, 2002; Shipilov, Li, & Greve, 2011; Sytch et al., 2012).”
BackgroundMethodZhang, W., Chong, Z., Li, X., & Nie, G. (2020) · Cities · doi:10.1016/j.cities.2020.102640 · Cited by 159
A Survey of Privacy-Preservation of Graphs and Social Networks
Wu, X., Ying, X., Liu, K., & Chen, L. (2010) · The Kluwer international series on advances in database systems · doi:10.1007/978-1-4419-6045-0_14 · Cited by 159
Melo, M. C. R., Bernardi, R. C., de la Fuente-Nunez, C., & Luthey-Schulten, Z. (2020) · The Journal of Chemical Physics · doi:10.1063/5.0018980 · Cited by 146
Multiplicative Attribute Graph Model of Real-World Networks
Kim, M., & Leskovec, J. (2012) · Internet Mathematics · doi:10.1080/15427951.2012.625257 · Cited by 159
Organization of Excitable Dynamics in Hierarchical Biological Networks
Müller-Linow, M., Hilgetag, C. C., & Hütt, M.-T. (2008) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000190 · Cited by 147
“found to be organized in network modules [3,4], or to contain”
BackgroundThe Compositional and Evolutionary Logic of Metabolism
Braakman, R., & Smith, E. (2012) · Physical Biology · doi:10.1088/1478-3975/10/1/011001 · Cited by 158
“[296] M.”
MethodClustering With Multi-Layer Graphs: A Spectral Perspective
Dong, X., Frossard, P., Vandergheynst, P., & Nefedov, N. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2212886 · Cited by 158
“• Community detection via modularity maximization ( CD ): In addition to spectral-based clustering algorithms, modularity maximization is an approach proposed by Newman et al [25][26][27] for community detection.”
Embeddedness, Prosociality, and Social Influence: Evidence from Online Crowdfunding1
Hong, Y., Hu, Y., & Burtch, G. (2018) · MIS Quarterly · doi:10.25300/misq/2018/14105 · Cited by 158
Bertolero, M. A., Yeo, B. T. T., & D’Esposito, M. (2017) · Nature Communications · doi:10.1038/s41467-017-01189-w · Cited by 158
Reiner, R. C., Stoddard, S. T., & Scott, T. W. (2014) · Epidemics · doi:10.1016/j.epidem.2013.12.003 · Cited by 158
“, no directionality to interactions, indicating a symmetric contact network), the concept of communities is analogous to overlapping social movement (Radicchi et al., 2004; Girvan and Newman, 2002).”
BackgroundCommunity Detection based on Distance Dynamics
Shao, J., Han, Z., Yang, Q., & Zhou, T. (2015) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2783258.2783301 · Cited by 159
“Many approaches have been proposed to identify communities based on different criteria (e.g. be-tweenness [5], normalized cut [16], modularity [11], etc.), and each criterion comes to specific advantages and drawbacks.”
BackgroundMeasuring Crowd Collectiveness
Zhou, B., Tang, X., Zhang, H., & Wang, X. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2300484 · Cited by 158
Reconstructing Networks with Unknown and Heterogeneous Errors
Peixoto, T. P. (2018) · Physical Review X · doi:10.1103/physrevx.8.041011 · Cited by 157
The structural changes of a local tourism network: comparison of before and after COVID-19
Jeon, C., & Yang, H. (2021) · Current Issues in Tourism · doi:10.1080/13683500.2021.1874890 · Cited by 158
“To analyze cohesion, we used modularity to analyze the CNM algorithm (Girvan & Newman, 2002).”
MethodLi, Y., Liu, C., Sack, L., Xu, L., Li, M., Zhang, J., & He, N. (2022) · Ecology Letters · doi:10.1111/ele.14009 · Cited by 159
Steinig, E. J., Neuditschko, M., Khatkar, M. S., Raadsma, H. W., & Zenger, K. R. (2015) · Molecular Ecology Resources · doi:10.1111/1755-0998.12442 · Cited by 157
Beyond 'Caveman Communities': Hubs and Spokes for Graph Compression and Mining
Kang, U., & Faloutsos, C. (2011) · Proceedings · doi:10.1109/icdm.2011.26 · Cited by 158
“There has been a lot of works on network community detection, including METIS and related works [19], [20], edge betweenness [21], co-clustering [3], [22], cross-associations [4], spectral clustering [2], [23], and shingle-ordering [5].”
BackgroundNeuditschko, M., Khatkar, M. S., & Raadsma, H. W. (2012) · PLoS ONE · doi:10.1371/journal.pone.0048375 · Cited by 157
“in the analysis of epidemiology [43], in identifying graph structures in the Internet and world wide web [44] and for deriving community structures in social and biological networks [45].”
BackgroundCross-resistance is modular in bacteria–phage interactions
Wright, R. C. T., Friman, V.-P., Smith, M. C. M., & Brockhurst, M. A. (2018) · PLOS Biology · doi:10.1371/journal.pbio.2006057 · Cited by 137
Park, I., & Yoon, B. (2018) · Journal of Informetrics · doi:10.1016/j.joi.2018.09.007 · Cited by 157
Network robustness to targeted attacks. The interplay of expansibility and degree distribution
Estrada, E. (2006) · The European Physical Journal B · doi:10.1140/epjb/e2006-00330-7 · Cited by 157
Jeub, L. G. S., Balachandran, P., Porter, M. A., Mucha, P. J., & Mahoney, M. W. (2015) · Physical Review E · doi:10.1103/physreve.91.012821 · Cited by 155
Learning and Predicting the Evolution of Social Networks
Bringmann, B., Berlingerio, M., Bonchi, F., & Gionis, A. (2010) · IEEE Intelligent Systems · doi:10.1109/mis.2010.91 · Cited by 156
A novel measure of edge centrality in social networks
Meo, P. D., Ferrara, E., Fiumara, G., & Ricciardello, A. (2012) · Knowledge-Based Systems · doi:10.1016/j.knosys.2012.01.007 · Cited by 156
“This is an interesting improvement of the state-of-the-art: in fact, exact algorithms for computing centrality run in O(n(3)) and, with some ingenious optimizations they can run in O(nm) [17, 5].”
BackgroundMethodResultInfluentialOptimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that
Donetti, L., Neri, F. M., & Muñoz, M. A. (2006) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2006/08/p08007 · Cited by 155
Pei, Y., Chakraborty, N., & Katia, S. (2015) · International Conference on Artificial Intelligence · Cited by 155
Zhu, J., Wang, J., Han, W., & Xu, D. H. (2022) · Nature Communications · doi:10.1038/s41467-022-29331-3 · Cited by 155
Ecological modules and roles of species in heathland plant–insect flower visitor networks
Dupont, Y. L., & Olesen, J. M. (2008) · Journal of Animal Ecology · doi:10.1111/j.1365-2656.2008.01501.x · Cited by 155
Do all birds tweet the same?: characterizing twitter around the world
Poblete, B., Garcia, R., Mendoza, M., & Jaimes, A. (2011) · Proceedings of the 20th ACM international conference on Information and knowledge management · doi:10.1145/2063576.2063724 · Cited by 120
“[6] M. Girvan and M. E. J. Newman.”
MethodInfluentialMining attribute-structure correlated patterns in large attributed graphs
Silva, A., Meira, W., & Zaki, M. J. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2140436.2140443 · Cited by 153
PATRIC: a parallel algorithm for counting triangles in massive networks
Arifuzzaman, S., Khan, M., & MARATHE, M. V. (2013) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2505515.2505545 · Cited by 153
Supersize me: how whole-genome sequencing and big data are transforming epidemiology
Kao, R. R., Haydon, D. T., Lycett, S., & Murcia, P. R. (2014) · Trends in Microbiology · doi:10.1016/j.tim.2014.02.011 · Cited by 153
The invasion of language: emergence, change and death
Wang, W. Y., & Minett, J. W. (2005) · Trends in Ecology & Evolution · doi:10.1016/j.tree.2005.03.001 · Cited by 153
Benigni, M., Joseph, K., & Carley, K. M. (2017) · PLoS ONE · doi:10.1371/journal.pone.0181405 · Cited by 153
Fractality in complex networks: Critical and supercritical skeletons
Kim, J. S., Goh, K.-I., Salvi, G. E., Oh, E., Kahng, B., & Kim, D. (2007) · Physical Review E · doi:10.1103/physreve.75.016110 · Cited by 153
COEVOLVE: A Joint Point Process Model for Information Diffusion and Network Co-evolutionPreprint
Farajtabar, M., Wang, Y., Gomez-Rodriguez, M., Li, S., Zha, H., & Song, L. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1507.02293 · Cited by 153
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.