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 601–700 of 1,010
Multi-scale Modularity in Complex Networks
Lambiotte, R. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1004.4268 · Cited by 50
“Each node is assigned to one and only one community, i.e., partitions are not compatible with overlapping communities [ 8 ], [9].”
BackgroundMapping the multiscale structure of biological systems
Schaffer, L. V., & Ideker, T. (2021) · Cell Systems · doi:10.1016/j.cels.2021.05.012 · Cited by 75
Community detection algorithm evaluation with ground-truth data
Jebabli, M., Cherifi, H., Cherifi, C., & Hamouda, A. (2017) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2017.10.018 · Cited by 75
Han, X., Li, C., Sun, S., Ji, J., Nie, B., Maker, G. L., Ren, Y., & Wang, L. (2022) · The Plant Journal · doi:10.1111/tpj.16007 · Cited by 78
Community discovery by propagating local and global information based on the MapReduce model
Guo, K., Guo, W., Chen, Y., Qiu, Q., & Qishan, Z. (2015) · Information Sciences · doi:10.1016/j.ins.2015.06.032 · Cited by 76
“The clique percolation method (CPM) algorithm discovers communities as a series of neighboring k-cliques and detects overlapping communities [37].”
MethodCoexistence of opposite opinions in a network with communities
Lambiotte, R., & Ausloos, M. (2007) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2007/08/p08026 · Cited by 87
Graphlet-based edge clustering reveals pathogen-interacting proteins
Solava, R. W., Michaels, R. P., & Milenković, T. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts376 · Cited by 88
“A graphlet is an induced subgraph of graph X that contains all edges of X connecting its nodes (Fig.”
BackgroundQualitative Comparison of Community Detection Algorithms
Orman, G. K. (2015) · Cited by 75
MultiComm: Finding Community Structure in Multi-Dimensional Networks
Li, X., Ng, M. K., & Ye, Y. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.48 · Cited by 74
“RECENTLY, there are growing interests in studying and analyzing large networks, such as social networks, genetic networks and co-citation networks [1], [2], [3], [4], [5].”
BackgroundFarkas, I. J., Korcsmáros, T., Kovács, I. A., Mihalik, Á., Palotai, R., Simkó, G. I., Szalay, K. Z., Szalay-Bekő, M., Vellai, T., Wang, S., et al. (2011) · Science Signaling · doi:10.1126/scisignal.2001950 · Cited by 83
“overlaps (34, 35), which represent well the”
BackgroundSelf-citationClearing the FOG: Fuzzy, overlapping groups for social networks
Davis, G. B., & Carley, K. M. (2008) · Social Networks · doi:10.1016/j.socnet.2008.03.001 · Cited by 76
“Palla et al. (2005) give an iterative definition, related to k -cliques, designed specifically to examine overlapping communities.”
BackgroundPersonalized recommendations based on time-weighted overlapping community detection
Feng, H., Tian, J., Wang, H. J., & Li, M. (2015) · Information & Management · doi:10.1016/j.im.2015.02.004 · Cited by 74
“presented the first overlapping community detection algorithm, the Clique Percolation Method (CPM), which performed well in recognizing overlapping frameworks in complex networks [40].”
MethodDetecting and refining overlapping regions in complex networks with three-way decisions
Yu, H. Z., Jiao, P., Yao, Y. Y., & Wang, G. (2016) · Information Sciences · doi:10.1016/j.ins.2016.08.087 · Cited by 74
Network and graph analyses of folding free energy surfaces
Caflisch, A. (2006) · Current Opinion in Structural Biology · doi:10.1016/j.sbi.2006.01.002 · Cited by 74
Node Importance based Label Propagation Algorithm for overlapping community detection in networks
Kouni, I. B. E., Karoui, W., & Romdhane, L. B. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.113020 · Cited by 84
Incremental K-clique clustering in dynamic social networks
Duan, D., Li, Y., Li, R., & Lu, Z. (2011) · Artificial Intelligence Review · doi:10.1007/s10462-011-9250-x · Cited by 73
Finding local communities in protein networks
Voevodski, K., Teng, S., & Xia, Y. (2009) · BMC Bioinformatics · doi:10.1186/1471-2105-10-297 · Cited by 87
Assessing the consistency of community structure in complex networks
Steen, M. R., Hayasaka, S., Joyce, K. E., & Laurienti, P. J. (2011) · Physical Review E · doi:10.1103/physreve.84.016111 · Cited by 73
An automated approach to network features of protein structure ensembles
Bhattacharyya, M., Bhat, C. R., & Vishveshwara, S. (2013) · Protein Science · doi:10.1002/pro.2333 · Cited by 71
“51 The cliques indicate regions of rigidity in protein structures in terms of higher order connectivity.”
BackgroundLocal community detection by the nearest nodes with greater centrality
Luo, W., Lu, N., Li, N., Zhu, W., & Ding, W. (2020) · Information Sciences · doi:10.1016/j.ins.2020.01.001 · Cited by 75
Identification of functional modules in a PPI network by clique percolation clustering
Zhang, S., Ning, X.-M., & Zhang, X.-S. (2006) · Computational Biology and Chemistry · doi:10.1016/j.compbiolchem.2006.10.001 · Cited by 73
Distributed impulsive synchronization of Lur'e dynamical networks via parameter variation methods
Tang, Z., Park, J. H., & Zheng, W. X. (2017) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.3916 · Cited by 72
Communities in Evolving Networks: Definitions, Detection, and Analysis Techniques
Aynaud, T., Fleury, É., Guillaume, J., & Qinna Wang, A. (2013) · Modeling and simulation in science, engineering & technology · doi:10.1007/978-1-4614-6729-8_9 · Cited by 87
Communities and bottlenecks: Trees and treelike networks have high modularity
Bagrow, J. P. (2012) · Physical Review E · doi:10.1103/physreve.85.066118 · Cited by 79
The Overlapping Community Structure of Structural Brain Network in Young Healthy Individuals
Wu, K., Taki, Y., Sato, K., Sassa, Y., Inoue, K., Goto, R., Okada, K., Kawashima, R., He, Y., Evans, A. C., et al. (2011) · PLoS ONE · doi:10.1371/journal.pone.0019608 · Cited by 71
“The definition of overlapping community structure relies on the basic observation of a typical community consisting of several complete (fully connected) subgraphs that tend to share many of their nodes [6].”
BackgroundInfluentialML-SOR: Message routing using multi-layer social networks in opportunistic communications
Socievole, A., Yoneki, E., Rango, F. D., & Crowcroft, J. (2015) · Computer Networks · doi:10.1016/j.comnet.2015.02.016 · Cited by 72
“k-CLIQUE or Clique Percolation Method (CPM) [48] is another approach finding overlapping communities where a community is defined as the union of all k-cliques (complete subgraphs with k nodes) that can reach each other through a series of adjacent k-cliques, where two k-cliques are said to be adjacent if they”
MethodInfluentialComplex Network Clustering Algorithms
Yang, B., Liu, D., Liu, J., Jin, D., & Ma, H.-B. (2009) · Journal of Software · doi:10.3724/sp.j.1001.2009.00054 · Cited by 72
“例如,在语 义网中,多义词允许同时出现在多个表示不同词义的网络簇中.2005 年,Palla 及其同事在《Nature》上发表文章, 提出了能够识别重叠网络簇结构的 CPM 算法[7].”
BackgroundInfluentialSparsity measure of a network graph: Gini index
Goswami, S., Murthy, C. A., & Das, A. K. (2018) · Information Sciences · doi:10.1016/j.ins.2018.05.044 · Cited by 72
Phase synchronization on scale-free networks with community structure
Zhou, T., Zhao, M., Chen, G., Yan, G. F., & Wang, B.-H. (2007) · Physics Letters A · doi:10.1016/j.physleta.2007.04.083 · Cited by 72
Négyessy, L., Nepusz, T., Kocsis, L., & Bazsó, F. (2006) · European Journal of Neuroscience · doi:10.1111/j.1460-9568.2006.04678.x · Cited by 72
“A similar feature has been shown in different complex networks (Palla et al., 2005).”
BackgroundSignature Genes as a Phylogenomic Tool
Dutilh, B. E., Snel, B., Ettema, T. J. G., & Huynen, M. A. (2008) · Molecular Biology and Evolution · doi:10.1093/molbev/msn115 · Cited by 71
“We then merged the mergeable OGs using CFinder (Palla et al. 2005) at the level of communities.”
BackgroundMethodPreferential attachment of communities: the same principle, but a higher levelPreprint
Pollner, P., Palla, G., & Vicsek, T. (2006) · Cited by 72
Self-citationTeng, X., Liu, J., & Li, M. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2931983 · Cited by 75
“The time complexity of CFinder is polynomial in many applications [18].”
BackgroundMethodInfluentialFast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
Pattabiraman, B., Patwary, M. M. A., Gebremedhin, A. H., Liao, W., & Choudhary, A. (2013) · Lecture notes in computer science · doi:10.1007/978-3-319-03536-9_13 · Cited by 71
“Optimization Methods and Software Vol. 00, No. 00, November 2012, 1–14”
BackgroundCommunicability graph and community structures in complex networks
Estrada, E., & Hatano, N. (2009) · Applied Mathematics and Computation · doi:10.1016/j.amc.2009.04.024 · Cited by 71
“’s method [20], our method finds the cliques in this communicability graph, not the cliques existing in the original network.”
BackgroundMethodInfluentialEfficient algorithms for influence maximization in social networks
Chen, Y.-C., Peng, W.-C., & Lee, S.-Y. (2012) · Knowledge and Information Systems · doi:10.1007/s10115-012-0540-7 · Cited by 71
“The time complexity of most community detection algorithms [3,5,9,11,13,15,18,19,21,24, 27,28] is between O(N log N ) and O(N 3).”
BackgroundDetecting cohesive and 2-mode communities indirected and undirected networks
Yang, J., McAuley, J., & Leskovec, J. (2014) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2556195.2556243 · Cited by 84
“For comparison we consider the following baseline methods: MMSB (Mixed Membership Stochastic Blockmodels) [3], which can detect both cohesive and 2-mode communities in undirected networks and is extremely slow; Clique Percolation, [34] Link Clustering [2], BigCLAM [43, 45] are state of the art overlapping cohesive com…”
BackgroundMethodInfluentialEnhanced modularity-based community detection by random walk network preprocessing
Lai, D., Lu, H., & Nardini, C. (2010) · Physical Review E · doi:10.1103/physreve.81.066118 · Cited by 77
Local Community Detection With the Dynamic Membership Function
Luo, W., Zhang, D., Jiang, H., Li, N., & Hu, Y. (2018) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2018.2812148 · Cited by 71
Community Detection in Complex Networks via Clique Conductance
Lu, Z., Wahlström, J., & Nehorai, A. (2018) · Scientific Reports · doi:10.1038/s41598-018-23932-z · Cited by 84
“One line of related work is the method of k -clique percolation 36,37 .”
MethodRecombinant distance, network governance and recombinant innovation
Zhang, J., Yan, Y., & Guan, J. (2019) · Technological Forecasting and Social Change · doi:10.1016/j.techfore.2019.01.022 · Cited by 73
Neural embeddings of scholarly periodicals reveal complex disciplinary organizations
Peng, H., Ke, Q., Budak, C., Romero, D. M., & Ahn, Y.-Y. (2021) · Science Advances · doi:10.1126/sciadv.abb9004 · Cited by 61
Qualitative Comparison of Community Detection Algorithms
Orman, G. K., Labatut, V., & Cherifi, H. (2011) · Communications in computer and information science · doi:10.1007/978-3-642-22027-2_23 · Cited by 87
Community detection using local neighborhood in complex networks
Eustace, J., Wang, X., & Cui, Y. (2015) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2015.05.044 · Cited by 72
Hypercube-Based Multipath Social Feature Routing in Human Contact Networks
Wu, J., & Wang, Y. (2012) · IEEE Transactions on Computers · doi:10.1109/tc.2012.209 · Cited by 72
“The existing destination community structures, including k-clique [27] and the Girvan-Newman algorithm [29], which form communities based on the high edge betweenness of intercommunity links, all depend on a prior knowledge of the global contact information among nodes.”
BackgroundMethodTail dependence structure of the foreign exchange market: A network view
Wang, G., & Xie, C. (2015) · Expert Systems with Applications · doi:10.1016/j.eswa.2015.10.037 · Cited by 71
“In previous works, scholars develop many useful methods to detect the community structure in the complex networks (see, e.g., Palla et al. (2005); Blondel et al. (2008); Fortunato (2010)).”
MethodExtraction and Analysis of Facebook Friendship Relations
Catanese, S., Meo, P. D., Ferrara, E., Fiumara, G., & Provetti, A. (2012) · Springer eBooks · doi:10.1007/978-1-4471-4054-2_12 · Cited by 78
“[75] describes CFinder, which, to the best of our knowledge, is the first attempt to find overlapping communities, i.”
BackgroundExperimental and computational determination of tRNA dynamics
Alexander, R. W., Eargle, J., & Luthey-Schulten, Z. A. (2009) · FEBS Letters · doi:10.1016/j.febslet.2009.11.061 · Cited by 77
“The network community structure, which is a partition of the residues into communities that are more connected to each other than to outside residues, can also be determined using available graph algorithms [108,110,111].”
BackgroundThe maximum clique enumeration problem: algorithms, applications, and implementations
Eblen, J. D., Phillips, C., Rogers, G. L., & Langston, M. A. (2012) · BMC Bioinformatics · doi:10.1186/1471-2105-13-s10-s5 · Cited by 83
Allosteric Communication in Cysteinyl tRNA Synthetase
Ghosh, A., Sakaguchi, R., Liu, C., Vishveshwara, S., & Hou, Y. (2011) · Journal of Biological Chemistry · doi:10.1074/jbc.m111.246702 · Cited by 70
The structural role of weak and strong links in a financial market network
Garas, A., Argyrakis, P., & Havlin, S. (2008) · The European Physical Journal B · doi:10.1140/epjb/e2008-00237-3 · Cited by 77
A Fast Agglomerate Algorithm for Mining Functional Modules in Protein Interaction Networks
Li, M., Wang, J., & Chen, J. (2008) · International Conference on Biomedical Engineering and Informatics (BMEI) · doi:10.1109/bmei.2008.121 · Cited by 70
“Palla and colleagues proposed a clique percolation method (CPM)[9].”
MethodModular structure of brain functional networks: breaking the resolution limit by Surprise
Nicolini, C., & Bifone, A. (2016) · Scientific Reports · doi:10.1038/srep19250 · Cited by 82
A Fast Overlapping Community Detection Algorithm Based on Weak Cliques for Large-Scale Networks
Zhang, X., Wang, C., Su, Y., Pan, L., & Zhang, H. (2017) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2017.2749282 · Cited by 70
“12 and 13 plot the communities associated with Newman and Stauffer detected by the W-CPM in co-authorship_large network [23], where Newman and Stauffer are two famous scientists in complex networks and physics.”
BackgroundMethodOral microbiome and obesity in a large study of low-income and African-American populations
Yang, Y., Cai, Q., Zheng, W., Steinwandel, M. D., Blot, W. J., Shu, X., & Long, J. (2019) · Journal of Oral Microbiology · doi:10.1080/20002297.2019.1650597 · Cited by 79
“001, were used for community structure detection, using the greedy optimization of a modularity algorithm [31], implemented in the R package ‘igraph’.”
MethodFinding Strongly Knit Clusters in Social Networks
Mishra, N., Schreiber, R., Stanton, I., & Tarjan, R. E. (2008) · Internet Mathematics · doi:10.1080/15427951.2008.10129299 · Cited by 69
“Finally, there has been previous work finding overlapping clusters: [Gregory 07, Palla et al. 05, Zhang et al. 07] have all developed distinct methods for uncovering overlapping community structures.”
BackgroundResultMulti-Dimensional Dynamics of Human Electromagnetic Brain Activity
Kida, T., Tanaka, E., & Kakigi, R. (2016) · Frontiers in Human Neuroscience · doi:10.3389/fnhum.2015.00713 · Cited by 76
Multilink communities of multiplex networks
Mondragón, R. J., Iacovacci, J., & Bianconi, G. (2018) · PLoS ONE · doi:10.1371/journal.pone.0193821 · Cited by 74
Manlove, K. R., Wilber, M., White, L. A., Bastille‐Rousseau, G., Yang, A., Gilbertson, M. L. J., Craft, M. E., Cross, P. C., Wittemyer, G., & Pepin, K. M. (2022) · Ecology Letters · doi:10.1111/ele.14032 · Cited by 73
Living on the edge: network neuroscience beyond nodes
Betzel, R. F., Faskowitz, J., & Sporns, O. (2023) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2023.08.009 · Cited by 78
“Although overlapping communities are detectable using other methods [30,31,33], those methods tend to generate partitions that, although they allow for overlap, nonetheless leave most nodes with clear affiliations to a single community [102–104].”
Wang, G., & Xie, C. (2015) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2015.01.025 · Cited by 69
“[49], we acquire the full lists of 3-cliques and 4-cliques of the PMFG network, and present them in Tables 4 and 5 respectively.”
MethodScoping the field of disaster exercise evaluation - A literature overview and analysis
Beerens, R. J. J., & Tehler, H. (2016) · International Journal of Disaster Risk Reduction · doi:10.1016/j.ijdrr.2016.09.001 · Cited by 83
Barabási, A.-Ĺ. (2005) · Nature Physics · doi:10.1038/nphys162 · Cited by 95
Give2Get: Forwarding in Social Mobile Wireless Networks of Selfish Individuals
Mei, A., & Stefa, J. (2012) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2012.37 · Cited by 68
“Node S starts the relay phase by asking node B if it has already handled a message with hash H(m) (see Figure 1, where the role of S is described as done by node A step 1).”
BackgroundBu, Z., Cao, J., Li, H., Gao, G., & Tao, H. (2017) · Knowledge and Information Systems · doi:10.1007/s10115-017-1105-6 · Cited by 72
“One of themost prominent approaches is based on the idea of clique percolation theory (e.g., CFinder [34]), several extension onCFinder have appeared including CPMw [13] and SCP [23].”
MethodTang, M., Liao, H., & Fujita, H. (2021) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2021.3070902 · Cited by 71
“Since overlapping community detection has become an important research topic in social network analysis (SNA) [13], [14], it is necessary to investigate LSGDM problems with overlapping clusters/communities (interdependent subgroups).”
BackgroundThe Nature of Complex Networks
Dorogovtsev, S. N., & Mendes, J. F. F. (2022) · doi:10.1093/oso/9780199695119.001.0001 · Cited by 85
DEFINING DIMENSION OF A COMPLEX NETWORK
Shanker, O. (2007) · Modern Physics Letters B · doi:10.1142/s0217984907012773 · Cited by 68
Information propagation on modular networks
Huang, L., Park, K., & Lai, Y. (2006) · Physical Review E · doi:10.1103/physreve.73.035103 · Cited by 68
Fast Community Detection Algorithm with GPUs and Multicore Architectures
Soman, J., & Narang, A. (2011) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2011.61 · Cited by 79
Box-covering algorithm for fractal dimension of complex networks
Schneider, C., Kesselring, T., Andrade, J. S., & Herrmann, H. J. (2012) · Physical Review E · doi:10.1103/physreve.86.016707 · Cited by 70
Adaptive pinning synchronization in fractional-order complex dynamical networks
Chai, Y., Chen, L., Wu, R., & Sun, J. (2012) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2012.06.050 · Cited by 67
Efficient Enumeration of Maximal k-Plexes
Berlowitz, D., Cohen, S., & Kimelfeld, B. (2015) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2723372.2746478 · Cited by 67
“Maximal cliques have long-been considered a key component in the analysis of social networks [35] and, among other application areas, have been used to detect communities [29,37].”
MethodModeling and analyzing of an enterprise relationship network in the context of social manufacturing
Ding, K., Jiang, P., Leng, J., & Cao, W. (2015) · Proceedings of the Institution of Mechanical Engineers Part B Journal of Engineering Manufacture · doi:10.1177/0954405414558730 · Cited by 67
Improving protein function prediction using domain and protein complexes in PPI networks
Peng, W., Wang, J., Cai, J., Chen, L., Li, M., & Wu, F. (2014) · BMC Systems Biology · doi:10.1186/1752-0509-8-35 · Cited by 67
“Moreover, we have also used predicted protein complexes generated by various clustering algorithms including the widely used IPCA [27], MCODE [28], CPM [29], DPClus [30] and HC-PIN [39] for the usage in DSCP.”
BackgroundMethodTopology, tinkering and evolution of the human transcription factor network
Rodriguez‐Caso, C., Medina, M. A., & Solé, R. V. (2005) · The FEBS Journal · doi:10.1111/j.1742-4658.2005.05041.x · Cited by 66
“Other algorithms [ 65 ,66] have been tested providing similar results.”
ResultSurvey on Big Data System and Analytic Technology
Cheng, X., Jin, X., Wang, Y., Guo, J., Zhang, T., & Li, G. (2014) · Cited by 85
Fast Adaptively Weighted Matrix Factorization for Recommendation with Implicit Feedback
Chen, J., Wang, C., Zhou, S., Shi, Q., Chen, J., Feng, Y., & Chen, C. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i04.5751 · Cited by 74
A New Metric for Quality of Network Community StructurePreprint
Chen, M., Nguyen, T., & Szymanski, B. K. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1507.04308 · Cited by 76
“Numerous techniques have been developed for both efficient and effective community detection, including Modularity Optimization [7,8,11–15], Clique Percolation [16, 17], Local Expansion [18–20], Fuzzy Clustering [21, 22], Link Partitioning [23], and Label Propagation [24–26].”
MethodHyper-Brain Networks Support Romantic Kissing in Humans
Müller, V., & Lindenberger, U. (2014) · PLoS ONE · doi:10.1371/journal.pone.0112080 · Cited by 62
Motif clustering and overlapping clustering for social network analysis
Pan, L., Dau, S. H., Puleo, G. J., & Milenković, O. (2017) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2017.8056956 · Cited by 66
“This clustering differs from the original structure outlined in [28] in so far that two clusters were joined into one (colored pink, involving vertices labeled starting with 7).”
BackgroundMethodResultInfluentialLocal community detection algorithm based on local modularity density
Guo, K., Huang, X., Wu, L., & Chen, Y. (2021) · Applied Intelligence · doi:10.1007/s10489-020-02052-0 · Cited by 70
On the equivalence of the label propagation method of community detection and a Potts model approach
Tibély, G., & Kertész, J. (2008) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2008.04.024 · Cited by 70
Network‐assisted protein identification and data interpretation in shotgun proteomics
Li, J., Zimmerman, L. J., Park, B., Tabb, D. L., Liebler, D. C., & Zhang, B. (2009) · Molecular Systems Biology · doi:10.1038/msb.2009.54 · Cited by 71
“From a list of maximal cliques, CFinderidentifiesthetightlyconnectedsub-networksbycarryingouta standardcomponentanalysisoftheclique–cliqueoverlapmatrix(Palla et al , 2005).”
BackgroundEstimation of Graphlet Counts in Massive Networks
Rossi, R. A., Zhou, R., & Ahmed, N. K. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2018.2826529 · Cited by 76
Correlations between Community Structure and Link Formation in Complex Networks
Liu, Z., He, J.-L., Kapoor, K., & Srivastava, J. (2013) · PLoS ONE · doi:10.1371/journal.pone.0072908 · Cited by 75
Trophic groups and modules: two levels of group detection in food webs
Gauzens, B., Thébault, É., Lacroix, G., & Legendre, S. (2015) · Journal of The Royal Society Interface · doi:10.1098/rsif.2014.1176 · Cited by 69
“As for many complex networks [3], the notion of a group (a collection of nodes with specific characteristics) is a major topological feature of food webs [4–6], with important functional implications [7,8].”
BackgroundWang, R., Zhang, S., Wang, Y., Zhang, X., & Chen, L. (2008) · Neurocomputing · doi:10.1016/j.neucom.2007.12.043 · Cited by 67
How advancement in biological network analysis methods empowers proteomics
Goh, W. W. B., Lee, Y. H., Chung, M. C. M., & Wong, L. (2012) · PROTEOMICS · doi:10.1002/pmic.201100321 · Cited by 69
Constructing and Analyzing Criminal Networks
Sarvari, H., Abozinadah, E., Mbaziira, A. V., & McCoy, D. (2014) · IEEE Security and Privacy Workshops (SPW) · doi:10.1109/spw.2014.22 · Cited by 74
A Novel Approach to Evaluate Community Detection Algorithms on Ground Truth
Rossetti, G., Pappalardo, L., & Rinzivillo, S. (2016) · Studies in computational intelligence · doi:10.1007/978-3-319-30569-1_10 · Cited by 76
“CFINDER is an algorithm for finding dense overlapping groups of nodes in networks, based on the Clique Percolation Method (CPM) [15].”
MethodTracking the evolution of overlapping communities in dynamic social networks
Wang, Z., Li, Z., Yuan, G., Sun, Y., Rui, X., & Xiang, X. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.05.026 · Cited by 65
A systematic comparison of genome-scale clustering algorithms
Jay, J. J., Eblen, J. D., Zhang, Y., Benson, M., Perkins, A., Saxton, A. M., Voy, B. H., Chesler, E. J., & Langston, M. A. (2012) · BMC Bioinformatics · doi:10.1186/1471-2105-13-s10-s7 · Cited by 67
“Seven graph-based approaches are examined: k-clique communities [13], WGCNA [14], NNN [15], CAST [16], CLICK [17], maximal clique [18-20], and paraclique [21].”
MethodA new approach for detecting scientific specialties from raw cocitation networks
Wallace, M. L., Gingras, Y., & Duhon, R. J. (2008) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20987 · Cited by 76
Genetic Algorithm with Local Search for Community Mining in Complex Networks
Jin, D., He, D., Liu, D., & Baquero, C. (2010) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/ictai.2010.23 · Cited by 64
“karate 34 78 Zachary's karate club [31] dolphin 62 160 Dolphin social network [32] polbooks 105 441 Books about US politics [33] football 115 613 American College football[3] jazz 198 5484 Jazz musicians network [34] world 7,207 31,784 Semantic network [5] arxiv 56,276 315,921 scientific collaboration networks [35]”
BackgroundMethodInfluentialDisentangling social and group heterogeneities: Public Goods games on complex networks
Gómez-Gardeñes, J., Vilone, D., & Sánchez, A. (2011) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/95/68003 · Cited by 71
Flickr Circles: Aesthetic Tendency Discovery by Multi-View Regularized Topic Modeling
Hong, R., Zhang, L., Zhang, C., & Zimmermann, R. (2016) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2016.2567071 · Cited by 66
“1) K-means clustering (KC); 2) hierarchical clustering (HC) [15]; 3) link clustering (LC) [22]; 4) clique percolation (CP) [21]; 5) low-rank embedding (LRE) [24]; and 6) multi-assignment clustering (MAC) [28].”
MethodResearch on multi-label user classification of social media based on ML-KNN algorithm
Huang, A., Xu, R., Chen, Y., & Guo, M. (2022) · Technological Forecasting and Social Change · doi:10.1016/j.techfore.2022.122271 · Cited by 68
Searching for Rising Stars in Bibliography Networks
Li, X., Foo, C.-S., Tew, K. L., & Ng, S.-K. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00887-0_25 · Cited by 70
“© Springer-Verlag Berlin Heidelberg 2009 Keywords: Rising Stars, Social Network Mining, Bibliography Networks.”
BackgroundPeng, W., Wang, J., Zhao, B., & Wang, L. (2014) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2014.2343954 · Cited by 67
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.