The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Characterizing the Community Structure of Complex Networks
Open accessAbstract
BACKGROUND: Community structure is one of the key properties of complex networks and plays a crucial role in their topology and function. While an impressive amount of work has been done on the issue of community detection, very little attention has been so far devoted to the investigation of communities in real networks. METHODOLOGY/PRINCIPAL FINDINGS: We present a systematic empirical analysis of the statistical properties of communities in large information, communication, technological, biological, and social networks. We find that the mesoscopic organization of networks of the same category is remarkably similar. This is reflected in several characteristics of community structure, which can be used as "fingerprints" of specific network categories. While community size distributions are always broad, certain categories of networks consist mainly of tree-like communities, while others have denser modules. Average path lengths within communities initially grow logarithmically with community size, but the growth saturates or slows down for communities larger than a characteristic size. This behaviour is related to the presence of hubs within communities, whose roles differ across categories. Also the community embeddedness of nodes, measured in terms of the fraction of links within their communities, has a characteristic distribution for each category. CONCLUSIONS/SIGNIFICANCE: Our findings, verified by the use of two fundamentally different community detection methods, allow for a classification of real networks and pave the way to a realistic modelling of networks' evolution.
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.
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
Statistical 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
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Community 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 3×
“This concept of community has been implemented to create classes of benchmark graphs with communities, such as those introduced by Girvan and Newman [11] and the graphs recently designed by Lancichinetti et al.”
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293 · cited 1×
“Another important feature of complex networks is represented by their mesoscopic structure, characterized by the presence of groups of nodes, called communities or modules, with a high density of links between nodes of the same group and a comparatively low density of links between nodes of different groups [11–14].”
Self-citationComplex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Finding community structure in very large networks
Clauset, A., Newman, M. E. J., & Moore, C. (2004) · Physical Review E · doi:10.1103/physreve.70.066111 · Cited by 7,390
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
Epidemic Spreading in Scale-Free Networks
Pastor-Satorras, R., & Vespignani, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3200 · Cited by 5,731
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
Uncovering the overlapping community structure of complex networks in nature and society
Palla, G., Derényi, I., Farkas, I., & Vicsek, T. (2005) · Nature · doi:10.1038/nature03607 · Cited by 5,373
Maps of random walks on complex networks reveal community structure
Rosvall, M., & Bergstrom, C. T. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0706851105 · Cited by 4,583
The Architecture of Complexity
Simon, H. A. (1991) · Facets of Systems Science · doi:10.1007/978-1-4899-0718-9_31 · Cited by 4,433
Functional cartography of complex metabolic networks
Guimerà, R., & Nunes Amaral, L. A. (2005) · Nature · doi:10.1038/nature03288 · Cited by 3,983
Bollobás, B. (1998) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-0619-4 · Cited by 3,772
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
Benchmark graphs for testing community detection algorithms
Lancichinetti, A., Fortunato, S., & Radicchi, F. (2008) · Physical Review E · doi:10.1103/physreve.78.046110 · Cited by 3,051
Self-citationDynamical Processes on Complex Networks
Barrat, A., Barthélemy, M., & Vespignani, A. (2008) · doi:10.1017/cbo9780511791383 · Cited by 2,704 · cited 1×
“While an impressive amount of work has been done on the issue of community detection, very little attention has been so far devoted to the investigation of communities in real networks.”
Barabási, A.-L., & Bonabeau, E. (2003) · Scientific American · doi:10.1038/scientificamerican0503-60 · Cited by 2,494
Defining 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×
“This is in agreement with earlier studies [12,16–19].”
Resilience of the Internet to Random Breakdowns
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4626 · Cited by 2,391
Community detection algorithms: A comparative analysis
Lancichinetti, A., & Fortunato, S. (2009) · Physical Review E · doi:10.1103/physreve.80.056117 · Cited by 2,177
Self-citationDetecting community structure in networks
Newman, M. E. J. (2004) · The European Physical Journal B - Condensed Matter · doi:10.1140/epjb/e2004-00124-y · Cited by 2,028
Detecting the overlapping and hierarchical community structure in complex networks
Lancichinetti, A., Fortunato, S., & Kertész, J. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/3/033015 · Cited by 1,941
Self-citationThe Architecture of Complexity
Simon, H. A. (2012) · The Roots of Logistics · doi:10.1007/978-3-642-27922-5_23 · Cited by 1,315
Evolution and Structure of the Internet: A Statistical Physics Approach
Pastor-Satorras, R., & Vespignani, A. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511610905 · Cited by 1,310
The average distances in random graphs with given expected degrees
Chung, F., & Lu, L. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.252631999 · Cited by 885
Scale-Free Networks: Complex Webs in Nature and Technology
Caldarelli, G. (2007) · doi:10.1093/acprof:oso/9780199211517.001.0001 · Cited by 748
Microscopic evolution of social networks
Leskovec, J., Backstrom, L., Kumar, R., & Tomkins, A. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401948 · Cited by 728
Line graphs, link partitions, and overlapping communities
Evans, T. S., & Lambiotte, R. (2009) · Physical Review E · doi:10.1103/physreve.80.016105 · Cited by 615
Identification of overlapping community structure in complex networks using fuzzy -means clustering
Zhang, S., Wang, R.-S., & Zhang, X.-S. (2007) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.07.023 · Cited by 530
Algorithms for graph partitioning on the planted partition model
Condon, A., & Karp, R. M. (2001) · Random Structures and Algorithms · doi:10.1002/1098-2418(200103)18:2<116::aid-rsa1001>3.0.co;2-2 · Cited by 429
Evolution and Structure of the Internet: A Statistical Physics Approach
(2005) · Journal of Documentation · doi:10.1108/00220410510598571 · Cited by 423
An Algorithm to Find Overlapping Community Structure in Networks
Gregory, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74976-9_12 · Cited by 302
Towards real-time community detection in large networks
Leung, I. X. Y., Hui, P., Liò, P., & Crowcroft, J. (2009) · Physical Review E · doi:10.1103/physreve.79.066107 · Cited by 289
Caldarelli, G., & Vespignani, A. (2007) · Complex Systems and Interdisciplinary Science · doi:10.1142/6455 · Cited by 252
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
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
Community Structure Identification
Danon, L., Duch, J., Arenas, À., & Dı́az-Guilera, A. (2007) · Complex systems and interdisciplinary science · doi:10.1142/9789812771681_0006 · Cited by 35
Cited by
Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014) · Journal of Complex Networks · doi:10.1093/comnet/cnu016 · Cited by 3,235
Community detection in networks: a user guide
Fortunato, S., & Hric, D. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.09.002 · Cited by 2,086
Self-citationFinding Statistically Significant Communities in Networks
Lancichinetti, A., Radicchi, F., Ramasco, J. J., & Fortunato, S. (2011) · PLoS ONE · doi:10.1371/journal.pone.0018961 · Cited by 1,187
Self-citationA Comparative Analysis of Community Detection Algorithms on Artificial Networks
Yang, Z., Algesheimer, R., & Tessone, C. J. (2016) · Zurich Open Repository and Archive (University of Zurich) · doi:10.5167/uzh-127494 · Cited by 685
Small but slow world: How network topology and burstiness slow down spreading
Karsai, M., Kivelä, M., Pan, R. K., Kaski, K., Kertész, J., Barabási, A.-L., & Saramäki, J. (2011) · Physical Review E · doi:10.1103/physreve.83.025102 · Cited by 668
Self-citation
Metadata
- Authors
- Lancichinetti, A., Kivelä, M., Saramäki, J., & Fortunato, S.
- Venue
- PLoS ONE
- Publisher
- Public Library of Science (PLoS)
- Published
- 2010-08-12
- Volume
- 5
- Issue
- 8
- Pages
- e11976
- ISSN
- 1932-6203 (ISSN-L)
- OpenAlex
- W2029130073
- Cited by
- 267
- References
- 40
- FWCI
- 16.63
- Type
- journal article
- Language
- en
- Open access
- gold
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.