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 101–200 of 1,049
Statistical physics of vaccination
Wang, Z., Bauch, C. T., Bhattacharyya, S., d'Onofrio, A., Manfredi, P., Perc, M., Perra, N., Salathé, M., & Zhao, D. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.10.006 · Cited by 872
“Both social and infrastructure networks are organized in communities of tightly interconnected nodes of individuals [170].”
BackgroundOverlapping Community Detection in Networks: the State of the Art and Comparative Study
Xie, J., Kelley, S., & Szymanski, B. K. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1110.5813 · Cited by 865
“In the GN benchmark · 15 [Girvan and Newman 2002], equal size communities are embedded into a network for a given expected degree and a given mixing parameter µ that measures the ratio of internal connections to outgoing connections.”
BackgroundMorphological integration and developmental modularity
Klingenberg, C. P. (2008) · Annual Review of Ecology Evolution and Systematics · doi:10.1146/annurev.ecolsys.37.091305.110054 · Cited by 863
“Traditionally, hierarchical clustering has been used for this purpose, but these methods have a number of disadvantages (Girvan & Newman 2002).”
BackgroundMethodInfluentialStatistical properties of community structure in large social and information networks
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367591 · Cited by 860
“Hierarchical clustering is a common approach to community identification in the social sciences [152], but it has also found application more generally [79, 89].”
BackgroundMethodOverlapping community detection at scale: a nonnegative matrix factorization approach
Yang, J., & Leskovec, J. (2013) · Proceedings of the sixth ACM international conference on Web search and data mining · doi:10.1145/2433396.2433471 · Cited by 852
Disentangling Interactions in the Microbiome: A Network Perspective
Layeghifard, M., Hwang, D. M., & Guttman, D. S. (2017) · Trends in Microbiology · doi:10.1016/j.tim.2016.11.008 · Cited by 851
“Edge betweenness is a popular method in which links are removed in the decreasing order of their betweenness scores [71].”
MethodSocial big data: recent achievements and new challenges
Bello-Orgaz, G., Jung, J. J., & Camacho, D. (2016) · Information Fusion · doi:10.1016/j.inffus.2015.08.005 · Cited by 846
“For this reason, Newman re-formulated the modularity measure in terms of eigenvectors by re-placing the Laplacian matrix with the modularity matrix [52], called the spectral optimization of modularity.”
MethodInfluentialRosvall, M., Axelsson, D., & Bergstrom, C. T. (2009) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2010-01179-1 · Cited by 844
What's in a crowd? Analysis of face-to-face behavioral networks
Isella, L., Stehlé, J., Barrat, A., Cattuto, C., Pinton, J.-F., & Van den Broeck, W. (2011) · Journal of Theoretical Biology · doi:10.1016/j.jtbi.2010.11.033 · Cited by 825
“While the concepts of node failures and targeted attacks are pertinent for infrastructure networks, successive removals of nodes or links is more generally a way to study network structures (Holme et al., 2002; Girvan and Newman, 2002; Radicchi et al., 2004; Dall’Asta et al., 2006).”
InfluentialA Survey of Statistical Network Models
Goldenberg, A., Zheng, A. X., Fienberg, S. E., & Airoldi, E. M. (2010) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000005 · Cited by 819
“More recently this style of statistical physics models have been used to detect community structure in networks, e.g., see Girvan and Newman [122] and 5 Backstrom et al. [20], a phenomenon which has its counterpart description in the social science network modeling literature.”
Network topology of the interbank market
Boss, M., Elsinger, H., Summer, M., & Thurner, S. (2004) · Quantitative Finance · doi:10.1080/14697680400020325 · Cited by 818
A scientometric review of global research on sustainability and sustainable development
Olawumi, T. O., & Chan, D. W. M. (2018) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2018.02.162 · Cited by 816
An information-theoretic framework for resolving community structure in complex networks
Rosvall, M., & Bergstrom, C. T. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0611034104 · Cited by 808
Finding overlapping communities in networks by label propagation
Gregory, S. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/10/103018 · Cited by 806
4 Community Detection in Networks with Node Attributes
Yang, J., McAuley, J., & Leskovec, J. (2013) · Cited by 803
Analyzing and modeling real-world phenomena with complex networks: a survey of applications
Costa, L. D. F., Oliveira, O. N., Travieso, G., Rodrigues, F. A., Villas Boas, P. R., Antiqueira, L., Viana, M. P., & Correa Rocha, L. E. (2011) · Advances in Physics · doi:10.1080/00018732.2011.572452 · Cited by 800
Missing and spurious interactions and the reconstruction of complex networks
Guimerà, R., & Sales-Pardo, M. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0908366106 · Cited by 797
“First, nodes in real networks are often organized into modules or communities [15, 16], which may overlap [17] or be hierarchically nested [18, 19, 11], so that connections are relatively more abundant within modules than between modules.”
BackgroundCompartments revealed in food-web structure.
Krause, A. E., Frank, K. A., Mason, D. M., Ulanowicz, R. E., & Taylor, W. W. (2003) · Nature · doi:10.1038/nature02115 · Cited by 795
Consensus clustering in complex networks
Lancichinetti, A., & Fortunato, S. (2012) · Scientific Reports · doi:10.1038/srep00336 · Cited by 795
Dynamical networks in tRNA:protein complexes
Sethi, A., Eargle, J., Black, A. A., & Luthey-Schulten, Z. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0810961106 · Cited by 789
“The community structure is identified by using the Girvan–Newman algorithm (13), which uses a topdown approach to iteratively remove the edge with the highest betweenness and recalculate the betweenness of all remaining edges until none of the edges remain.”
MethodFinding local community structure in networks
Clauset, A. (2005) · Physical Review E · doi:10.1103/physreve.72.026132 · Cited by 788
“Several algorithms have recently been proposed within the physics community, and have been shown to reliably extract known community structure in real world networks [16, 17, 18, 19, 20, 21].”
BackgroundCommunities, modules and large-scale structure in networks
Newman, M. E. J. (2012) · Nature Physics · doi:10.1038/nphys2162 · Cited by 787
“Among the first proposals were approaches based on a measure known as betweenness 14,21,41 , in which one calculates one of several measures of the flow of (imaginary) traffic across the edges of a network and then removes from the network those edges with the most traffic.”
InfluentialSelf-citationDissecting Immune Circuits by Linking CRISPR-Pooled Screens with Single-Cell RNA-Seq
Jaitin, D. A., Weiner, A., Yofe, I., Lara-Astiaso, D., Keren-Shaul, H., David, E., Salame, T. M., Tanay, A., van Oudenaarden, A., & Amit, I. (2016) · Cell · doi:10.1016/j.cell.2016.11.039 · Cited by 777
“…the noisy and missing genotype labeling, we developed a label refinement algorithm based on k -Nearest Neighbors (kNN) graph (Blondel et al., 2008; Girvan and Newman, 2002; Levine et al., 2015) to correct the genotype labeling based on the genotype of neighboring cells (Figures 4A and 4B; Table…”
Economic small-world behavior in weighted networks
Latora, V., & Marchiori, M. (2003) · The European Physical Journal B - Condensed Matter and Complex Systems · doi:10.1140/epjb/e2003-00095-5 · Cited by 772
Modularity and community detection in bipartite networks
Barber, M. J. (2007) · Physical Review E · doi:10.1103/physreve.76.066102 · Cited by 771
Models of social networks based on social distance attachment
Boguñá, M., Pastor-Satorras, R., Díaz-Guilera, A., & Arenas, A. (2004) · Physical Review E · doi:10.1103/physreve.70.056122 · Cited by 769
Compartmentalization increases food-web persistence
Stouffer, D. B., & Bascompte, J. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1014353108 · Cited by 768
“P 1⁄4 αþ βC þ γM þ ε; [8]”
Defining and evaluating network communities based on ground-truth
Yang, J., & Leskovec, J. (2012) · Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics · doi:10.1145/2350190.2350193 · Cited by 762
Mine Your Own Business: Market-Structure Surveillance Through Text Mining
Netzer, O., Feldman, R., Goldenberg, J., & Fresko, M. (2012) · Marketing Science · doi:10.1287/mksc.1120.0713 · Cited by 750
Cartography of complex networks: modules and universal roles
Guimerà, R., & Amaral, L. A. N. (2005) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2005/02/p02001 · Cited by 749
Scale-Free Networks: Complex Webs in Nature and Technology
Caldarelli, G. (2007) · doi:10.1093/acprof:oso/9780199211517.001.0001 · Cited by 748
A high-resolution human contact network for infectious disease transmission
Salathé, M., Kazandjieva, M., Lee, J. W., Levis, P., Feldman, M. W., & Jones, J. H. (2010) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1009094108 · Cited by 739
“Community structure (or modularity) is relatively high, increasingly so with higher values of cm, indicating that more intense contacts tend to occur more often in subgroups and less often between such groups (24).”
BackgroundON SOCIAL NETWORK ANALYSIS IN A SUPPLY CHAIN CONTEXT*
BORGATTI, S. P., & LI, X. (2009) · Journal of Supply Chain Management · doi:10.1111/j.1745-493x.2009.03166.x · Cited by 733
“This fact has been exploited to construct an algorithm (Girvan and Newman, 2002) for detecting what is known in the social networks world as cohesive subgroups, which we discuss next.”
BackgroundA Brain-Wide Study of Age-Related Changes in Functional Connectivity
Geerligs, L., Renken, R. J., Saliasi, E., Maurits, N. M., & Lorist, M. M. (2015) · Cerebral Cortex · doi:10.1093/cercor/bhu012 · Cited by 730
Identifying the role that animals play in their social networks
Lusseau, D., & Newman, M. E. J. (2004) · Proceedings of the Royal Society of London. Series B: Biological Sciences · doi:10.1098/rsbl.2004.0225 · Cited by 729
Self-citationDetect overlapping and hierarchical community structure in networks
Shen, H., Cheng, X., Cai, K., & Hu, M.-B. (2009) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2008.12.021 · Cited by 723
“Identifying the community structure is crucial to understand the structural and functional properties of the networks [4, 5, 6].”
BackgroundCommunicability in complex networks
Estrada, E., & Hatano, N. (2008) · Physical Review E · doi:10.1103/physreve.77.036111 · Cited by 719
Evidence for hubs in human functional brain networks
Power, J. D., Schlaggar, B. L., Lessov-Schlaggar, C. N., & Petersen, S. E. (2013) · Neuron · doi:10.1016/j.neuron.2013.07.035 · Cited by 716
Network Representation Learning: A Survey
Zhang, D., Yin, J., Zhu, X., & Zhang, C. (2020) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2018.2850013 · Cited by 714
“Many networks have community structure, where vertex-vertex connections within the same community are dense, but connections to vertices outside the community are sparse [27].”
Backgroundk-Core Organization of Complex Networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.040601 · Cited by 709
Social structure of Facebook networks
Traud, A. L., Mucha, P. J., & Porter, M. A. (2012) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2011.12.021 · Cited by 707
“As we illustrate below, both perspectives are important because they provide complementary insights.”
Modular organization of cellular networks
Rives, A. W., & Galitski, T. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0237338100 · Cited by 703
A human functional protein interaction network and its application to cancer data analysis
Wu, G., Feng, X., & Stein, L. (2010) · Genome Biology · doi:10.1186/gb-2010-11-5-r53 · Cited by 692
“The edge-betweenness algorithm [75] has been used to find network modules in protein interaction networks [76-78].”
MethodA Comparative Analysis of Community Detection Algorithms on Artificial Networks
Yang, Z., Algesheimer, R., & Tessone, C. J. (2016) · Zurich Open Repository and Archive (University of Zurich) · doi:10.5167/uzh-127494 · Cited by 685
Imagining Twitter as an Imagined Community
Gruzd, A., Wellman, B., & Takhteyev, Y. (2011) · American Behavioral Scientist · doi:10.1177/0002764211409378 · Cited by 671
Human symptoms–disease network
Zhou, X., Menche, J., Barabási, A.-L., & Sharma, A. (2014) · Nature Communications · doi:10.1038/ncomms5212 · Cited by 653
“In the HSDN, AD shows high symptom similarity with epilepsy and several of its variants, like temporal lobe epilepsy (0.63).”
BackgroundInfluentialThe discovery of structural form
Kemp, C., & Tenenbaum, J. B. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0802631105 · Cited by 650
Social media and political communication: a social media analytics framework
Stieglitz, S., & Dang-Xuan, L. (2013) · Social Network Analysis and Mining · doi:10.1007/s13278-012-0079-3 · Cited by 647
Clustering and Community Detection in Directed Networks: A SurveyPreprint
Malliaros, F. D., & Vazirgiannis, M. (2016) · Cited by 641
Spectral redemption in clustering sparse networks
Krzakala, F., Moore, C., Mossel, E., Neeman, J., Sly, A., Zdeborová, L., & Zhang, P. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1312486110 · Cited by 638
“[28] Girvan, M.”
BackgroundNetwork analysis reveals open forums and echo chambers in social media discussions of climate change
Williams, H. T. P., McMurray, J. R., Kurz, T., & Hugo Lambert, F. (2015) · Global Environmental Change · doi:10.1016/j.gloenvcha.2015.03.006 · Cited by 631
“We found partitions giving high modularity scores ((Girvan and Newman, 2002; Newman, 2006)) for all networks (Tables S2, S3 and S4), indicating strong community structure.”
BackgroundMapping Change in Large Networks
Rosvall, M., & Bergstrom, C. T. (2010) · PLoS ONE · doi:10.1371/journal.pone.0008694 · Cited by 630
“Researchers have developed a suite of network mapping tools to highlight important features while simplifying the overall structure of social and biological systems [1–6].”
BackgroundSystematic inequality and hierarchy in faculty hiring networks
Clauset, A., Arbesman, S., & Larremore, D. B. (2015) · Science Advances · doi:10.1126/sciadv.1400005 · Cited by 624
Social network analysis: Characteristics of online social networks after a disaster
Kim, J., & Hastak, M. (2018) · International Journal of Information Management · doi:10.1016/j.ijinfomgt.2017.08.003 · Cited by 618
Community detection in Social Media: Performance and application considerations
Papadopoulos, S., Kompatsiaris, Y., Vakali, A., & Spyridonos, P. (2012) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-011-0224-z · Cited by 615
“Detecting and analyzing the community structure of networks has led to important findings in a wide range of domains, ranging from biology to social sciences (Girvan and Newman 2002) and the Web (Kumar et al. 1999; Flake et al. 2000).”
BackgroundMethodLine graphs, link partitions, and overlapping communities
Evans, T. S., & Lambiotte, R. (2009) · Physical Review E · doi:10.1103/physreve.80.016105 · Cited by 615
Origins of fractality in the growth of complex networks
Song, C., Havlin, S., & Makse, H. A. (2006) · Nature Physics · doi:10.1038/nphys266 · Cited by 613
Computer‐Assisted Synthetic Planning: The End of the Beginning
Szymkuć, S., Gajewska, E. P., Klucznik, T., Molga, K., Dittwald, P., Startek, M., Bajczyk, M., & Grzybowski, B. A. (2016) · Angewandte Chemie International Edition · doi:10.1002/anie.201506101 · Cited by 611
Graph mining: Laws, generators, and algorithms
Chakrabarti, D., & Faloutsos, C. (2006) · ACM Computing Surveys · doi:10.1145/1132952.1132954 · Cited by 609
Shin, Y., Meneely, A., Williams, L., & Osborne, J. A. (2011) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2010.81 · Cited by 607
“To collect complexity metrics, we used Understand C++ 8 , a commercial metrics collection tool.”
MethodDetecting Fuzzy Community Structures in Complex Networks with a Potts Model
Reichardt, J., & Bornholdt, S. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.218701 · Cited by 593
Social Media Mining: An Introduction
Zafarani, R., Abbasi, M. A., & Liu, H. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139088510 · Cited by 592
Clustering and community detection in directed networks: A survey
Malliaros, F. D., & Vazirgiannis, M. (2013) · Physics Reports · doi:10.1016/j.physrep.2013.08.002 · Cited by 591
“he deviation from the conguration model, the modularity can be expressed as Q dM = 1 m X i;j A ij E(M ijjkin;kout) (c i;c j): (18) Furthermore, using spectral techniques similar to the ones of Ref. [8] (or generally other modularity maximization algorithms), the modularity can be optimized obtaining a clustering assig…”
BackgroundMethodInfluentialDynamics and Control of Diseases in Networks with Community Structure
Salathé, M., & Jones, J. H. (2010) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000736 · Cited by 586
“Despite the demonstration that social networks show significant community structure [15,16,17,18], and that social processes such as homophily and transitivity result in highly clustered and modular networks [19], the effect of such microstructures on epidemic dynamics has only recently started to be investigated.”
BackgroundMapping the human brain's cortical-subcortical functional network organization
Ji, J. L., Spronk, M., Kulkarni, K., Repovš, G., Anticevic, A., & Cole, M. W. (2019) · NeuroImage · doi:10.1016/j.neuroimage.2018.10.006 · Cited by 585
Complex photonics: Dynamics and applications of delay-coupled semiconductors lasers
Soriano, M. C., García-Ojalvo, J., Mirasso, C. R., & Fischer, I. (2013) · Reviews of Modern Physics · doi:10.1103/revmodphys.85.421 · Cited by 582
“In many situations, complex networks can be decomposed into communities of nodes which are more closely related to each other, either structurally or functionally, than to the rest of the nodes in the network (Girvan and Newman, 2002).”
BackgroundA Comparative Analysis of Community Detection Algorithms on Artificial Networks
Yang, Z., Algesheimer, R., & Tessone, C. J. (2016) · Scientific Reports · doi:10.1038/srep30750 · Cited by 578
“Leading eigenvector This algorithm was proposed by Newman 39 .”
BackgroundMethodInfluentialCommunity Detection in Networks with Node Attributes
Yang, J., McAuley, J., & Leskovec, J. (2013) · 2013 IEEE 13th International Conference on Data Mining · doi:10.1109/icdm.2013.167 · Cited by 575
Attributed Graph Clustering: A Deep Attentional Embedding Approach
Wang, C., Pan, S., Hu, R., Long, G., Jiang, J., & Zhang, C. (2019) · Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2019/509 · Cited by 573
Brand communities embedded in social networks
Zaglia, M. E. (2013) · Journal of Business Research · doi:10.1016/j.jbusres.2012.07.015 · Cited by 564
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
Yu, H., Gibbons, P. B., Kaminsky, M., & Xiao, F. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.13 · Cited by 563
Subnets of scale-free networks are not scale-free: Sampling properties of networks
Stumpf, M. P. H., Wiuf, C., & May, R. M. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0501179102 · Cited by 561
Toward a Network Perspective of the Study of Resilience in Social-Ecological Systems
Janssen, M. A., Bodin, Ö., Anderies, J. M., Elmqvist, T., Ernstson, H., McAllister, R. R. J., Olsson, P., & Ryan, P. (2006) · Ecology and Society · doi:10.5751/es-01462-110115 · Cited by 561
“This highly diverse list of uses of the network approach illustrates its generality and makes it possible to compare structural differences between networks, even when the data are from different fields (e.g., Albert. et al. 2000, Girvan and Newman 2002, Dodds et al. 2003, Newman et al. 2004).”
BackgroundClique Percolation in Random Networks
Derényi, I., Palla, G., & Vicsek, T. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.160202 · Cited by 558
Neural representations of events arise from temporal community structure
Schapiro, A. C., Rogers, T. T., Cordova, N. I., Turk-Browne, N. B., & Botvinick, M. M. (2013) · Nature Neuroscience · doi:10.1038/nn.3331 · Cited by 556
Mixture models and exploratory analysis in networks
Newman, M. E. J., & Leicht, E. A. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0610537104 · Cited by 554
Self-citationGetting connected: analysis and principles of biological networks
Zhu, X., Gerstein, M., & Snyder, M. (2007) · Genes & Development · doi:10.1101/gad.1528707 · Cited by 554
Millan, M. J. (2006) · Pharmacology & Therapeutics · doi:10.1016/j.pharmthera.2005.11.006 · Cited by 551
Community Detection and Stochastic Block Models
Abbe, E. (2018) · now publishers, Inc. eBooks · doi:10.1561/9781680834772 · Cited by 544
Sengupta, S., Basak, S., & Peters, R. (2018) · Machine Learning and Knowledge Extraction · doi:10.3390/make1010010 · Cited by 543
Community-based greedy algorithm for mining top-K influential nodes in mobile social networks
Wang, Y., Cong, G., Song, G., & Xie, K. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835935 · Cited by 541
Graph models of habitat mosaics
Urban, D. L., Minor, E. S., Treml, E. A., & Schick, R. S. (2009) · Ecology Letters · doi:10.1111/j.1461-0248.2008.01271.x · Cited by 539
Communities in NetworksPreprint
Porter, M. A., Onnela, J.-P. “., & Mucha, P. J. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0902.3788 · Cited by 536
“g problem. An important step was taken in 2002, when Michelle Girvan and Mark Newman brought graphpartitioning problems to the broader attention of the statistical physics and mathematics communities [41]. Suddenly, community detection in networks became hip among physicists and applied mathematicians all over the wor…”
BackgroundMethodInfluentialSpectral clustering and the high-dimensional stochastic blockmodel
Rohe, K., Chatterjee, S., & Yu, B. (2011) · The Annals of Statistics · doi:10.1214/11-aos887 · Cited by 535
Identification of overlapping community structure in complex networks using fuzzy -means clustering
Zhang, S., Wang, R.-S., & Zhang, X.-S. (2007) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.07.023 · Cited by 530
Wang, X., Tsai, T., Deng, F., Wei, X., Chai, J., Knapp, J., Apple, J., Maxwell, C. V., Lee, J. A., Li, Y., et al. (2019) · Microbiome · doi:10.1186/s40168-019-0721-7 · Cited by 525
Link prediction techniques, applications, and performance: A survey
Kumar, A., Singh, S. S., Singh, K., & Biswas, B. (2020) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2020.124289 · Cited by 516
The Ubiquity of Small-World Networks
Telesford, Q. K., Joyce, K. E., Hayasaka, S., Burdette, J. H., & Laurienti, P. J. (2011) · Brain Connectivity · doi:10.1089/brain.2011.0038 · Cited by 515
“The karate(Zachary 1977), word adjacency(Newman 2006), football(Girvan and Newman 2002), dolphin(Lusseau et al.”
BackgroundMethodInfluentialSeidlitz, J., Váša, F., Shinn, M., Romero-Garcia, R., Whitaker, K. J., Vértes, P. E., Wagstyl, K., Kirkpatrick Reardon, P., Clasen, L., Liu, S., et al. (2018) · Neuron · doi:10.1016/j.neuron.2017.11.039 · Cited by 500
Community detection in networks: A multidisciplinary review
Javed, M. A., Younis, M. S., Latif, S., Qadir, J., & Baig, A. (2018) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2018.02.011 · Cited by 499
Limits of modularity maximization in community detection
Lancichinetti, A., & Fortunato, S. (2011) · Physical Review E · doi:10.1103/physreve.84.066122 · Cited by 495
Amaral, L. A. N., & Ottino, J. M. (2004) · The European Physical Journal B - Condensed Matter · doi:10.1140/epjb/e2004-00110-5 · Cited by 493
Properties of highly clustered networks
Newman, M. E. J. (2003) · Physical Review E · doi:10.1103/physreve.68.026121 · Cited by 493
Self-citationThe Structure of Complex Networks: Theory and Applications
Estrada, E. (2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199591756.001.0001 · Cited by 493
The community-search problem and how to plan a successful cocktail party
Sozio, M., & Gionis, A. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835923 · Cited by 490
“A typical approach for finding communities is by means of optimizing the modularity measure [16, 26].”
BackgroundMethodNavigability of complex networks
Boguñá, M., Krioukov, D., & Claffy, K. C. (2009) · Nature Physics · doi:10.1038/nphys1130 · Cited by 486
High‐Betweenness Proteins in the Yeast Protein Interaction Network
Joy, M. P., Brock, A., Ingber, D. E., & Huang, S. (2005) · BioMed Research International · doi:10.1155/jbb.2005.96 · Cited by 485
“Betweenness has also been used to characterize the “modularity” (eg, community structure) of various natural and man-made networks (see [12, 13]).”
MethodProtein Allostery and Conformational Dynamics
Guo, J., & Zhou, H.-X. (2016) · Chemical Reviews · doi:10.1021/acs.chemrev.5b00590 · Cited by 484
Chen, Z. J., He, Y., Rosa-Neto, P., Germann, J., & Evans, A. C. (2008) · Cerebral Cortex · doi:10.1093/cercor/bhn003 · Cited by 484
“One hundred and twenty-four right-handed subjects (male/female = 71/53, 24.38 ± 4.25 y) were drawn from the International Consortium for Brain Mapping database (Mazziotta et al. 2001).”
MethodInfluentialGA-Net: A Genetic Algorithm for Community Detection in Social Networks
Pizzuti, C. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-87700-4_107 · Cited by 481
“The American College Football network [8] comes from the United States college football.”
BackgroundMethodResultInfluential
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.