Uncovering the overlapping community structure of complex networks in nature and society
Open accessThe DOI matches its Crossref record; 33 of the 34 references it cites were found in a registry or an index.
Abstract
Many complex systems in nature and society can be described in terms of networks capturing the intricate web of connections among the units they are made of. A key question is how to interpret the global organization of such networks as the coexistence of their structural subunits (communities) associated with more highly interconnected parts. Identifying these a priori unknown building blocks (such as functionally related proteins, industrial sectors and groups of people) is crucial to the understanding of the structural and functional properties of networks. The existing deterministic methods used for large networks find separated communities, whereas most of the actual networks are made of highly overlapping cohesive groups of nodes. Here we introduce an approach to analysing the main statistical features of the interwoven sets of overlapping communities that makes a step towards uncovering the modular structure of complex systems. After defining a set of new characteristic quantities for the statistics of communities, we apply an efficient technique for exploring overlapping communities on a large scale. We find that overlaps are significant, and the distributions we introduce reveal universal features of networks. Our studies of collaboration, word-association and protein interaction graphs show that the web of communities has non-trivial correlations and specific scaling properties.
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 source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“complex network theory has demonstrated that many (non-quantum) systems exhibit similarities in their complex features 14 -18 , in the organization of their structure and dynamics 19 -24 , the controllability of their constituents 25 , and their resilience to structural and dynamical perturbations 26 -31 .”
From Complex networks from classical to quantum (2019) · cites this paper as [20]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“This notion of clustering is closely related to clique clustering algorithms in network clustering [53].”
From Topology and data (2009) · cites this paper as [53]
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 · cited 1×
“Many complex systems in nature and society can be described in terms of networks capturing the intricate web of connections among the units they are made of [1, 2, 3, 4].”
BackgroundEmergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135 · cited 2×
“´ny P. stny. 1A, H-1117 Budapest, Hungary. Many complex systems in nature and society can be described in terms of networks capturing the intricate web of connections among the units they are made of [1, 2, 3, 4]. A question of interest is how to interpret the global organisation of such networks as the coexistence of…”
BackgroundInfluentialStatistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471 · cited 2×
“Many complex systems in nature and society can be described in terms of networks capturing the intricate web of connections among the units they are made of [1, 2, 3, 4].”
BackgroundCommunity structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502 · cited 2×
“[16]: it tends to stay together mostly with the words of the community related to “light”, while most of its other communities ( e.g. , those related to “colors”, see Fig.”
BackgroundEveritt, B. J., Landau, S., & Leese, M. (1974) · Cited by 9,363
Social Network Analysis: A Handbook.
Pappi, F. U., & Scott, J. (1993) · Contemporary Sociology · doi:10.2307/2075047 · Cited by 5,969
Fast algorithm for detecting community structure in networks
Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.69.066133 · Cited by 5,406 · cited 3×
“[18], at some point “bright”, as a single word, joined a “community” of 890 other words.”
BackgroundFunctional organization of the yeast proteome by systematic analysis of protein complexes
Gavin, A.-C., Bösche, M., Krause, R., Grandi, P., Marzioch, M., Bauer, A., Schultz, J., Rick, J. M., Michon, A.-M., Cruciat, C.-M., et al. (2002) · Nature · doi:10.1038/415141a · Cited by 4,759 · cited 1×
“Another, biological example is that a large fraction of proteins belong to several protein complexes simultaneously [20].”
BackgroundHierarchical Organization of Modularity in Metabolic Networks
Ravasz, E., Somera, A. L., Mongru, D. A., Oltvai, Z. N., & Barabási, A.-L. (2002) · Science · doi:10.1126/science.1073374 · Cited by 4,224 · cited 2×
“In spite of this ambiguity the presence of communities in networks is a signature of the hierarchical nature of complex systems [5, 14].”
BackgroundDefining and identifying communities in networks
Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., & Parisi, D. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0400054101 · Cited by 2,450 · cited 2×
“[10, 15, 16, 17, 18]).”
Background
Research works printed but not linked: 1
- [21] Everett, M. G. & Borgatti, S. P. Analyzing clique overlap. Connections 21 , 49-61 (1998). -
Cited by
Items 301–400 of 1,010
Zhao, T., Holmer, R., de Bruijn, S., Angenent, G. C., van den Burg, H. A., & Schranz, M. E. (2017) · The Plant Cell · doi:10.1105/tpc.17.00312 · Cited by 153
“Here,weuseCFinder toclusterourpairwisesyntenydata, whichallows thedetection of overlapping communities in network data by using the k-clique percolation method (Palla et al., 2005, 2007).”
BackgroundMethodInfluentialClusterViz: A Cytoscape APP for Cluster Analysis of Biological Network
Wang, J., Zhong, J., Chen, G., Li, M., Wu, F.-X., & Pan, Y. (2015) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2014.2361348 · Cited by 151
“In order to reduce complexity and enable extendibility for ClusterViz, we designed the architecture of ClusterViz based on the framework of Open Services Gateway Initiative.”
MethodWireless Device-to-Device Communications and Networks
Song, L., Niyato, D. T., Han, Z., & Hossain, E. (2015) · Cambridge University Press eBooks · doi:10.1017/cbo9781107478732 · Cited by 169
Socially Aware Networking: A Survey
Xia, F., Liu, L., Li, J., Ma, J., & Vasilakos, A. V. (2013) · IEEE Systems Journal · doi:10.1109/jsyst.2013.2281262 · Cited by 160
Simpson, S. L., Bowman, F. D., & Laurienti, P. J. (2013) · Statistics Surveys · doi:10.1214/13-ss103 · Cited by 176
“Acknowledging the occurrence of this phenomenon in networks across a wide variety of areas, [99] developed a quickly adopted algorithm for detecting overlapping modular network struc-”
MethodDistribution of node characteristics in complex networks
Park, J., & Barabási, A.-L. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0705081104 · Cited by 151
Riche, N. H., & Dwyer, T. (2010) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2010.210 · Cited by 151
CDLIB: a python library to extract, compare and evaluate communities from complex networks
Rossetti, G., Milli, L., & Cazabet, R. (2019) · Applied Network Science · doi:10.1007/s41109-019-0165-9 · Cited by 176
“Kclique : this method finds k-clique communities in graph using the percolation method (Palla et al. 2005).”
MethodThe modular organization of human anatomical brain networks: Accounting for the cost of wiring
Betzel, R. F., Medaglia, J. D., Papadopoulos, L., Baum, G. L., Gur, R., Gur, R., Roalf, D., Satterthwaite, T. D., & Bassett, D. S. (2017) · Network Neuroscience · doi:10.1162/netn_a_00002 · Cited by 150
Complex networks from classical to quantum
Biamonte, J., Faccin, M., & De Domenico, M. (2019) · Communications Physics · doi:10.1038/s42005-019-0152-6 · Cited by 149
System of Mobile Agents to Model Social Networks
González, M. C., Lind, P. G., & Herrmann, H. J. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.088702 · Cited by 167
Distributed Real-Time Anomaly Detection in Networked Industrial Sensing Systems
Chen, P.-Y., Yang, S., & McCann, J. A. (2015) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2014.2350451 · Cited by 148
“To ensure that (2)–(5) has a feasible solution, G 0 c ( G 0 , L 0 , W 0 ) must have at least |S| /N min nonoverlapping cliques (i.e., complete sub-graph) of size N min [32].”
BackgroundABACUS: frequent pAttern mining-BAsed Community discovery in mUltidimensional networkS
Berlingerio, M., Pinelli, F., & Calabrese, F. (2013) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-013-0331-0 · Cited by 166
Data-driven static and dynamic resilience assessment of the global liner shipping network
Bai, X., Ma, Z., & Zhou, Y. (2023) · Transportation Research Part E Logistics and Transportation Review · doi:10.1016/j.tre.2023.103016 · Cited by 163
Global Analysis of Protein Damage by the Lipid Electrophile 4-Hydroxy-2-nonenal
Codreanu, S. G., Zhang, B., Sobecki, S. M., Billheimer, D. D., & Liebler, D. C. (2009) · Molecular & Cellular Proteomics · doi:10.1074/mcp.m800070-mcp200 · Cited by 146
“Protein communities in the subnetwork were identified using CFinder (48), and visualized using Cytoscape (49).”
MethodMultifunctional proteins revealed by overlapping clustering in protein interaction network
Becker, E., Robisson, B., Chapple, C. E., Guénoche, A., & Brun, C. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr621 · Cited by 159
“With respect to biological networks, although the overlapping nature of biological communities has been recognized (Ahn et al., 2010; Palla et al., 2005), only few methods leading to overlapping clusters have been proposed (Adamcsek et al., 2006; Ahn et al., 2010; Kovacs et al., 2010).”
BackgroundMatsuo, Y., Mori, J., Hamasaki, M., Ishida, K., Nishimura, T., Takeda, H., Hasida, K., & Ishizuka, M. (2006) · International World Wide Web Conference (WWW) · doi:10.1145/1135777.1135837 · Cited by 146
Semi-supervised clustering algorithm for community structure detection in complex networks
Ma, X., Gao, L., Yong, X., & Fu, L. (2009) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2009.09.018 · Cited by 150
Line graphs of weighted networks for overlapping communities
Evans, T., & Lambiotte, R. (2010) · The European Physical Journal B · doi:10.1140/epjb/e2010-00261-8 · Cited by 163
Mixing local and global information for community detection in large networks
Meo, P. D., Ferrara, E., Fiumara, G., & Provetti, A. (2013) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2013.03.012 · Cited by 153
“In addition, the identification of equally-sized clusters contradicts some well-known facts about real social networks: the size of communities greatly varies, ranging from few communities gathering a large number of individuals, to many communities containing only few participants [8,9,41].”
Spectral Coarse Graining of Complex Networks
Gfeller, D., & De Los Rios, P. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.038701 · Cited by 139
Graph Mining Applications to Social Network Analysis
Tang, L., & Liu, H. (2010) · The Kluwer international series on advances in database systems · doi:10.1007/978-1-4419-6045-0_16 · Cited by 180
“Practitioners typically use identified maximal cliques (or maximal complete bipartites) as cores or seeds for subsequent expansion for a community [47, 29].”
BackgroundDynamical Systems on Networks: A Tutorial
Porter, M. A., & Gleeson, J. P. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1403.7663 · Cited by 103
“, completely connected subgraphs of K nodes) has been used to study the algorithmic detection of dense sets of nodes known as “communities” [183].”
MethodLi, M., Wu, X., Wang, J., & Pan, Y. F. (2012) · BMC Bioinformatics · doi:10.1186/1471-2105-13-109 · Cited by 146
Detecting Highly Overlapping Communities with Model-Based Overlapping Seed Expansion
McDaid, A. F., & Hurley, N. (2010) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2010.77 · Cited by 153
“We have used implementations supplied by the authors, except for clique percolation where we used our own implementation as existing implementations, [5, 21], were slow on many of the evaluated datasets.”
BackgroundMethodTiles: an online algorithm for community discovery in dynamic social networks
Rossetti, G., Pappalardo, L., Pedreschi, D., & Giannotti, F. (2016) · Machine Learning · doi:10.1007/s10994-016-5582-8 · Cited by 163
“Demon (Coscia et al. 2012) is a bottom-up approach which exploits label-propagation to identify communities from ego-networks.4 cFinder (Palla et al. 2005) is an algorithm based on clique percolation that searches for clique-based network structures.5 iLCD (Cazabet et al. 2010) is an algorithm for…”
MethodToivonen, R., Kivelä, M., Saramäki, J., Viinikainen, M., Vanhatalo, M., & Sams, M. (2012) · PLoS ONE · doi:10.1371/journal.pone.0028883 · Cited by 140
“For detecting clusters at each threshold level, we employed a method called clique percolation (CP; [27]).”
BackgroundMethodAbnormal Synchronization in Complex Clustered Networks
Huang, L., Park, K., Lai, Y.-C., Yang, L., & Yang, K. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.164101 · Cited by 142
Pizzuti, C., & Rombo, S. E. (2014) · Bioinformatics · doi:10.1093/bioinformatics/btu034 · Cited by 151
Identifying functional modules in the physical interactome of Saccharomyces cerevisiae
Pu, S., Vlasblom, J., Emili, A., Greenblatt, J., & Wodak, S. J. (2007) · PROTEOMICS · doi:10.1002/pmic.200600636 · Cited by 142
A Tensor Approach to Learning Mixed Membership Community ModelsPreprint
Anandkumar, A., Ge, R., Hsu, D., & Kakade, S. M. (2013) · arXiv (Cornell University) · doi:10.5555/2627435.2670323 · Cited by 167
Variance in Centrality within Rock Hyrax Social Networks Predicts Adult Longevity
Barocas, A., Ilany, A., Koren, L., Kam, M., & Geffen, E. (2011) · PLoS ONE · doi:10.1371/journal.pone.0022375 · Cited by 151
Listing k-cliques in Sparse Real-World Graphs*
Danisch, M., Balalau, O., & Sozio, M. (2018) · International World Wide Web Conference (WWW) · doi:10.1145/3178876.3186125 · Cited by 139
Lehmann, S., Schwartz, M., & Hansen, L. K. (2008) · Physical Review E · doi:10.1103/physreve.78.016108 · Cited by 182
A Survey of Opportunistic Offloading
Xu, D., Li, Y., Chen, X., Li, J., Hui, P., Chen, S., & Crowcroft, J. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2808242 · Cited by 149
“Li et al. [51] propose NodeRank algorithm, similar to the famous PageRank [60], to select the subset of offloading nodes based on the temporal and spatial characteristics of human mobility.”
MethodOnline social networks: measurement, analysis, and applications to distributed information systems
Druschel, P., & Mislove, A. E. (2009) · Rice Research Repository (Rice University) · Cited by 183
Review of statistical network analysis: models, algorithms, and software
Salter‐Townshend, M., White, A., Gollini, I., & Murphy, T. B. (2012) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.11146 · Cited by 143
“More recently, methods for finding overlapping communities (or clusters) have been developed [37] including the CFinder algorithm [38] that uses k-cliques to construct overlapping communities.”
MethodCytoCluster: A Cytoscape Plugin for Cluster Analysis and Visualization of Biological Networks
Li, M., Li, D., Tang, Y. F., Wu, F., & Wang, J. (2017) · International Journal of Molecular Sciences · doi:10.3390/ijms18091880 · Cited by 150
“…subgraphs from biological networks, such as MCL (Markov CLuster) [8], MCODE (Molecular COmplex DEtection) [9], CPM (Clique Percolation Method) [10], LCMA (Local Clique Merging Algorithm) [11], Dpclus (Density-periphery based clustering) [12], IPCA (Identifying Protein Complex Algorithm) [13],…”
MethodJi, F., Wu, J., Chiclana, F., Wang, S., Fujita, H., & Herrera‐Viedma, E. (2023) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2023.3241062 · Cited by 136
“In particular, CPM [38] dividing communities based on complete subgraphs is less suitable for sparse networks, while SLPA [39] generates high randomness of label propagation, resulting low stability.”
InfluentialUncovering collective listening habits and music genres in bipartite networks
Lambiotte, R., & Ausloos, M. (2005) · Physical Review E · doi:10.1103/physreve.72.066107 · Cited by 136
To Shut Them Up or to Clarify: Restraining the Spread of Rumors in Online Social Networks
Wen, S., Jiang, J., Xiang, Y., Yu, S., Zhou, W., & Jia, W. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.2297115 · Cited by 140
An LDA-based Community Structure Discovery Approach for Large-Scale Social Networks
Zhang, H., Qiu, B., Giles, C. L., Foley, H. C., & Yen, J. (2007) · IEEE International Conference on Intelligence and Security Informatics (ISI) · doi:10.1109/isi.2007.379553 · Cited by 144
“Community structures exist in different types of networks including Web communities[2], [3], social networks[4], [5], [6], [7], [8], [9], [10], co-authorship networks[11], [12], [13], and biological networks[5], [8], [1].”
BackgroundTuning clustering in random networks with arbitrary degree distributions
Ángeles Serrano, M., & Boguñá, M. (2005) · Physical Review E · doi:10.1103/physreve.72.036133 · Cited by 138
Founders and disseminators of cluster research
Lazzeretti, L., Sedita, S. R., & Caloffi, A. (2013) · Journal of Economic Geography · doi:10.1093/jeg/lbs053 · Cited by 161
Network and Multilayer Network Approaches to Understanding Human Brain Dynamics
Muldoon, S. F., & Bassett, D. S. (2016) · Philosophy of Science · doi:10.1086/687857 · Cited by 142
“arity (Palla et al. 2005), which each quantify temporal changes in community structure.”
Luis, A. D., O'Shea, T. J., Hayman, D. T. S., Wood, J. L. N., Cunningham, A. A., Gilbert, A. T., Mills, J. N., & Webb, C. T. (2015) · Ecology Letters · doi:10.1111/ele.12491 · Cited by 129
“As an alternative to using modularity to assign nodes to communities, we also used clique percolation theory (Palla et al.”
MethodQuantifying and identifying the overlapping community structure in networks
Shen, H., Cheng, X., & Guo, J. (2009) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2009/07/p07042 · Cited by 140
Csermely, P. (2008) · Trends in Biochemical Sciences · doi:10.1016/j.tibs.2008.09.006 · Cited by 129
Garcia, J. O., Ashourvan, A., Muldoon, S. F., Vettel, J. M., & Bassett, D. S. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2017.2786710 · Cited by 147
Clustering of high throughput gene expression data
Pirim, H., Ekşioğlu, B., Perkins, A., & Yüceer, Ç. (2012) · Computers & Operations Research · doi:10.1016/j.cor.2012.03.008 · Cited by 143
“Cfinder (Adamcsek et al., 2006), which is an implementation of the clique percolation method (Palla et al., 2005), is used for community structure finding.”
MethodUncovering fuzzy community structure in complex networks
Zhang, S., Wang, R., & Zhang, X.-S. (2007) · Physical Review E · doi:10.1103/physreve.76.046103 · Cited by 138
Shi, Z., Derow, C. K., & Zhang, B. (2010) · BMC Systems Biology · doi:10.1186/1752-0509-4-74 · Cited by 137
Unified index to quantifying heterogeneity of complex networks
Hu, H., & Wang, X. (2008) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2008.01.113 · Cited by 134
Detecting overlapping communities of weighted networks via a local algorithm
Chen, D., Shang, M., Lv, Z., & Fu, Y. (2010) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2010.05.046 · Cited by 135
Dissemination in opportunistic social networks: the role of temporal communities
Pietilänen, A.-K., & Diot, C. (2012) · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · doi:10.1145/2248371.2248396 · Cited by 146
“[4], an alternative to modularity optimization called Louvain [1] and k-clique clustering [21].”
MethodA link clustering based overlapping community detection algorithm
Shi, C., Cai, Y., Fu, D., Dong, Y., & Wu, B. (2013) · Data & Knowledge Engineering · doi:10.1016/j.datak.2013.05.004 · Cited by 133
“For fuzzy community detection algorithms, the number of communities should be determined in advance [4], as CPM and SCP do.”
BackgroundMethodClustering Coefficients for Correlation Networks
Masuda, N., Sakaki, M., Ezaki, T., & Watanabe, T. (2018) · Frontiers in Neuroinformatics · doi:10.3389/fninf.2018.00007 · Cited by 137
“…of connected triangles around a given node, which is measured by local variants of the clustering coefficient, informs us of other structure and functions of networks, namely, community structure (Radicchi et al., 2004; Palla et al., 2005) and local efficiency (Latora and Marchiori, 2001).”
BackgroundControversies and progress on standardization of large-scale brain network nomenclature
Uddin, L. Q., Betzel, R. F., Cohen, J. R., Damoiseaux, J. S., Brigard, F. D., Eickhoff, S. B., Fornito, A., Gratton, C., Gordon, E. M., Laird, A. R., et al. (2023) · Network Neuroscience · doi:10.1162/netn_a_00323 · Cited by 132
“Whereas this assumption is a reasonable starting point, there is no inherent reason that biological networks should be organized in this precise manner (Palla et al., 2005).”
BackgroundFinding instabilities in the community structure of complex networks
Gfeller, D., Chappelier, J.-C., & De Los Rios, P. (2005) · Physical Review E · doi:10.1103/physreve.72.056135 · Cited by 126
Improved community structure detection using a modified fine-tuning strategy
Sun, Y., Danila, B., Josić, K., & Bassler, K. E. (2009) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/86/28004 · Cited by 126
Balanced Multi-Label Propagation for Overlapping Community Detection in Social Networks
Wu, Z., Lin, Y., Gregory, S., Wan, H., & Tian, S. (2012) · Journal of Computer Science and Technology · doi:10.1007/s11390-012-1236-x · Cited by 132
Structural and functional clusters of complex brain networks
Zemanová, L., Zhou, C., & Kurths, J. (2006) · Physica D Nonlinear Phenomena · doi:10.1016/j.physd.2006.09.008 · Cited by 137
“Significant recent interests in this direction are the detection of communities in realistic networks [24,40].”
BackgroundA Survey on Socially Aware Device-to-Device Communications
Ahmed, M., Li, Y., Waqas, M., Sheraz, M., Jin, D., & Han, Z. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2820069 · Cited by 134
“[55] identified the social-community considering realistic mobility traces of CUs.”
BackgroundDescription-oriented community detection using exhaustive subgroup discovery
Atzmueller, M., Doerfel, S., & Mitzlaff, F. (2015) · Information Sciences · doi:10.1016/j.ins.2015.05.008 · Cited by 134
“[53], detect k-cliques and then merge them into overlapping communities.”
BackgroundAssortative mixing in Protein Contact Networks and protein folding kinetics
Bagler, G., & Sinha, S. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm257 · Cited by 128
A Unified Framework for Community Detection and Network Representation Learning
Tu, C., Zeng, X., Wang, H., Zhang, Z., Liu, Z., Sun, M., Zhang, B., & Lin, L. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2852958 · Cited by 141
“[41], [42] and so on. The major drawback of these traditional methods is that they cannot detect overlapping communities, which may not accord with real-world scenarios. To address this problem, CPM [43] is proposed to generate overlapping communities by merging overlapping k-cliques. Ahn [44] proposes link clustering…”
BackgroundMethodPessoa, L. (2023) · Journal of Cognitive Neuroscience · doi:10.1162/jocn_a_01908 · Cited by 145
Adaptive pinning synchronization in fractional-order uncertain complex dynamical networks with delay
Song, L., Wu, R., & Chen, L. (2015) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2015.10.011 · Cited by 126
Zhang, L., Pan, H., Su, Y., Zhang, X., & Niu, Y. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2711038 · Cited by 128
“[15] extended the problem of nonoverlapping community detection to find overlapping communities.”
BackgroundDetecting Overlapping Communities in Networks Using Spectral Methods
Zhang, Y., Levina, E., & Zhu, J. (2020) · SIAM Journal on Mathematics of Data Science · doi:10.1137/19m1272238 · Cited by 152
Sun, P. G., Gao, L., & Han, S. S. (2010) · Information Sciences · doi:10.1016/j.ins.2010.11.022 · Cited by 133
SIS Epidemic Propagation on Hypergraphs
Bodó, Á., Katona, G. Y., & Šimon, P. (2016) · Bulletin of Mathematical Biology · doi:10.1007/s11538-016-0158-0 · Cited by 125
“unity forms a complete subgraph (i.e. there is en edge between any pair of members). Therefore to find these communities we listed all complete subgraphs of our graph using the software called CFinder [6], these are the edges of our hypergraph. In this way we obtain many small size hyperedges and few large ones [2]. It…”
MethodHow community structure influences epidemic spread in social networks
Wu, X., & Liu, Z. (2007) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2007.09.039 · Cited by 137
Articulation points in complex networks
Tian, L., Bashan, A., Shi, D., & Liu, Y. (2017) · Nature Communications · doi:10.1038/ncomms14223 · Cited by 137
Finding and characterizing communities in multidimensional networks
Berlingerio, M., Coscia, M., & Giannotti, F. (2011) · 2011 International Conference on Advances in Social Networks Analysis and Mining · doi:10.1109/asonam.2011.104 · Cited by 122
“Another class of approaches rely on the propagation in the network of a label [17] or a particular definition of structure (usually a clique [ 14 ]).”
BackgroundRole models for complex networks
Reichardt, J., & White, D. R. (2007) · The European Physical Journal B · doi:10.1140/epjb/e2007-00340-y · Cited by 116
Detecting local community structures in complex networks based on local degree central nodes
Chen, Q., Wu, T., & Fang, M. (2012) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2012.09.012 · Cited by 133
Global efficiency of local immunization on complex networks
Hébert-Dufresne, L., Allard, A., Young, J.-G., & Dubé, L. J. (2013) · Scientific Reports · doi:10.1038/srep02171 · Cited by 134
“At this level of organization, the focus is on the redundancy of connections forming dense clusters referred to as the modularity or community structure of the network [21, 22].”
BackgroundMethodShi, X., Adamic, L. A., & Strauss, M. J. (2006) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.11.072 · Cited by 140
“Recently, it has also been shown that many real world networks, including social networks, contain overlapping k-cliques [20].”
BackgroundStatistical significance of communities in networks
Lancichinetti, A., Radicchi, F., & Ramasco, J. J. (2010) · Physical Review E · doi:10.1103/physreve.81.046110 · Cited by 120
$K$ -Clique Community Detection in Social Networks Based on Formal Concept Analysis
Hao, F., Min, G., Pei, Z., Park, D.-S., & Yang, L. T. (2015) · IEEE Systems Journal · doi:10.1109/jsyst.2015.2433294 · Cited by 122
“Definition 3 (k-Clique Community): A k-clique community [12] is defined as the union of all k-cliques (i.”
BackgroundOpportunistic routing based on daily routines
Moreira, W., Mendes, P., & Sargento, S. (2012) · IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM) · doi:10.1109/wowmom.2012.6263749 · Cited by 121
Towards Online Multiresolution Community Detection in Large-Scale Networks
Huang, J., Sun, H., Liu, Y., Song, Q., & Weninger, T. (2011) · PLoS ONE · doi:10.1371/journal.pone.0023829 · Cited by 126
“These communities usually indicate a meaningful topological relationship between entities within the network [5,8].”
BackgroundCollaborative networks: a systematic review and multi-level framework
DURUGBO, C. M. (2015) · International Journal of Production Research · doi:10.1080/00207543.2015.1122249 · Cited by 120
“Communities (also known in the sciences as a clusters, cohesive groups or modules (Palla et al. 2005)), allow for shared values, high levels of solidarity, and importantly, the development of social capital.”
Discovering functions and revealing mechanisms at molecular level from biological networks
Zhang, S., Jin, G., Zhang, X., & Chen, L. (2007) · PROTEOMICS · doi:10.1002/pmic.200700095 · Cited by 126
Parallel community detection on large networks with propinquity dynamics
Zhang, Y., Wang, J., Wang, Y., & Zhou, L. (2009) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1557019.1557127 · Cited by 126
“Through several rounds of mutual reinforcement between topology and propinquity, the community structures are expected to naturally emerge.”
BackgroundSocial Network Analysis, Overview of
Scott, J. P. (2011) · Springer eBooks · doi:10.1007/978-1-4614-1800-9_178 · Cited by 119
Core Percolation on Complex Networks
Liu, Y., Csóka, E., Zhou, H., & Pósfai, M. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.205703 · Cited by 125
Algorithmic Aspects of Triangle-Based Network Analysis
Schank, T. (2007) · Repository KITopen (Karlsruhe Institute of Technology) · doi:10.5445/ir/1000007159 · Cited by 119
“The connected components in G are the basis of the analytical consideration in [Palla et al., 2005].”
BackgroundMethodInfluentialFully Automatic Visualisation of Overlapping Sets
Simonetto, P., Auber, D., & Archambault, D. (2009) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2009.01452.x · Cited by 118
Najafi, M., McMenamin, B. W., Simon, J. Z., & Pessoa, L. (2016) · NeuroImage · doi:10.1016/j.neuroimage.2016.04.054 · Cited by 113
Element-centric clustering comparison unifies overlaps and hierarchy
Gates, A. J., Wood, I. B., Hetrick, W. P., & Ahn, Y. (2019) · Scientific Reports · doi:10.1038/s41598-019-44892-y · Cited by 138
Protein Complex–Based Analysis Framework for High-Throughput Data Sets
Vinayagam, A., Hu, Y., Kulkarni, M., Roesel, C., Sopko, R., Mohr, S. E., & Perrimon, N. (2013) · Science Signaling · doi:10.1126/scisignal.2003629 · Cited by 112
“Next, we applied two different complex prediction tools, CFinder ( 18 ) and NetworkBLAST ( 19 ), that identify biologically meaningful protein complexes from PPI networks ( 20 ).”
MethodCentrality in Complex Networks with Overlapping Community Structure
Ghalmane, Z., Cherifi, C., Cherifi, H., & Hassouni, M. E. (2019) · Scientific Reports · doi:10.1038/s41598-019-46507-y · Cited by 117
Quantifying flexibility in thought: The resiliency of semantic networks differs across the lifespan
Cosgrove, A. L., Kenett, Y. N., Beaty, R. E., & Diaz, M. T. (2021) · Cognition · doi:10.1016/j.cognition.2021.104631 · Cited by 128
“works of the younger and older participants across all datasets (as described in Farkas et al., 2007; Palla et al., 2005).”
BackgroundDistributed socialite: a datalog-based language for large-scale graph analysis
Seo, J., Park, J., Shin, J., & Lam, M. S. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2556549.2556572 · Cited by 137
“For our evaluation, we use six core graph analyses that have been shown to be useful for a wide range of problems such as community detection, link prediction, and other general graph metrics [14, 22, 31].”
MethodSzalay-Bekő, M., Palotai, R., Szappanos, B., Kovács, I. A., Papp, B., & Csermely, P. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts352 · Cited by 125
LGIEM: Global and local node influence based community detection
Ma, T., Liu, Q., Cao, J., Tian, Y., Al-Dhelaan, A. M., & Al‐Rodhaan, M. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2019.12.022 · Cited by 117
Community-based anomaly detection in evolutionary networks
Chen, Z., Hendrix, W., & Samatova, N. F. (2011) · Journal of Intelligent Information Systems · doi:10.1007/s10844-011-0183-2 · Cited by 128
“For example, is there a community at snapshot t that splits into smaller communities or merges with others at snapshot t + t? Does any community at snapshot t disappear at snapshot t + t, or does any new community appear at snapshot t + t? Do the sizes of the communities change over time? – Most real networks are dyna…”
BackgroundInfluentialSocial significance of community structure: Statistical view
Li, H., & Daniels, J. J. (2015) · Physical Review E · doi:10.1103/physreve.91.012801 · Cited by 117
Metadata
- Authors
- Palla, G., Derényi, I., Farkas, I., & Vicsek, T.
- Affiliations
- Hungarian Academy of Sciences (HU)
- Eötvös Loránd University (HU)
- Corresponding author
- Vicsek, Tamás
- Venue
- Nature
- Published
- 2005-06
- Volume
- 435
- Issue
- 7043
- Pages
- 814-818
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W2164928285
- Cited by
- 5,373
- References
- 32
- Citations by year
- 2026: 94 · 2025: 165 · 2024: 156 · 2023: 169 · 2022: 222 · 2021: 254 · 2020: 263 · 2019: 322 · 2018: 394 · 2017: 327 · 2016: 323 · 2015: 392 · 2014: 442 · 2013: 351 · 2012: 356
- FWCI
- 86.26
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Nature (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- arXiv (Cornell University)
- 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
- Social Sciences › Economics, Econometrics and Finance › Economics and Econometrics › Complex Systems and Time Series Analysis
- Keywords
- overlapping communities, community structure, complex networks, modular structure, community statistics, collaboration networks, word association networks, protein-protein interaction network, scaling behavior, network correlation
- MeSH terms
- Humans, Models, Biological, Protein Binding, Saccharomyces cerevisiae, Community Networks, Nature, Internet
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.