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 801–900 of 1,010
Dynamic Module Detection in Temporal Attributed Networks of Cancers
Li, D., Zhang, S., & Ma, X. (2021) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2021.3069441 · Cited by 56
Social Group Dynamics in Networks
Palla, G., Pollner, P., Barabási, A.-Ĺ., & Vicsek, T. (2009) · Understanding complex systems · doi:10.1007/978-3-642-01284-6_2 · Cited by 58
“Since communities have no widely accepted unique definition, the number of available methods to pinpoint them is vast [15, 16, 19, 24, 26, 27, 33, 40, 43, 53, 54, 60–64].”
BackgroundMethodInfluentialSelf-citationCovariance, correlation matrix, and the multiscale community structure of networks
Shen, H., Cheng, X., & Fang, B. (2010) · Physical Review E · doi:10.1103/physreve.82.016114 · Cited by 58
Detecting and extracting clusters in atom probe data: A simple, automated method using Voronoi cells
Felfer, P. J., Ceguerra, A. V., Ringer, S. P., & Cairney, J. M. (2014) · Ultramicroscopy · doi:10.1016/j.ultramic.2014.11.015 · Cited by 54
“To extract small precipitates which may have inter-grown, k-clique algorithms can be used to define individual precipitates [29].”
MethodLi, Y., Wang, Y., Chen, J., Jiao, L., & Shang, R. (2015) · Journal of Heuristics · doi:10.1007/s10732-015-9289-y · Cited by 57
LASS: Local-Activity and Social-Similarity Based Data Forwarding in Mobile Social Networks
Zhong, L., Wang, C., Yang, S., Jiang, C., & Li, X. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2014.2308200 · Cited by 54
“There have existed many static and unweighted algorithms [17], [18], [19], [20] and some of them can be transplanted to the dynamicweighted graph, but they have many problems.”
BackgroundOverlapping Community Detection in Bipartite Networks
Du, N., Wang, B., Wu, B., & Wang, Y. (2008) · IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT) · doi:10.1109/wiiat.2008.98 · Cited by 59
Social Recommendation With Learning Personal and Social Latent Factors
Liu, H., Jing, L., Yu, J. Q., & Ng, M. K. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2019.2961666 · Cited by 58
“Li et al. [24] adopted CPM [32] and BIGCLAM [33] to determine the social communities, and then adjust the latent user factor.”
MethodExploring complex adaptive networks in the aftermath of the 2008 Wenchuan earthquake in China
Chen, W., Zhang, H., Comfort, L. K., & Tao, Z. (2020) · Safety Science · doi:10.1016/j.ssci.2020.104607 · Cited by 55
Community detection in dynamic social networks: A game-theoretic approach
Alvari, H., Hajibagheri, A., & Sukthankar, G. (2014) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2014.6921567 · Cited by 54
“The publicly available, virtually free information in social media poses a new challenge to consumers who have to discern whether a piece of information published in social media is reliable.”
BackgroundDetermining modular organization of protein interaction networks by maximizing modularity density
Zhang, S., Ning, X.-M., Ding, C. H. Q., & Zhang, X.-S. (2010) · BMC Systems Biology · doi:10.1186/1752-0509-4-s2-s10 · Cited by 57
A Method for Group Extraction in Complex Social Networks
Bródka, P., Musiał, K., & Kazienko, P. (2010) · Communications in computer and information science · doi:10.1007/978-3-642-16318-0_27 · Cited by 52
“Other methods that are used in extracting communities are fuzzy clustering approaches and specifically clique percolation methods that will allow the groups to overlap [ 8 ], [7].”
MethodTasks activating the default mode network map multiple functional systems
Mancuso, L., Cavuoti-Cabanillas, S., Liloia, D., Manuello, J., Buzi, G., Duca, S., Cauda, F., & Costa, T. (2022) · Brain Structure and Function · doi:10.1007/s00429-022-02467-0 · Cited by 59
“For instance, they partition the gray matter into non-overlapping volumes, even if in the brain, as in most real-world networks, a node is usually connected to more than one community (Palla et al. 2005; Ferrarini et al. 2009; Yeo et al. 2014; Najafi et al. 2016).”
Efficient crystal structure prediction based on the symmetry principle
Han, Y., Ding, C., Wang, J., Gao, H., Shi, J., Yu, S., Jia, Q., Pan, S., & Sun, J. (2025) · Nature Computational Science · doi:10.1038/s43588-025-00775-z · Cited by 65
“While numerous algorithms, such as the clique percolation method 71 , have been specifically designed for detecting overlapping communities in networks, crystal graphs may not always be suitable for treatment as community-based networks.”
Lin, Z., Wen, F., Chung, C. Y., Wong, K. P., & Zhou, H. R. (2011) · IET Generation Transmission & Distribution · doi:10.1049/iet-gtd.2010.0586 · Cited by 53
Potts model based on a Markov process computation solves the community structure problem effectively
Li, H., Wang, Y., Wu, L., Zhang, J., & Zhang, X. (2012) · Physical Review E · doi:10.1103/physreve.86.016109 · Cited by 53
Social network analysis and mining to support the assessment of on-line student participation
Khorasgani, R. R., Takaffoli, M., & Zai͏̈ane, O. R. (2012) · ACM SIGKDD Explorations Newsletter · doi:10.1145/2207243.2207247 · Cited by 61
Occupational exposome: A network-based approach for characterizing Occupational Health Problems
Faisandier, L., Bonneterre, V., Gaudemaris, R. D., & Bicout, D. (2011) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2011.02.010 · Cited by 56
Predicting Community Evolution in Social Networks
Saganowski, S., Gliwa, B., Bródka, P., Zygmunt, A., Kazienko, P., & Koźlak, J. (2015) · Entropy · doi:10.3390/e17053053 · Cited by 56
“CPM requires k parameter which decides about minimum size of groups.”
Review on community detection algorithms in social networks
Cuijuan, W., Tang, W., Sun, B., Fang, J., & Wang, Y. (2015) · IEEE International Conference on Progress in Informatics and Computing · doi:10.1109/pic.2015.7489908 · Cited by 64
Male cooperation for breeding opportunities contributes to the evolution of multilevel societies
Qi, X., Huang, K., Fang, G., Grueter, C. C., Dunn, D. W., Li, Y., Ji, W., Wang, X., Wang, R.-T., Garber, P. A., et al. (2017) · Proceedings of the Royal Society B Biological Sciences · doi:10.1098/rspb.2017.1480 · Cited by 59
Event detection and evolution in multi-lingual social streams
Liu, Y., Peng, H. M., Li, J., Song, Y., & Li, X. (2020) · Frontiers of Computer Science · doi:10.1007/s11704-019-8201-6 · Cited by 53
Qu, Y., Guan, X., Zheng, Q., Liu, T., Wang, L., Hou, Y., & Yang, Z. (2015) · Journal of Systems and Software · doi:10.1016/j.jss.2015.06.015 · Cited by 55
“Introduction Many natural and man-made complex networked systems, inluding metabolic networks, computer networks and social net- orks, exhibit divisions or clusters of network nodes (Flake et al., 000; Fortunato, 2010; Girvan and Newman, 2002; Mucha et al., 010; Palla et al., 2005).”
BackgroundA Distributed Algorithm to Enumerate All Maximal Cliques in MapReduce
Wu, B., Yang, S., Zhao, H., & Wang, B. (2009) · International Conference on Frontier of Computer Science and Technology (FCST) · doi:10.1109/fcst.2009.30 · Cited by 53
“Among most of the applications in graph mining, enumerating maximal clique is a well-studied problem, not only for its efficiency requirement [8, 7, 10, 3] but also for its extensive engineering applications, such as community detection [9].”
BackgroundUSING GRAPH CONCEPTS TO UNDERSTAND THE ORGANIZATION OF COMPLEX SYSTEMS
Christensen, C., & Albert, R. (2007) · International Journal of Bifurcation and Chaos · doi:10.1142/s021812740701835x · Cited by 59
“The group of nodes and edges identified during this process is then regarded as a module [ Palla, Derenyi, Farkas and Vicsek, 2005 ].”
BackgroundMethodInfluentialThe Architecture of the Human RNA-Binding Protein Regulatory Network
Quattrone, A., & Dassi, E. (2019) · iScience · doi:10.1016/j.isci.2019.10.058 · Cited by 53
Network-Based Pipeline for Analyzing MS Data: An Application toward Liver Cancer
Goh, W. W. B., Lee, Y. H., Ramdzan, Z. M., Jin, J., Dong, D., Lin, Q., Chung, M. C. M., & Wong, L. (2011) · Journal of Proteome Research · doi:10.1021/pr1010845 · Cited by 54
Community-Aware Task Allocation for Social Networked Multiagent Systems
Wang, W., & Jiang, Y. (2014) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2013.2289327 · Cited by 55
Constraint-Based Pattern Mining in Dynamic Graphs
Robardet, C. (2009) · Proceedings · doi:10.1109/icdm.2009.99 · Cited by 52
“For example, Palla et al. [10] put all the cliques of size k that share k−1 vertices together.”
BackgroundCombined node and link partitions method for finding overlapping communities in complex networks
Jin, D., Gabryś, B., & Dang, J. (2015) · Scientific Reports · doi:10.1038/srep08600 · Cited by 53
Liu, J., Zhong, W., Abbass, H. A., & Green, D. G. (2010) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2010.5586522 · Cited by 52
“In 2005, Palla et al. [ 2 ] extended this problem to find overlapping communities, namely, each node can belong to one or more communities.”
Backgroundk-Cliques mining in dynamic social networks based on triadic formal concept analysis
Hao, F., Park, D.-S., Min, G., Jeong, Y., & Park, J.-H. (2016) · Neurocomputing · doi:10.1016/j.neucom.2015.10.141 · Cited by 52
Community Detection in Bipartite Networks: Algorithms and Case studies
Alzahrani, T., & Horadam, K. J. (2015) · Understanding complex systems · doi:10.1007/978-3-662-47824-0_2 · Cited by 68
A Multi-Objective Genetic Algorithm for overlapping community detection based on edge encoding
Bello-Orgaz, G., Salcedo‐Sanz, S., & Camacho, D. (2018) · Information Sciences · doi:10.1016/j.ins.2018.06.015 · Cited by 54
Topological percolation on hyperbolic simplicial complexes
Bianconi, G., & Ziff, R. M. (2018) · Physical review. E · doi:10.1103/physreve.98.052308 · Cited by 62
“In network science stardard percolation has been leveraged by the notion of k-clique percolation [53, 54] called also by the topologists k-connectedness [55] where cliques of nodes are connected if they share (k − 1)-cliques.”
BackgroundSize Matters: A Comparative Analysis of Community Detection Algorithms
Wagenseller, P., Wang, F., & Wu, W. (2018) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2018.2875626 · Cited by 56
Local Overlapping Community Detection
Li, N., Luo, W., Zhu, W., & Hua, B. (2019) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3361739 · Cited by 55
Hide and Seek: Outwitting Community Detection Algorithms
Mittal, S., Sengupta, D., & Chakraborty, T. (2021) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2021.3062711 · Cited by 53
Systems Biology Approaches and Tools for Analysis of Interactomes and Multi-target Drugs
Schrattenholz, A. S., Groebe, K., & Šoškić, V. (2010) · Methods in molecular biology · doi:10.1007/978-1-60761-800-3_2 · Cited by 56
Understanding and preventing cascading breakdown in complex clustered networks
Huang, L., Lai, Y., & Chen, G. (2008) · Physical Review E · doi:10.1103/physreve.78.036116 · Cited by 52
On the Spectral Characterization and Scalable Mining of Network Communities
Yang, B., Liu, J., & Feng, J. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.233 · Cited by 52
“A semantic network [2] contains 7207 phrases and 31784 edges, as shown in Fig.”
BackgroundMethodGao, L., Gao, H., Zhou, H., & Xu, Y. (2015) · BMC Neurology · doi:10.1186/s12883-015-0307-3 · Cited by 52
Atypical combinations of technologies in regional co-inventor networks
Abbasiharofteh, M., Kogler, D. F., & Lengyel, B. (2023) · Research Policy · doi:10.1016/j.respol.2023.104886 · Cited by 53
Community Detection of Time-Varying Mobile Social Networks
Chan, S.-Y., Hui, P., & Xu, K. (2009) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-642-02466-5_115 · Cited by 56
“In our work, we adapted the k-clique [9] community as the basis of our definition of community.”
MethodTargeted revision: A learning-based approach for incremental community detection in dynamic networks
Shang, J., Liu, L., Li, X., Xie, F., & Wu, C. (2015) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2015.09.072 · Cited by 53
Fuzzy-rough community in social networks
Kundu, S., & Pal, S. K. (2015) · Pattern Recognition Letters · doi:10.1016/j.patrec.2015.02.005 · Cited by 51
Recommendation Algorithm based on Link Prediction and Domain Knowledge in Retail Transactions
Li, J., Zhang, L., Meng, F., & Li, F. (2014) · Procedia Computer Science · doi:10.1016/j.procs.2014.05.339 · Cited by 51
Adjusting from disjoint to overlapping community detection of complex networks
Wang, X., Jiao, L., & Wu, J. (2009) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2009.08.032 · Cited by 51
Anomalous lifetime distributions and topological traps in ordering dynamics
Castelló, X., Toivonen, R., Eguíluz, V. M., Saramäki, J., Kaski, K. K., & Miguel, M. S. (2007) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/79/66006 · Cited by 56
An ant colony based algorithm for overlapping community detection in complex networks
Zhou, X., Liu, Y., Zhang, J., Liu, T., & Zhang, D. (2015) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2015.02.020 · Cited by 52
Vulnerability of network of networks
Havlin, S., Kenett, D. Y., Bashan, A., Gao, J., & Stanley, E. (2014) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2014-02251-6 · Cited by 59
Scalable Learning of Collective Behavior
Tang, L., Wang, X., & Liu, H. (2011) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.38 · Cited by 54
“propose a clique percolation method to discover overlapping dense communities [31].”
MethodVieira, V. D. F., Xavier, C. R., & Evsukoff, A. G. (2020) · Applied Network Science · doi:10.1007/s41109-020-00289-9 · Cited by 51
Ordering heuristics for k -clique listing
Li, R.-H., Gao, S., Qin, L., Wang, G., Yang, W., & Yu, J. X. (2020) · Proceedings of the VLDB Endowment · doi:10.14778/3407790.3407843 · Cited by 51
“Perhaps the most elementary cohesive substructure in a graph is the k -clique structure which has been widely used in a variety of network analysis applications [34, 17, 30, 6, 20, 11].”
BackgroundMethodBehavioral Analyses of Information Diffusion Models by Observed Data of Social Network
Saito, K., Kimura, M., Ohara, K., & Motoda, H. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12079-4_20 · Cited by 55
“The fourth one is a co-authorship network used in [16] and had 12 357 nodes and 38 896 directed links (the coauthorship network).”
BackgroundGraph Comparison Using Fine Structure Analysis
Macindoe, O., & Richards, W. A. (2010) · doi:10.1109/socialcom.2010.35 · Cited by 51
“2634 Semantic [18] Lesmis 77 254 0.”
Community Structure in Online Collegiate Social NetworksPreprint
Traud, A. L., Kelsic, E. D., Mucha, P. J., & Porter, M. A. (2008) · arXiv (Cornell University) · Cited by 96
Jorna, R., Faber, N. R., & Hadders, H. (2011) · Cited by 51
Optimization of Graph Clustering Inspired by Dynamic Belief Systems
Li, H., Cao, H., Feng, Y., Li, X., & Pei, J. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2023.3274547 · Cited by 52
“Besides, there are some others methods including K-clique percolation [33], stochastic block method [34] and similarity feature based method [35].”
MethodFollowers Are Not Enough: A Multifaceted Approach to Community Detection in Online Social Networks
Darmon, D. M., Omodei, E., & Garland, J. (2015) · PLoS ONE · doi:10.1371/journal.pone.0134860 · Cited by 54
“For example, the work of [9] on clique percolation can account for both features, but not at the same time.”
BackgroundMethodCommunity detection algorithms: a comparative analysis: invited presentation, extended abstract
Fortunato, S., & Lancichinetti, A. (2009) · Performance Evaluation Methodolgies and Tools · doi:10.5555/1698822.1698858 · Cited by 60
Mitra, R., Edmonds, M. D., Sun, J., Zhao, M., Yu, H., Eischen, C. M., & Zhao, Z. (2014) · RNA · doi:10.1261/rna.042754.113 · Cited by 52
“We used the software CFinder (Palla et al. 2005) to identify tightly connected overlapping interaction modules in NSCLC.”
MethodOClustR: A new graph-based algorithm for overlapping clustering
Pérez‐Suárez, A., Martínez-Trinidad, J. F., Carrasco-Ochoa, J. A., & Medina-Pagola, J. E. (2013) · Neurocomputing · doi:10.1016/j.neucom.2013.04.025 · Cited by 50
Cui, Y., & Wang, X. (2014) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2014.03.077 · Cited by 52
VIP delegation: Enabling VIPs to offload data in wireless social mobile networks
Barbera, M. V., Stefa, J., Viana, A. C., de Amorim, M. D., & Boc, M. (2011) · International Conference on Distributed Computing in Smart Systems and the Internet of Things (DCOSS-IoT) · doi:10.1109/dcoss.2011.5982141 · Cited by 50
Modularity in Protein Complex and Drug Interactions Reveals New Polypharmacological Properties
Nacher, J. C., & Schwartz, J. (2012) · PLoS ONE · doi:10.1371/journal.pone.0030028 · Cited by 51
Ring: Real-Time Emerging Anomaly Monitoring System Over Text Streams
Yu, W., Li, J., Bhuiyan, M. Z. A., Zhang, R., & Huai, J. (2017) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2017.2672672 · Cited by 55
“To distill events from these aspects and get the bigger picture, we use k-clique percolation to find overlapping communities as events [22].”
MethodCommunity Detection by Fuzzy Relations
Luo, W., Yan, Z., Bu, C., & Zhang, D. (2017) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2017.2751101 · Cited by 50
“Comparisons among FastModularity [20], CFinder [45], SCAN [46], TopLeader [28], Newman [18], Louvain [21], Walktrap [47], LICOD [29] and CDFR are shown in Table II.”
MethodExploring the solution landscape enables more reliable network community detection
Calatayud, J., Bernardo‐Madrid, R., Neuman, M., Rojas, A., & Rosvall, M. (2019) · Physical review. E · doi:10.1103/physreve.100.052308 · Cited by 51
POISED: Spotting Twitter Spam Off the Beaten Paths
Nilizadeh, S., Labrèche, F., Sedighian, A., Zand, A., Fernandez, J. M., Kruegel, C., Stringhini, G., & Vigna, G. (2017) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3133956.3134055 · Cited by 57
“Although these communities might be roughly defined and be overlapping with each other [1, 62], the concept behind them is still valid.”
BackgroundTracking the spread of COVID-19 in India via social networks in the early phase of the pandemic
Azad, S., & Devi, S. (2020) · Journal of Travel Medicine · doi:10.1093/jtm/taaa130 · Cited by 50
“The sets of these nodes are usually called clusters, communities, cohesive groups or modules.(16) The community detection problem is defined as the division of a graph into clusters or groups of nodes in which each includes a robust internal cohesion (the densities of edges within a group) and a weak external cohesion…”
BackgroundMultiscale community detection in Cytoscape
Singhal, A., Cao, S., Churas, C., Pratt, D., Fortunato, S., Zheng, F., & Ideker, T. (2020) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1008239 · Cited by 53
Defining and Discovering Communities in Social Networks
Kelley, S., Goldberg, M., Magdon‐Ismail, M., Mertsalov, K., & Wallace, A. (2011) · Springer optimization and its applications · doi:10.1007/978-1-4614-0754-6_6 · Cited by 58
Ma, X., & Gao, L. (2011) · Information Sciences · doi:10.1016/j.ins.2011.11.033 · Cited by 50
Comparison of threshold selection methods for microarray gene co-expression matrices
Borate, B. R., Chesler, E. J., Langston, M. A., Saxton, A. M., & Voy, B. H. (2009) · BMC Research Notes · doi:10.1186/1756-0500-2-240 · Cited by 59
Deep Feature Learning for GraphsPreprint
Rossi, R. A., Zhou, R., & Ahmed, N. K. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.08829 · Cited by 57
“L EARNING a useful graph representation lies at the heart and success of many within-network and across-network machine learning tasks such as node and link classification [1], [2], [3], [4], [5], anomaly detection [6], [7], [8], link prediction [9], [10], dynamic network analysis [11], [12], community detection [13],…”
BackgroundNumber of cliques in random scale-free network ensembles
Bianconi, G., & Marsili, M. (2006) · Physica D Nonlinear Phenomena · doi:10.1016/j.physd.2006.09.013 · Cited by 53
An Empirical Study of the Relation between Community Structure and Transitivity
Orman, G. K., Labatut, V., & Cherifi, H. (2012) · Studies in computational intelligence · doi:10.1007/978-3-642-30287-9_11 · Cited by 55
“The concept of community can be formally defined in several ways: some authors see the communities as mutually exclusive [15], whereas for others they can overlap [16, 17]; some consider they form a hierarchy [18], and thus a small community is contained in a bigger one; some consider the concept of community can be d…”
BackgroundCommunity structure detection based on Potts model and network's spectral characterization
Li, H., Wang, Y., Wu, L., Liu, Z., Chen, L., & Zhang, X.-S. (2012) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/97/48005 · Cited by 50
Epidemic spreading on networks with overlapping community structure
Chen, J., Zhang, H., Guan, Z., & Li, T. (2011) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2011.10.011 · Cited by 51
On the separability of structural classes of communities
Abrahão, B., Soundarajan, S., Hopcroft, J. E., & Kleinberg, R. (2012) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2339530.2339631 · Cited by 55
Social-Aware Resource Allocation for Device-to-Device Communications Underlaying Cellular Networks
Li, Y., Su, S., & Chen, S. (2015) · IEEE Wireless Communications Letters · doi:10.1109/lwc.2015.2410768 · Cited by 49
Bloggers behavior and emergent communities in Blog space
Dankulov, M. M., & Tadić, B. (2009) · The European Physical Journal B · doi:10.1140/epjb/e2009-00431-9 · Cited by 49
SEBAR: Social-Energy-Based Routing for Mobile Social Delay-Tolerant Networks
Li, F., Jiang, H. X., Li, H., Cheng, Y., & Wang, Y. (2017) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2017.2653843 · Cited by 49
Culturomics: A New Kid on the Block of OMICS to Enable Personalized Medicine
Kambouris, M. E., Pavlidis, C., Skoufas, E., Arabatzis, M., Καντζάνου, Μ., Velegraki, A., & Patrinos, G. P. (2017) · OMICS A Journal of Integrative Biology · doi:10.1089/omi.2017.0017 · Cited by 50
“natural, modified, or engineered into biofunctional (occurring or engineered) networks (Palla et al., 2005).”
Information Granulation-Based Community Detection for Social Networks
Raj, E. D., Manogaran, G., Srivastava, G., & Wu, Y. (2020) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2019.2963247 · Cited by 49
“The two different definitions of communities help in the detection and validation of the detected communities [16].”
BackgroundDisentangling Homophily, Community Structure, and Triadic Closure in Networks
Peixoto, T. P. (2022) · Physical Review X · doi:10.1103/physrevx.12.011004 · Cited by 74
“[19] Gergely Palla, Imre Derényi, Illés Farkas, and Tamás Vicsek, “Uncovering the overlapping community structure of complex networks in nature and society,” Nature 435, 814–818 (2005).”
BackgroundHydrophobic interaction network analysis for thermostabilization of a mesophilic xylanase
Kim, T., Joo, J. C., & Yoo, Y. J. (2012) · Journal of Biotechnology · doi:10.1016/j.jbiotec.2012.04.015 · Cited by 49
Detection of node group membership in networks with group overlap
Sawardecker, E. N., Sales‐Pardo, M., & Amaral, L. A. N. (2008) · The European Physical Journal B · doi:10.1140/epjb/e2008-00418-0 · Cited by 49
An efficient algorithm for community mining with overlap in social networks
Rhouma, D., & Romdhane, L. B. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.01.002 · Cited by 49
Chin, C.-H., Chen, S., Ho, C.-W., Ko, M., & Lin, C. (2010) · BMC Bioinformatics · doi:10.1186/1471-2105-11-s1-s25 · Cited by 48
“The CPC (Clique Percolation Clustering method)[4,5], SCAN (Structural Clustering Algorithm for Networks) [6], COACH (COre-AttaCHment based method) [7], CMC (Clustering-based on Maximal Cliques)[8] and Core (Core-Attachment approach)[9] are classified into this category.”
Detecting and Tracking Community Dynamics in Evolutionary Networks
Chen, Z., Wilson, K. A., Jin, Y., Hendrix, W., & Samatova, N. F. (2010) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2010.32 · Cited by 57
“Does any community in snapshot t disappear in snapshot k, or does any new community appear in snapshot k?”
BackgroundMethodThe network of collaboration among rappers and its community structure
Smith, R. D. (2006) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2006/02/p02006 · Cited by 54
Spectral affinity in protein networks
Voevodski, K., Teng, S., & Xia, Y. (2009) · BMC Systems Biology · doi:10.1186/1752-0509-3-112 · Cited by 55
Overlap community detection using spectral algorithm based on node convergence degree
Li, W., Jiang, S., & Jin, Q. (2017) · Future Generation Computer Systems · doi:10.1016/j.future.2017.08.028 · Cited by 48
Network-based analysis of fluid flows: Progress and outlook
Taira, K., & Nair, A. (2022) · Progress in Aerospace Sciences · doi:10.1016/j.paerosci.2022.100823 · Cited by 53
“For detailed discussions on network models, the readers should refer to (Newman, 2018b; Barabasi, 2016; Estrada, 2012; Newman, 2003).”
BackgroundUser community discovery from multi-relational networks
Zhang, Z., Li, Q., Zeng, D. D., & Gao, H. (2012) · Decision Support Systems · doi:10.1016/j.dss.2012.09.012 · Cited by 51
“[8] proposed a clique percolationmethod (CPM) based on the concept that the internal links of a community are likely to form cliques due to their high density.”
BackgroundReverse enGENEering of Regulatory Networks from Big Data: A Roadmap for Biologists
Dong, X., Yambartsev, A., Ramsey, S. A., Thomas, L. D., Shulzhenko, N., & Morgun, A. (2015) · Bioinformatics and Biology Insights · doi:10.4137/bbi.s12467 · Cited by 54
“Tools for identification of modules include MCODE, 64 cfinder, 65 and graph clustering (MCL).”
MethodTEAK: Topology Enrichment Analysis frameworK for detecting activated biological subpathways
Judeh, T., Johnson, C., Kumar, A., & Zhu, D. (2012) · Nucleic Acids Research · doi:10.1093/nar/gks1299 · Cited by 48
“In this case, we chose to adapt and slightly tweak the CPM (29,30).”
MethodInfluentialFuzzy community structure detection by particle competition and cooperation
Breve, F., & Zhao, L. (2012) · Soft Computing · doi:10.1007/s00500-012-0924-3 · Cited by 48
“…and colors represent their respective overlapping index detected by the proposed method Lancichinetti and Fortunato (2009); Lancichinetti and Fortunato (2009) for the Cfinder method, proposed by Palla et al. (2005), as we generate the test networks using exactly the same parameters they have used.”
BackgroundMethod
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.