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 401–500 of 1,010
Nonnegative matrix factorization with mixed hypergraph regularization for community detection
Wu, W., Kwong, S., Zhou, Y., Jia, Y., & Gao, W. (2018) · Information Sciences · doi:10.1016/j.ins.2018.01.008 · Cited by 117
Detecting, identifying and visualizing research groups in co-authorship networks
Perianes‐Rodríguez, A., Olmeda‐Gómez, C., & Anegón, F. D. M. (2009) · Scientometrics · doi:10.1007/s11192-009-0040-z · Cited by 115
“But in addition to hierarchical extraction methods, which are only useful if the structure is to be interpreted in terms of sets of separate communities, others based on locating network communities by statistical analysis of the raw data are also available (Palla et al. 2005).”
BackgroundWhen are networks truly modular?
Reichardt, J., & Bornholdt, S. (2006) · Physica D: Nonlinear Phenomena · doi:10.1016/j.physd.2006.09.009 · Cited by 116
“[6,13] have given a definition based on reachability.”
Backgroundk − core percolation on multiplex networks
Azimi-Tafreshi, N., Gómez‐Gardeñes, J., & Dorogovtsev, S. N. (2014) · Physical Review E · doi:10.1103/physreve.90.032816 · Cited by 149
Enhancing community detection using a network weighting strategy
Meo, P. D., Ferrara, E., Fiumara, G., & Provetti, A. (2012) · Information Sciences · doi:10.1016/j.ins.2012.08.001 · Cited by 122
“[44] who introduced CFinder; it detects communities by finding cliques of size k, where k is a parameter provided by the user.”
BackgroundOn Exploiting Transient Social Contact Patterns for Data Forwarding in Delay-Tolerant Networks
Gao, W., Cao, G., Porta, T. L., & Han, J. (2011) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2011.249 · Cited by 113
“1536-1233/13/$31.00 2013 IEEE Published by the IEEE CS, CASS, ComSoc, IES, & SPS a student A may contact his classmate B frequently in the daytime but not at night, while B’s roommate C contacts B frequently at night but not in the daytime.”
BackgroundInfluentialHigher-order clustering in networks
Yin, H., Benson, A. R., & Leskovec, J. (2018) · Physical review. E · doi:10.1103/physreve.97.052306 · Cited by 127
Community structure and ethnic preferences in school friendship networks
González, M. C., Herrmann, H. J., Kertész, J., & Vicsek, T. (2007) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2007.01.002 · Cited by 123
Self-citationAlgorithms and Applications for Community Detection in Weighted Networks
Lu, Z., Sun, X., Wen, Y., Cao, G., & Porta, T. L. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2014.2370031 · Cited by 112
Hidden community detection in social networks
He, K., Li, Y., Soundarajan, S., & Hopcroft, J. E. (2017) · Information Sciences · doi:10.1016/j.ins.2017.10.019 · Cited by 118
A Comparison of Community Detection Algorithms on Artificial Networks
Orman, G. K., & Labatut, V. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04747-3_20 · Cited by 105
“Authors traditionally test their community detection algorithms on a few real [311] or artificial [2-6, 10] networks.”
BackgroundFortunato, S., & Castellano, C. (2009) · Springer eBooks · doi:10.1007/978-0-387-30440-3_76 · Cited by 125
“It turns out that the distribution of community sizes is skewed, with a tail that obeys a power law with exponents in the range between 1 and 3 [13, 22, 23, 47].”
BackgroundMethodInfluentialBatch kernel SOM and related Laplacian methods for social network analysis
Boulet, R., Jouve, B., Rossi, F., & Vialaneix, N. (2008) · Neurocomputing · doi:10.1016/j.neucom.2007.12.026 · Cited by 116
“More recently, several directions have been explored to go further in modelling large real networks, taking into account their dynamics [47], the attributes of the data [35], a more formal definition of the communities [42,38,37], or the relations between communities [40].”
BackgroundBlanken, T. F., Deserno, M. K., Dalege, J., Borsboom, D., Blanken, P., Kerkhof, G. A., & Cramer, A. O. J. (2018) · Scientific Reports · doi:10.1038/s41598-018-24224-2 · Cited by 98
“…community detection algorithm that is particularly applicable to psychopathology is the Clique Percolation Method (CPM), as it allows nodes to belong to more than one community ( 18 applied to, for example, the human interactome, e.g. 19 social media, e.g. 20 and scientific publications, e.g. 21 ).”
BackgroundCollective synchronization induced by epidemic dynamics on complex networks with communities
Yan, G. F., Fu, Z., Ren, J., & Wang, W.-X. (2007) · Physical Review E · doi:10.1103/physreve.75.016108 · Cited by 111
Multistart Methods for Quantum Approximate optimization
Shaydulin, R., Safro, I., & Larson, J. (2019) · 2019 IEEE High Performance Extreme Computing Conference (HPEC) · doi:10.1109/hpec.2019.8916288 · Cited by 110
“and has a variety of applications in complex systems [21]–[25].”
BackgroundSocial-Aware Multicast in Disruption-Tolerant Networks
Gao, W., Li, Q., Zhao, B., & Cao, G. (2012) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2012.2183643 · Cited by 110
“[31], a -clique community is a union of all -cliques (complete subgraphs of size ) that can reach each other through a series of adjacent -cliques.”
BackgroundMethodShao, C., Li, M., Li, X., Wei, L., Zhu, L., Yang, F., Jia, L., Mu, Y., Wang, J., Guo, Z., et al. (2011) · Molecular & Cellular Proteomics · doi:10.1074/mcp.m111.010975 · Cited by 114
“Network Analysis—To cluster the human_core disease-disease network, the free software CFinder was used to first identify densely connected subgroups based on the weighted Clique Percolation Method (CPMw) (18, 19).”
MethodCommunity structure in the United States House of Representatives
Porter, M. A., Mucha, P. J., Newman, M. E. J., & Friend, A. J. (2007) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2007.07.039 · Cited by 129
A Complex-based Reconstruction of the Saccharomyces cerevisiae Interactome
Wang, H., Kakaradov, B., Collins, S. R., Karotki, L., Fiedler, D., Shales, M., Shokat, K. M., Walther, T. C., Krogan, N. J., & Koller, D. (2009) · Molecular & Cellular Proteomics · doi:10.1074/mcp.m800490-mcp200 · Cited by 117
“We note that there are other clustering algorithms (88, 89) that also generate overlapping complexes.”
BackgroundGenetic Variation Shapes Protein Networks Mainly through Non-transcriptional Mechanisms
Foss, E. J., Radulovic, D., Shaffer, S. A., Goodlett, D. R., Kruglyak, L., & Bedalov, A. (2011) · PLoS Biology · doi:10.1371/journal.pbio.1001144 · Cited by 104
“Communities were identified as previously described [23].”
MethodInfluentialGómez, D., Rodríguez, J. T., Yáñez, J., & Montero, J. (2016) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2016.03.003 · Cited by 108
“Again, the results given by this rank are consistent with (and extend) the solutions given by classical algorithms as CFINDER, CONGA or NFM .”
ResultInfluentialNewman, M. E. J. (2018) · Oxford University Press eBooks · doi:10.1093/oso/9780198805090.003.0006 · Cited by 112
Exploring Local Community Structures in Large Networks
Luo, F., Wang, J., & Promislow, E. (2006) · IEEE/WIC/ACM International Conference on Web Intelligence · doi:10.1109/wi.2006.72 · Cited by 106
Infinite Edge Partition Models for Overlapping Community Detection and Link PredictionPreprint
Zhou, M. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1501.06218 · Cited by 145
“The model describes both homophily and stochastic equivalence, and is scalable to big sparse networks by focusing its computation on pairs of linked nodes.”
BackgroundSurvey: Functional Module Detection from Protein-Protein Interaction Networks
Ji, J., Zhang, A., Liu, C., Quan, X., & Liu, Z. (2012) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2012.225 · Cited by 114
Model Selection and Hypothesis Testing for Large-Scale Network Models with Overlapping Groups
Peixoto, T. P. (2015) · Physical Review X · doi:10.1103/physrevx.5.011033 · Cited by 134
SHRINK: a structural clustering algorithm for detecting hierarchical communities in networks
Huang, J., Sun, H., Han, J., Deng, H., Sun, Y., & Liu, Y. (2010) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1871437.1871469 · Cited by 130
“Palla et al . proposed a clique percolation method (CPM) [21].”
MethodCommunity Detection based on Structural and Attribute Similarities
Viennet, E. (2012) · International Conference on the Digital Society · Cited by 145
Structural transition in social networks: The role of homophily
Murase, Y., Jo, H.-H., Török, J., Kertész, J., & Kaski, K. (2019) · Scientific Reports · doi:10.1038/s41598-019-40990-z · Cited by 107
Operations Research and Management Science Handbook
Ravindran, A. R. (2016) · CRC Press eBooks · doi:10.1201/9781420009712 · Cited by 107
Modularity optimization in community detection of complex networks
Zhang, X., Wang, R., Wang, Y., Wang, J., Qiu, Y., Wang, L., & Chen, L. (2009) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/87/38002 · Cited by 112
Detecting communities using asymptotical surprise
Traag, V., Aldecoa, R., & Delvenne, J. (2015) · Physical Review E · doi:10.1103/physreve.92.022816 · Cited by 115
Top Leaders Community Detection Approach in Information Networks
Khorasgani, R. R., Chen, J., & Zai͏̈ane, O. R. (2010) · Cited by 116
Social-Community-Aware Resource Allocation for D2D Communications Underlaying Cellular Networks
Wang, F., Li, Y., Wang, Z., & Yang, Z. (2015) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2015.2450774 · Cited by 106
“, the K-CLIQUE algorithm [26], is able to uncover overlapping communities, where one UE may belong to multiple communities.”
MethodThe low-rank hypothesis of complex systems
Thibeault, V., Allard, A., & Desrosiers, P. (2024) · Nature Physics · doi:10.1038/s41567-023-02303-0 · Cited by 148
“Interestingly, such overlapping is a very common characteristic of complex networks such as social networks 53 .”
A systematic approach to the one-mode projection of bipartite graphs
Zweig, K. A., & Kaufmann, M. (2011) · Social Network Analysis and Mining · doi:10.1007/s13278-011-0021-0 · Cited by 121
“An improved algorithm with runtime O(n log n) was given by Newson (2006) .”
BackgroundMethodFortunato, S., & Claudio Castellano, B. (2011) · Springer eBooks · doi:10.1007/springerreference_60248 · Cited by 105
Discovering and Profiling Overlapping Communities in Location-Based Social Networks
Wang, Z., Zhang, D., Zhou, X., Yang, D., Yu, Z., & Yu, Z. (2013) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2013.2256890 · Cited by 112
“A community is typically thought of as a group of users with more and/or better interactions amongst its members than between its members and the remainder of the network [1], [2].”
BackgroundCentrality measures for networks with community structure
Gupta, N., Singh, A. K., & Cherifi, H. (2016) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2016.01.066 · Cited by 114
“For example, it is well established that networks with a community structure are characterized by a power-law distributed community size [20, 21, 22, 23].”
BackgroundBerahmand, K., Mohammadi, M., Faroughi, A., & Mohammadiani, R. P. (2021) · Cluster Computing · doi:10.1007/s10586-021-03430-0 · Cited by 110
“…is ubiquitous in many natural systems and often contains abundant functional information of complex networks, such as the functions of proteins, the patterns of scientific collaboration, the word association in language evolutions, and the emergence of social polarization and echo-chambers [1–3].”
BackgroundTopology shapes dynamics of higher-order networks
Millán, A. P., Sun, H., Giambagli, L., Muolo, R., Carletti, T., Torres, J. J., Radicchi, F., Kurths, J., & Bianconi, G. (2025) · Nature Physics · doi:10.1038/s41567-024-02757-w · Cited by 169
Graph-based word clustering using a web search engine
Matsuo, Y., Sakaki, T., Uchiyama, K., & Ishizuka, M. (2006) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/1610075.1610150 · Cited by 115
“Recently, numerous works have identified communities (or densely-connected subgraphs) from large networks (Newman, 2004; Girvan and Newman, 2002; Palla et al., 2005) as explained in the next section.”
BackgroundThe Naming Game in social networks: community formation and consensus engineering
Lu, Q., Korniss, G., & Szymanski, B. K. (2009) · Journal of Economic Interaction and Coordination · doi:10.1007/s11403-009-0057-7 · Cited by 111
“Since the community structure of empirical networks is often not known a priori, detecting communities in large networks itself is a difficult problem (Palla et al, 2005).”
BackgroundMethodThe art of community detection
Gulbahce, N., & Lehmann, S. (2008) · BioEssays · doi:10.1002/bies.20820 · Cited by 114
“Since modules are sets of genes or proteins that perform biological processes together, it is possible to classify proteins with unknown function by determining what module they belong to.((26)) Correct identification of functional modules also has important biotechnological and drug design applications.”
SociaLite: Datalog extensions for efficient social network analysis
Seo, J., Guo, S. D., & Lam, M. S. (2013) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2013.6544832 · Cited by 104
“They are also used in the clique percolation algorithm for detecting communities [26].”
BackgroundMethodLatent Community Topic Analysis: Integration of Community Discovery with Topic Modeling
Yin, Z., Cao, L., Gu, Q., & Han, J. (2012) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2337542.2337548 · Cited by 118
Community-Enhanced De-anonymization of Online Social Networks
Nilizadeh, S., Kapadia, A. C., & Ahn, Y. (2014) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2660267.2660324 · Cited by 123
“Although it is known that communities often overlap [4, 40], we use disjoint, non-overlapping communities to simplify the problem.”
A large-scale community structure analysis in Facebook
Ferrara, E. (2012) · EPJ Data Science · doi:10.1140/epjds9 · Cited by 120
“Recently, the problem of discovering the community structure in a network including the possibility of finding overlapping nodes belonging to different communities at the same time, has acquired a lot of attention by the scientists because of the seminal paper presented by Palla et al. [71].”
BackgroundDirected clustering in weighted networks: A new perspective
Clemente, G. P., & Grassi, R. (2017) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2017.12.007 · Cited by 115
Synchronization Interfaces and Overlapping Communities in Complex Networks
Li, D., Leyva, I., Almendral, J. A., Sendiña–Nadal, I., Buldú, J. M., Havlin, S., & Boccaletti, S. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.168701 · Cited by 110
Triangle counting in large networks: a review
Hasan, M. A., & Dave, V. S. (2017) · Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery · doi:10.1002/widm.1226 · Cited by 103
“The obvious advantage of an enumeration-based method is that it returns the list of all the triangles, which can be used for downstream tasks such as community discovery 8 or spam fi ltering.”
BackgroundMethodOptimal partition and effective dynamics of complex networks
Weinan, E., Li, T., & Vanden‐Eijnden, E. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0707563105 · Cited by 102
Categorical structure among shared features in networks of early-learned nouns
Hills, T. T., Maouene, M., Maouene, J., Sheya, A., & Smith, L. B. (2009) · Cognition · doi:10.1016/j.cognition.2009.06.002 · Cited by 119
“What are these clusters and how coherent are they? To identify these, we used the clique percolation method described above (Palla et al., 2005).”
BackgroundMethodInfluentialCommunity Evolution Mining in Dynamic Social Networks
Takaffoli, M., Sangi, F., Fagnan, J., & Zai͏̈ane, O. R. (2011) · Procedia - Social and Behavioral Sciences · doi:10.1016/j.sbspro.2011.07.055 · Cited by 110
Cascade-based community detection
Barbieri, N., Bonchi, F., & Manco, G. (2013) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2433396.2433403 · Cited by 108
“Palla et al. [42] extend the method of clique percolation [41] to deal with directed networks by considering directed k-cliques, which are complete sub-graphs of size k in which an ordering can be made such that between any pair of nodes there is a directed link from the higher order node towards…”
MethodAlignment and integration of complex networks by hypergraph-based spectral clustering
Michoel, T., & Nachtergaele, B. (2012) · Physical Review E · doi:10.1103/physreve.86.056111 · Cited by 102
“[35] G Palla, I Derényi, I Farkas, and T Vicsek, “Uncovering the overlapping community structure of complex networks in nature and society,” Nature 435, 814–818 (2005).”
BackgroundBinary optimization by momentum annealing
Okuyama, T., Sonobe, T., Kawarabayashi, K., & Yamaoka, M. (2019) · Physical review. E · doi:10.1103/physreve.100.012111 · Cited by 118
Velden, T., Haque, A.-U., & Lagoze, C. (2010) · Scientometrics · doi:10.1007/s11192-010-0224-6 · Cited by 101
“Other algorithms have a very restrictive definition of clusters as very tight groupings of nodes, e.g. the concept of k-cliques in Palla et al. (2005), and therefore produce clusters with little variation of group internal structures.”
BackgroundA Tensor Spectral Approach to Learning Mixed Membership Community ModelsPreprint
Anandkumar, A., Ge, R., Hsu, D., & Kakade, S. M. (2013) · arXiv (Cornell University) · Cited by 114
A Non-negative Symmetric Encoder-Decoder Approach for Community Detection
Sun, B., Shen, H., Gao, J., Ouyang, R. W., & Cheng, X. (2017) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3132847.3132902 · Cited by 118
Competing spreading dynamics in simplicial complex
Wen-yao, L., Xue, X., Pan, L., Lin, T., & Wang, W. (2021) · Applied Mathematics and Computation · doi:10.1016/j.amc.2021.126595 · Cited by 101
Topological structural classes of complex networks
Estrada, E. (2007) · Physical Review E · doi:10.1103/physreve.75.016103 · Cited by 106
Spectral methods for the detection of network community structure: a comparative analysis
Shen, H., & Cheng, X. (2010) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2010/10/p10020 · Cited by 108
Detecting Communities in Social Networks using Max-Min Modularity
Chen, J., Zai͏̈ane, O. R., & Goebel, R. G. (2009) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972795.84 · Cited by 107
“Based on these observations, fuzzy methods [18, 26, 32, 46] and dynamic approaches [4, 38] have been proposed for overlapping structure and dynamic community detection.”
MethodPersistent Homology of Collaboration Networks
Carstens, C. J., & Horadam, K. J. (2013) · Mathematical Problems in Engineering · doi:10.1155/2013/815035 · Cited by 100
“A nice property of the clique complex is that cliques correspond to highly connected groups of nodes that may represent communities [2].”
BackgroundCommunity-based features for identifying spammers in online social networks
Bhat, S. Y., & Abulaish, M. (2013) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1145/2492517.2492567 · Cited by 99
“[6] which is based on the concept of a k-clique, i.”
BackgroundPolypharmacology-based ceritinib repurposing using integrated functional proteomics
Kuenzi, B. M., Rix, L. L. R., Stewart, P. A., Fang, B., Kinose, F., Bryant, A. T., Boyle, T. A., Koomen, J. M., Haura, E. B., & Rix, U. (2017) · Nature Chemical Biology · doi:10.1038/nchembio.2489 · Cited by 103
Knowledge gaps in the early growth of semantic feature networks
Sizemore, A. E., Karuza, E. A., Giusti, C., & Bassett, D. S. (2018) · Nature Human Behaviour · doi:10.1038/s41562-018-0422-4 · Cited by 115
Zhang, X., Li, X., Zhao, R., Zhou, Y., & Jiao, Y. (2020) · New Phytologist · doi:10.1111/nph.16445 · Cited by 119
Xue, L., Li, H., Xu, C., Zhao, X., Zheng, Z., Li, Y., & Liu, W. (2022) · Energy Strategy Reviews · doi:10.1016/j.esr.2022.100911 · Cited by 99
Selecting Information Diffusion Models over Social Networks for Behavioral Analysis
Saito, K., Kimura, M., Ohara, K., & Motoda, H. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15939-8_12 · Cited by 112
“The fourth one is a coauthorship network used in [17] and has 12, 357 nodes and 38, 896 directed links (the coauthorship network).”
BackgroundDetecting Protein Complexes Based on Uncertain Graph Model
Zhao, B., Wang, J., Li, M., Wu, F., & Pan, Y. F. (2014) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2013.2297915 · Cited by 105
“We apply our method and the existing competing algorithms to two yeast PPI networks.”
MethodCommunity detection in incomplete information networks
Lin, W., Kong, X., Yu, P. S., Wu, Q., Jia, Y., & Li, C. (2012) · International World Wide Web Conference (WWW) · doi:10.1145/2187836.2187883 · Cited by 102
“[20] proposed a clique percolation method, which can detect overlapped communities, but is not suitable for detecting hierarchical structures.”
MethodCentrality in modular networks
Ghalmane, Z., Hassouni, M. E., Cherifi, C., & Cherifi, H. (2019) · EPJ Data Science · doi:10.1140/epjds/s13688-019-0195-7 · Cited by 105
“Besides their various definitions, communities have been also found to show a number of interesting features such as the overlapping configuration of modules [9].”
BackgroundFinding Overlapping Communities Using Disjoint Community Detection Algorithms
Gregory, S. (2009) · Studies in computational intelligence · doi:10.1007/978-3-642-01206-8_5 · Cited by 108
“The “clique percolation” algorithm of Pall a, Derényi, Farkas, and Vicsek [1, 24, 35] (v1.”
BackgroundMethodInfluentialModularity, criticality, and evolvability of a developmental gene regulatory network
Verd, B., Monk, N., & Jaeger, J. (2019) · eLife · doi:10.7554/elife.42832 · Cited by 110
Detecting Communities Based on Network Topology
Liu, W., Pellegrini, M. A., & Wang, X. (2014) · Scientific Reports · doi:10.1038/srep05739 · Cited by 108
RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
Deijfen, M., & Kets, W. (2009) · Probability in the Engineering and Informational Sciences · doi:10.1017/s0269964809990064 · Cited by 97
“…is that human populations are typically divided into various subgroups – working places, schools, associations etc – which gives rise to high clustering in the social network, since members of a given group typically know each other; see Palla et al. (2005) for some empirical observations.”
BackgroundRecommendation in an Evolving Service Ecosystem Based on Network Prediction
Huang, K., Fan, Y., & Tan, W. (2014) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2013.2297026 · Cited by 97
Rabbany, R., ElAtia, S., Takaffoli, M., & Zai͏̈ane, O. R. (2013) · Studies in computational intelligence · doi:10.1007/978-3-319-02738-8_16 · Cited by 114
“Clique percolation [26], FastModularity [27] and Local [28]; refer to [29] for a recent survey.”
BackgroundMethodFrom Technological Networks to Social Networks
Chen, K., Chiang, M., & Poor, H. V. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.sup.0513049 · Cited by 103
“Techniques can be further developed to identify overlapping community structure [34].”
BackgroundInformation cartography: creating zoomable, large-scale maps of information
Shahaf, D., Yang, J., Suen, C., Jacobs, J., Wang, H., & Leskovec, J. (2013) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2487575.2487690 · Cited by 110
“A topic may be very complex, but the user’s attention span is still limited.”
BackgroundOverlapping Community Detection based on Network Decomposition
Ding, Z., Zhang, X., Sun, D., & Luo, B. (2016) · Scientific Reports · doi:10.1038/srep24115 · Cited by 110
Emergence of large cliques in random scale-free networks
Bianconi, G., & Marsili, M. (2006) · Europhysics Letters (EPL) · doi:10.1209/epl/i2005-10574-3 · Cited by 99
An overlapping community detection algorithm based on density peaks
Bai, X., Yang, P., & Shi, X. (2016) · Neurocomputing · doi:10.1016/j.neucom.2016.11.019 · Cited by 95
Olesen, J. M., Dupont, Y. L., O’Gorman, E. J., Ings, T. C., Layer, K., Melián, C. J., Trøjelsgaard, K., Pichler, D. E., Rasmussen, C., & Woodward, G. (2010) · Advances in ecological research/Advances in Ecological Research · doi:10.1016/b978-0-12-381363-3.00001-0 · Cited by 106
Friends in locked places: An investigation of prison inmate network structure
Schaefer, D. R., Bouchard, M., Young, J. T. N., & Kreager, D. A. (2017) · Social Networks · doi:10.1016/j.socnet.2016.12.006 · Cited by 104
Measuring Node Contribution to Community Structure With Modularity Vitality
Magelinski, T., Bartulovic, M., & Carley, K. M. (2021) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2020.3049068 · Cited by 99
Detection of core–periphery structure in networks using spectral methods and geodesic paths
Cucuringu, M., Rombach, P., Lee, S. H., & Porter, M. A. (2016) · European Journal of Applied Mathematics · doi:10.1017/s095679251600022x · Cited by 109
Using social network theory for modeling human mobility
Yang, S., Yang, X., Zhang, C., & Spyrou, E. D. (2010) · IEEE Network · doi:10.1109/mnet.2010.5578912 · Cited by 93
“Palla et al. [8] propose an algorithm to extract a k-clique overlapping community structure from social networks.”
BackgroundMethodInfluentialImmunization of networks with non-overlapping community structure
Ghalmane, Z., Hassouni, M. E., & Cherifi, H. (2019) · Social Network Analysis and Mining · doi:10.1007/s13278-019-0591-9 · Cited by 105
A hybrid group decision making framework for achieving agreed solutions based on stable opinions
Dong, Q., Zhou, X. Y., & Martínez, L. M. (2019) · Information Sciences · doi:10.1016/j.ins.2019.03.044 · Cited by 93
“A network with community structure can fit this kind of situations, where nodes are joined together in tightly knit parts(community, cohesive groups or modules), but between which there are only looser connections [29, 35].”
BackgroundMamet, S. D., Redlick, E., Brabant, M., Lamb, E. G., Helgason, B. L., Stanley, K. G., & Siciliano, S. D. (2019) · The ISME Journal · doi:10.1038/s41396-019-0407-y · Cited by 97
An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem
Uno, T. (2008) · Algorithmica · doi:10.1007/s00453-008-9238-3 · Cited by 93
“This is especially true in data engineering and data mining, where it is one of basic problems, and has many applications such as clustering, community discovering, machine learning, Web search, etc. [2, 8, 11–14, 18, 25].”
BackgroundModularity measure of networks with overlapping communities
Lázár, A. S., Ábel, D., & Vicsek, T. (2010) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/90/18001 · Cited by 93
Self-citationYou, Q., Xu, W., Zhang, K., Zhang, L., Yi, X., Yao, D., Wang, C., Zhang, X., Zhao, X., Provart, N. J., et al. (2016) · Nucleic Acids Research · doi:10.1093/nar/gkw910 · Cited by 111
“The Clique Percolation Method (32) was used to identify clusters or modules that contained more densely connected nodes to each other than to nodes outside the group in cotton co-expression networks.”
MethodDescription-Driven Community Detection
Pool, S., Bonchi, F., & van Leeuwen, M. (2014) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2517088 · Cited by 92
Baucon, A., Ronchi, A., Felletti, F., & de Carvalho, C. N. (2014) · Palaeogeography Palaeoclimatology Palaeoecology · doi:10.1016/j.palaeo.2014.05.034 · Cited by 92
Phan, H. T. T., & Sternberg, M. J. E. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts119 · Cited by 92
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.