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 701–800 of 1,010
Fundamental statistical features and self-similar properties of tagged networks
Palla, G., Farkas, I. J., Pollner, P., Derényi, I., & Vicsek, T. (2008) · New Journal of Physics · doi:10.1088/1367-2630/10/12/123026 · Cited by 64
Self-citationBhat, S. Y., & Abulaish, M. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2349918 · Cited by 71
Network clique cover approximation to analyze complex contagions through group interactions
Burgio, G., Arenas, A., Gómez, S., & Matamalas, J. T. (2021) · Communications Physics · doi:10.1038/s42005-021-00618-z · Cited by 72
Zhou, L., Lü, K., Yang, P., Wang, L., & Kong, B. (2015) · Expert Systems with Applications · doi:10.1016/j.eswa.2015.07.023 · Cited by 63
“The overlap of communities implies that vertices simultaneously belong to more than one group, for instance, people belong to different social groups, depending on their activities, interests, etc. (Palla et al. 2005).”
BackgroundA Systems Biology Approach to Drug Discovery
Zhu, J., Zhang, B., & Schadt, E. E. (2008) · Advances in genetics · doi:10.1016/s0065-2660(07)00421-x · Cited by 64
Financial networks with static and dynamic thresholds
Qiu, T., Zheng, B., & Chen, G. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/4/043057 · Cited by 63
Three-Step Method for Delineating Functional Labour Market Regions
Kropp, P., & Schwengler, B. (2014) · Regional Studies · doi:10.1080/00343404.2014.923093 · Cited by 63
“Finding groups – nodes or units that are strongly related to each other – in networks has become an important subject in the study of complex networks (cf. GIRVAN and NEWMAN, 2002; PALLA et al., 2005).”
Finding and Testing Network Communities by Lumped Markov Chains
Piccardi, C. (2011) · PLoS ONE · doi:10.1371/journal.pone.0027028 · Cited by 70
Analyzing evolution of research topics with NEViewer: a new method based on dynamic co-word networks
Wang, X., Cheng, Q., & Lu, W. P. (2014) · Scientometrics · doi:10.1007/s11192-014-1347-y · Cited by 65
“For this reason, Palla et al. (2005) proposed a K-cliques algorithm, in which each node is able to be assigned to multiple communities.”
MethodExploring the structural regularities in networks
Shen, H., Cheng, X., & Guo, J. (2011) · Physical Review E · doi:10.1103/physreve.84.056111 · Cited by 66
Analysis of Collaborative Design Networks: A Case Study of OpenIDEO
Fuge, M., Tee, K., Agogino, A. M., & Maton, N. (2014) · Journal of Computing and Information Science in Engineering · doi:10.1115/1.4026510 · Cited by 71
Prediction of Human Disease-Related Gene Clusters by Clustering Analysis
Sun, P. G., Gao, L., & Han, S. (2011) · International Journal of Biological Sciences · doi:10.7150/ijbs.7.61 · Cited by 67
Survey of miRNA-miRNA cooperative regulation principles across cancer types
Shao, T., Wang, G., Chen, H., Xie, Y., Jin, X., Bai, J., Xu, J., Li, X., Huang, J. H., Jin, Y., et al. (2018) · Briefings in Bioinformatics · doi:10.1093/bib/bby038 · Cited by 65
Preferential attachment of communities: The same principle, but a higher level
Pollner, P., Palla, G., & Vicsek, T. (2006) · Europhysics Letters (EPL) · doi:10.1209/epl/i2005-10414-6 · Cited by 86
Self-citationCommunity Detection in Multi-relational Social Networks
Wu, Z., Yin, W., Cao, J., Xu, G., & Cuzzocrea, A. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-41154-0_4 · Cited by 67
“any of the existing methods can be used to partition the network into crisp communities, this paper focus on discovering overlapping communities by which most real networks are characterized [11,22].”
MethodGu, X., Tang, X., Chen, T., & Liu, X. (2023) · Cities · doi:10.1016/j.cities.2023.104680 · Cited by 62
Opportunistic Routing in Intermittently Connected Mobile P2P Networks
Wang, S., Liu, M., Cheng, X., Li, Z., Huang, J., & Chen, B. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.sup.0513033 · Cited by 62
“When using the K-CLIQUE method as in [11], the community detection mainly involves two steps: i) finding all the Kcliques; and 2) finding the communities by searching the adjacent K-cliques, where two K-cliques are adjacent if they share K − 1 nodes.”
BackgroundMethodInfluentialCorrelations in bipartite collaboration networks
Peltomäki, M., & Alava, M. J. (2006) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2006/01/p01010 · Cited by 68
Social Cohesion, Structural Holes, and a Tale of Two Measures
Latora, V., Nicosia, V., & Panzarasa, P. (2013) · Journal of Statistical Physics · doi:10.1007/s10955-013-0722-z · Cited by 64
“First, unlike other studies [67], we do not use clique percolation methods [49] to uncover an overlapping community structure and construct a group-level measure of group intersection and multiple membership.”
ResultFull Connectivity: Corners, Edges and Faces
Coon, J. P., Dettmann, C. P., & Georgiou, O. (2012) · Journal of Statistical Physics · doi:10.1007/s10955-012-0493-y · Cited by 72
Overlapping community detection in labeled graphs
Galbrun, E., Gionis, A., & Tatti, N. (2014) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0373-y · Cited by 71
“Different methods have been proposed to address this problem, relying on clique percolation (Palla et al, 2005), extensions to the modularity-based approaches (Gregory, 2007; Pinney and Westhead, 2006), analysis of ego-networks (Coscia et al, 2012), game-theoretic approaches (Chen et al, 2010),…”
MethodProtein Interaction Networks—More Than Mere Modules
Pinkert, S., Schultz, J., & Reichardt, J. (2010) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000659 · Cited by 72
Disconnected, fragmented, or united? a trans-disciplinary review of network science
Hidalgo, C. A. (2016) · Applied Network Science · doi:10.1007/s41109-016-0010-3 · Cited by 75
“2008), community structure (Palla et al. 2005), (Ahn et al.”
BackgroundMining communities in networks: a solution for consistency and its evaluation
Kwak, H., Choi, Y., Eom, Y.-H., Jeong, H., & Moon, S. (2009) · ACM Internet Measurement Conference (IMC) · doi:10.1145/1644893.1644930 · Cited by 69
Determining Code Words in Euphemistic Hate Speech Using Word Embedding Networks
Magu, R., & Luo, J. (2018) · Workshop on Abusive Language Online (ALW) · doi:10.18653/v1/w18-5112 · Cited by 92
“Therefore, we applied the clique percolation method (Palla et al., 2005) on our graph to achieve overlapping communities of words.”
MethodLearning, Innovation and Growth Within Interconected Clusters: An Agent-Based Approach
Maggioni, M. A., & Roncari, S. N. (2009) · Advances in spatial science · doi:10.1007/978-3-540-70924-4_6 · Cited by 62
Scalable and Interpretable Product Recommendations via Overlapping Co-Clustering
Heckel, R., Vlachos, M., Parnell, T. P., & Mendler-Dünner, C. (2017) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2017.149 · Cited by 70
“Recently, interest in identification of overlapping communities has grown [27], [2], [21], [48], [31].”
BackgroundHow activation, entanglement, and searching a semantic network contribute to event memory
Nelson, D. L., Kitto, K., Galea, D., McEvoy, C. L., & Bruza, P. (2013) · Memory & Cognition · doi:10.3758/s13421-013-0312-y · Cited by 62
Clique Community Persistence: A Topological Visual Analysis Approach for Complex Networks
Rieck, B., Fugacci, U., Lukasczyk, J., & Leitte, H. (2017) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2017.2744321 · Cited by 66
“[37], whose algorithm exploits the Bron–Kerbosch algorithm [3] in order to enumerate all maximal cliques in the network.”
MethodCommunity detection algorithms: a comparative analysis: invited presentation, extended abstract
Fortunato, S., & Lancichinetti, A. (2009) · International ICST Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS) · doi:10.4108/icst.valuetools2009.8046 · Cited by 67
Markovian approach to tackle competing pathogens in simplicial complex
Nie, Y., Li, W., Pan, L., Lin, T., & Wang, W. (2021) · Applied Mathematics and Computation · doi:10.1016/j.amc.2021.126773 · Cited by 71
Large-Scale Synthetic Social Mobile Networks with SWIM
Kosta, S., Mei, A., & Stefa, J. (2012) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2012.229 · Cited by 60
Uncovering the community structure associated with the diffusion dynamics on networks
Cheng, X., & Shen, H. (2010) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2010/04/p04024 · Cited by 65
Structural and functional discovery in dynamic networks with non-negative matrix factorization
Mankad, S., & Michailidis, G. C. (2013) · Physical Review E · doi:10.1103/physreve.88.042812 · Cited by 67
Social media research: A review
Wu, J., Sun, H., & Tan, Y. (2013) · Journal of Systems Science and Systems Engineering · doi:10.1007/s11518-013-5225-6 · Cited by 69
“Management Science, 53(7): 1086-1101 [86] Palla, G.”
Top-k overlapping densest subgraphs
Galbrun, E., Gionis, A., & Tatti, N. (2016) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-016-0464-z · Cited by 69
“Different methods have been proposed to address this problem, relying on clique percolation (Palla et al. 2005), extensions to themodularitybased approaches (Chen et al.”
MethodWu, Z., Liao, Q., & Liu, B. (2019) · Briefings in Bioinformatics · doi:10.1093/bib/bbz085 · Cited by 64
Network of Interdependent Networks: Overview of Theory and Applications
Kenett, D. Y., Gao, J., Huang, X., Shao, S., Vodenska, I., Buldyrev, S. V., Paul, G., Stanley, E., & Havlin, S. (2014) · Understanding complex systems · doi:10.1007/978-3-319-03518-5_1 · Cited by 73
Gates, A. J., & Ahn, Y. (2019) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.2598681 · Cited by 61
Particle swarm optimization for network-based data classification
Carneiro, M. G., Cheng, R., Zhao, L., & Jin, Y. (2018) · Neural Networks · doi:10.1016/j.neunet.2018.12.003 · Cited by 62
“Complex networks have been widely applied to unsupervised and semi-supervised learning tasks, such as data clustering, transductive learning and dimensionality reduction [19, 20, 21, 22, 23, 24, 25, 26, 27].”
Hierarchical clustering in minimum spanning trees
Yu, M., Hillebrand, A., Tewarie, P. K. B., Meier, J. M., van Dijk, B. W., Mieghem, P. V., & Stam, C. J. (2015) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4908014 · Cited by 70
Stochastic Modeling of Single-Hop Cluster Stability in Vehicular Ad Hoc Networks
Abboud, K., & Zhuang, W. (2015) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2015.2396298 · Cited by 59
“[17].”
Network modularity promotes cooperation
Marcoux, M., & Lusseau, D. (2012) · Journal of Theoretical Biology · doi:10.1016/j.jtbi.2012.12.012 · Cited by 67
Measuring Similarity between Sets of Overlapping Clusters
Goldberg, M., Hayvanovych, M., & Magdon‐Ismail, M. (2010) · doi:10.1109/socialcom.2010.50 · Cited by 59
“I. INTRODUCTION A generic task in unsupervised learning is to organize data into clusters.”
BackgroundGleiser, P. M. (2007) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2007/09/p09020 · Cited by 73
Deterministic modularity optimization
Lehmann, S., & Hansen, L. K. (2007) · The European Physical Journal B · doi:10.1140/epjb/e2007-00313-2 · Cited by 65
Human mobility models and opportunistic communications system design
Hui, P., & Crowcroft, J. (2008) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2008.0010 · Cited by 59
“We apply k-clique community detection (Palla et al. 2005) to the node contact graphs that we introduced in the previous section.”
BackgroundMethodInfluentialOverlapping Community Discovery Methods: A Survey
Amelio, A., & Pizzuti, C. (2014) · Lecture notes in social networks · doi:10.1007/978-3-7091-1797-2_6 · Cited by 59
Density-based shrinkage for revealing hierarchical and overlapping community structure in networks
Huang, J., Sun, H., Han, J., & Feng, B. (2010) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2010.10.040 · Cited by 65
Community detection in social networks using user frequent pattern mining
Moosavi, S. A., Jalali, M., Misaghian, N., Shamshirband, S., & Anisi, M. H. (2016) · Knowledge and Information Systems · doi:10.1007/s10115-016-0970-8 · Cited by 64
“The methods reviewed here are clique percolation [39] and its evolution for bipartite graphs [33], s-plex detection [29], and the maximal clique approach [45].”
BackgroundMethodAUGUR: Forecasting the Emergence of New Research Topics
Salatino, A. A., Osborne, F., & Motta, E. (2018) · ACM/IEEE Joint Conference on Digital Libraries · doi:10.1145/3197026.3197052 · Cited by 59
“[29] suggest to monitor how communities change by trying different values of link weights w and tuning the value k for the dimension of cliques.”
InfluentialAn Efficient movie recommendation algorithm based on improved k-clique
Vilakone, P., Park, D.-S., Xinchang, K., & Hao, F. (2018) · Human-centric Computing and Information Sciences · doi:10.1186/s13673-018-0161-6 · Cited by 63
Xu, M., Li, Y., Li, R., Zou, F., & Gu, X. (2019) · Neurocomputing · doi:10.1016/j.neucom.2019.01.074 · Cited by 59
Principles and open questions in functional brain network reconstruction
Korhonen, O., Zanin, M., & Papo, D. (2021) · Human Brain Mapping · doi:10.1002/hbm.25462 · Cited by 68
Efficient Community Search with Size Constraint
Liu, B., Zhang, F., Zhang, W., Lin, X., & Zhang, Y. (2021) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde51399.2021.00016 · Cited by 59
“In the literature, different models are proposed to measure community cohesiveness, such as k -core [46], [47], k -truss [11], [20], and clique [31].”
BackgroundADAPTIVE K-MEANS ALGORITHM FOR OVERLAPPED GRAPH CLUSTERING
Bello-Orgaz, G., Menéndez, H. D., & Camacho, D. (2012) · International Journal of Neural Systems · doi:10.1142/s0129065712500189 · Cited by 62
“CPM has two variants: directed graphs and weighted graphs [7].”
BackgroundRobust dynamic community detection with applications to human brain functional networks
Martinet, L., Kramer, M., Viles, W., Perkins, L. N., Spencer, E. R., Chu, C. J., Cash, S. S., & Kolaczyk, E. D. (2020) · Nature Communications · doi:10.1038/s41467-020-16285-7 · Cited by 67
Ant behavioral maturation is mediated by a stochastic transition between two fundamental states
Richardson, T. O., Kay, T., Braunschweig, R., Journeau, O. A., Rüegg, M., McGregor, S., Rios, P. D. L., & Keller, L. (2021) · Current Biology · doi:10.1016/j.cub.2020.05.038 · Cited by 61
Pattabiraman, B., Patwary, M. M. A., Gebremedhin, A. H., Liao, W., & Choudhary, A. (2015) · Internet Mathematics · doi:10.1080/15427951.2014.986778 · Cited by 66
“The Clique Percolation Method (CPM; [41]) is one effective approach for detecting overlapping communities in a network.”
BackgroundMethodResultInfluentialHartmann, T., Kappes, A., & Wagner, D. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-49487-6_9 · Cited by 61
“In case a vertex is deleted, its cluster is potentially split by using a method similar to clique percolation [110] restricted to the affected cluster.”
MethodBrain Network Informed Subject Community Detection In Early-Onset Schizophrenia
Yang, Z., Xu, Y., Xu, T., Hoy, C. W., Handwerker, D. A., Chen, G., Northoff, G., Zuo, X.-N., & Bandettini, P. A. (2014) · Scientific Reports · doi:10.1038/srep05549 · Cited by 57
Spectral Characterization of Hierarchical Modularity in Product Architectures1
Sarkar, S., Dong, A., Henderson, J. A., & Robinson, P. A. (2013) · Journal of Mechanical Design · doi:10.1115/1.4025490 · Cited by 60
“As we demonstrate through this paper, an explicit predefined assumption of hierarchical levels and modular boundaries (and design components, inputs, outputs, and variables at that level) may hide other naturally occurring or possibly emergent and unintended embedded hierarchies resulting from interactions between sub…”
BackgroundDistributed Fault Detection and Isolation of Continuous-Time Non-Linear Systems
Boem, F., Ferrari, R., & Parisini, T. (2011) · European Journal of Control · doi:10.3166/ejc.17.603-620 · Cited by 63
“Swarms are made up of either social [29, 61, 78, 77], biological [90, 79, 110, 111, 78, 6], robotic [44, 72, 114, 47, 63] or software individuals as in peer–to–peer networks [2].”
BackgroundBhattacharyya, M., & Vishveshwara, S. (2011) · Biochemistry · doi:10.1021/bi200306u · Cited by 61
Tracking changes in dynamic information networks
Takaffoli, M., Fagnan, J., Sangi, F., & Zai͏̈ane, O. R. (2011) · International Conference on Computational Aspects of Social Networks (CASoN) · doi:10.1109/cason.2011.6085925 · Cited by 65
“A number of researchers are working on identifying critical events that characterize the evolution of communities in dynamic social networks.”
BackgroundInvestigating the deceptive information in Twitter spam
Chen, C., Wen, S., Zhang, J., Xiang, Y., Oliver, J., Alelaiwi, A. A., & Hassan, M. M. (2016) · Future Generation Computer Systems · doi:10.1016/j.future.2016.05.036 · Cited by 61
“Some major di↵erences include: 1) our dataset is much larger than previous work, which contains about 600 million tweets with more than 33 million spam tweets; 2) we explore more deeply into the deceptive information contained in spam, their e↵ectiveness in attracting victims, and the behaviour of spamming groups; 3)…”
MethodEvolution of domestic airport networks: a review and comparative analysis
Wandelt, S., Sun, X., & Zhang, J. (2017) · Transportmetrica B Transport Dynamics · doi:10.1080/21680566.2017.1301274 · Cited by 62
“…systems is to understand their complex structures and properties (Azzam, Klingauf, and Zock 2013), such as scalability (Barabási and Albert 1999), controllability (Jia and Barabási 2013), safety event patterns (Zanin 2014), resilience (Lordan et al. 2014) and communities (Palla et al. 2005).”
BackgroundLi, C., Bai, J., Zhao, W., & Yang, X. (2018) · Information Processing & Management · doi:10.1016/j.ipm.2018.10.004 · Cited by 60
A comprehensive literature review on community detection: Approaches and applications
El-Moussaoui, M., Agouti, T., Tikniouine, A., & Adnani, M. E. (2019) · Procedia Computer Science · doi:10.1016/j.procs.2019.04.042 · Cited by 69
Challenges in identifying and interpreting organizational modules in morphology
Esteve‐Altava, B. (2017) · Journal of Morphology · doi:10.1002/jmor.20690 · Cited by 60
Lužar, B., Levnajić, Z., Povh, J., & Perc, M. (2014) · PLoS ONE · doi:10.1371/journal.pone.0094429 · Cited by 55
Overlapping community detection by constrained personalized PageRank
Gao, Y., Yu, X., & Zhang, H. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.114682 · Cited by 60
Alvari, H., Hashemi, S., & Hamzeh, A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23887-1_79 · Cited by 56
“It is noticeable that Clique algorithm needs the size of cliques as input.”
MethodCommunity Structures in Bipartite Networks: A Dual-Projection Approach
Melamed, D. (2014) · PLoS ONE · doi:10.1371/journal.pone.0097823 · Cited by 59
“The dual-projection approach to partitioning bipartite graphs is particularly flexible and can be applied in conjunction with the evolving literatures on overlapping and hierarchical community structures [21–28].”
MethodRubenstein, D. I., Sundaresan, S. R., Fischhoff, I. R., Tantipathananandh, C., & Berger-Wolf, T. Y. (2015) · PLOS ONE · doi:10.1371/journal.pone.0138645 · Cited by 58
Social Representations of Hero and Everyday Hero: A Network Study from Representative Samples
Keczer, Z., File, B., Orosz, G., & Zimbardo, P. G. (2016) · PLoS ONE · doi:10.1371/journal.pone.0159354 · Cited by 65
Hypergraph partitioning for social networks based on information entropy modularity
Yang, W., Wang, G., Bhuiyan, M. Z. A., & Choo, K. R. (2016) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2016.10.002 · Cited by 63
“…methods include minimum-betweenness (Newman and Girvan, 2004), clustering centrality (Santo et al., 2004), random walk (Pons and Latapy, 2005), eigenvectors of matrices (Newman, 2006), target function optimization (Newman, 2004), and methods based on density of edge connection (Palla et al., 2005).”
MethodBinesh, N., & Rezghi, M. (2017) · Applied Soft Computing · doi:10.1016/j.asoc.2016.12.019 · Cited by 57
Gene Profiling in Patients with Systemic Sclerosis Reveals the Presence of Oncogenic Gene Signatures
Dolcino, M., Pelosi, A., Fiore, P. F., Patuzzo, G., Tinazzi, E., Lunardi, C., & Puccetti, A. (2018) · Frontiers in Immunology · doi:10.3389/fimmu.2018.00449 · Cited by 63
Visual Analysis of Venture Similarity in Entrepreneurial Ecosystems
Basole, R. C., Park, H., & Chao, R. O. (2018) · IEEE Transactions on Engineering Management · doi:10.1109/tem.2018.2855435 · Cited by 58
“As we are interested in the macroscopic composition of venture positioning in each entrepreneurial ecosystem, detection of clusters and subcommunities is of importance [60], [61].”
BackgroundCommunity detection based on Game Theory
Moscato, V., Picariello, A., & Sperlí, G. (2019) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2019.08.003 · Cited by 58
Lange, J., & Zickfeld, J. (2021) · Emotion Review · doi:10.1177/1754073920988787 · Cited by 59
“One such algorithm is the clique percolation algorithm (Adamcsek et al., 2006; Farkas et al., 2007; Palla et al., 2005; see also Blanken et al., 2018).”
MethodSocial Media Data Mining: A Social Network Analysis Of Tweets During The 2010-2011 Australian Floods
Cheong, C. (2011) · AIS Electronic Library (AISeL) · Cited by 215
Ubiquitousness of link-density and link-pattern communities in real-world networks
Šubelj, L., & Bajec, M. (2012) · The European Physical Journal B · doi:10.1140/epjb/e2011-20448-7 · Cited by 65
Finding Overlapping Communities in Social Networks
Goldberg, M., Kelley, S., Magdon‐Ismail, M., Mertsalov, K., & Wallace, A. (2010) · doi:10.1109/socialcom.2010.24 · Cited by 64
“It is useful to consider one of the algorithms proposed in the literature for finding overlapping communities: the clique percolation method [17].”
MethodOverlapping community detection using neighborhood ratio matrix
Eustace, J., Wang, X., & Cui, Y. (2014) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2014.11.039 · Cited by 58
Community structure discovery in Facebook
Ferrara, E. (2012) · International Journal of Social Network Mining · doi:10.1504/ijsnm.2012.045106 · Cited by 62
“One of the first approach has been presented by (Palla et al., 2005) and has attracted a lot of attention by the scientific community.”
BackgroundOverlapping community detection via network dynamics
Wu, J., Jiao, L., Jin, C., Liu, F., Gong, M., Shang, R., & Chen, W. (2012) · Physical Review E · doi:10.1103/physreve.85.016115 · Cited by 56
Locating Structural Centers: A Density-Based Clustering Method for Community Detection
Wang, X., Liu, G., Li, J., & Nees, J. P. (2017) · PLoS ONE · doi:10.1371/journal.pone.0169355 · Cited by 64
Multiparameter Models of Innovation Diffusion on Complex Networks
McCullen, N., Rucklidge, A. M., Bale, C. S. E., Foxon, T., & Gale, W. F. (2013) · SIAM Journal on Applied Dynamical Systems · doi:10.1137/120885371 · Cited by 66
The prediction of protein-protein interaction networks in rice blast fungus
He, F., Zhang, Y., Chen, H., Zhang, Z., & Peng, Y. (2008) · BMC Genomics · doi:10.1186/1471-2164-9-519 · Cited by 56
“It has been proved that clustering methods are good at identifying PPIs that take place within the same pathways or complexes [42,43].”
BackgroundPredicting Group Evolution in the Social Network
Bródka, P., Kazienko, P., & Kołoszczyk, B. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-35386-4_5 · Cited by 60
Mining maximal cliques from an uncertain graph
Mukherjee, A. P., Xu, P., & Tirthapura, S. (2015) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2015.7113288 · Cited by 55
Optimal local community detection in social networks based on density drop of subgraphs
Qi, X., Tang, W., Wu, Y., Guo, G., Fuller, E., & Zhang, C. (2013) · Pattern Recognition Letters · doi:10.1016/j.patrec.2013.09.008 · Cited by 55
“, 1990); (2) it allows overlapping clustering or multi-membership, which is a concept that has recently received increased attention (Palla et al., 2005).”
BackgroundEpidemic spreading on complex networks with overlapping and non-overlapping community structure
Shang, J., Liu, L., Li, X., Xie, F., & Wu, C. (2014) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2014.10.023 · Cited by 59
“, person) belongs to multiple communities, which leads to overlapping community 25 structure [20].”
BackgroundFortney, K., Kotlyar, M., & Jurišica, I. (2010) · Genome biology · doi:10.1186/gb-2010-11-2-r13 · Cited by 61
“However, a large body of work in network theory has demonstrated the value of more sophisticated topological measures of network cohesiveness, or modularity [25,26].”
Isolation concepts for efficiently enumerating dense subgraphs
Komusiewicz, C., Hüffner, F., Moser, H., & Niedermeier, R. (2009) · Theoretical Computer Science · doi:10.1016/j.tcs.2009.04.021 · Cited by 64
“enumeration of isolated dense subgraphs for the identification of communities, which play a strong role in the analysis of biological and social networks [23].”
BackgroundTime series trend detection and forecasting using complex network topology analysis
Anghinoni, L., Zhao, L., Ji, D., & Pan, H. (2019) · Neural Networks · doi:10.1016/j.neunet.2019.05.018 · Cited by 62
Inference and Analysis of Population Structure Using Genetic Data and Network Theory
Greenbaum, G., Templeton, A. R., & Bar‐David, S. (2016) · Genetics · doi:10.1534/genetics.115.182626 · Cited by 65
A local community detection algorithm based on internal force between nodes
Guo, K., He, L., Chen, Y., Guo, W., & Zheng, J. (2019) · Applied Intelligence · doi:10.1007/s10489-019-01541-1 · Cited by 56
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.