The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Triadic closure as a basic generating mechanism of communities in complex networks
Open accessAbstract
Most of the complex social, technological, and biological networks have a significant community structure. Therefore the community structure of complex networks has to be considered as a universal property, together with the much explored small-world and scale-free properties of these networks. Despite the large interest in characterizing the community structures of real networks, not enough attention has been devoted to the detection of universal mechanisms able to spontaneously generate networks with communities. Triadic closure is a natural mechanism to make new connections, especially in social networks. Here we show that models of network growth based on simple triadic closure naturally lead to the emergence of community structure, together with fat-tailed distributions of node degree and high clustering coefficients. Communities emerge from the initial stochastic heterogeneity in the concentration of links, followed by a cycle of growth and fragmentation. Communities are the more pronounced, the sparser the graph, and disappear for high values of link density and randomness in the attachment procedure. By introducing a fitness-based link attractivity for the nodes, we find a phase transition where communities disappear for high heterogeneity of the fitness distribution, but a different mesoscopic organization of the nodes emerges, with groups of nodes being shared between just a few superhubs, which attract most of the links of the system.
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
Granovetter, M. S. (1973) · American Journal of Sociology · doi:10.1086/225469 · Cited by 40,491
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Fast unfolding of communities in large networks
Blondel, V. D., Guillaume, J.-L., Lambiotte, R., & Lefebvre, E. (2008) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2008/10/p10008 · Cited by 21,424
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
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
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Self-citationError and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
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
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
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Resolution limit in community detection
Fortunato, S., & Barthélemy, M. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0605965104 · Cited by 3,024
Self-citationHolme, P., & Saramäki, J. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.03.001 · Cited by 2,736
Dynamical Processes on Complex Networks
Barrat, A., Barthélemy, M., & Vespignani, A. (2008) · doi:10.1017/cbo9780511791383 · Cited by 2,704 · cited 2×
“…as a basic generating mechanism of the structure of complex networks Ginestra Bianconi,1 Richard K. Darst,2 Jacopo Iacovacci,1 and Santo Fortunato2 1School of Mathematical Sicences, Queen Mary University of London, London, UK 2Department of Biomedical Engineering and Computational…”
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
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Why social networks are different from other types of networks
Newman, M. E. J., & Park, J. (2003) · Physical Review E · doi:10.1103/physreve.68.036122 · Cited by 1,354
Growing scale-free networks with tunable clustering
Holme, P., & Kim, B. J. (2002) · Physical Review E · doi:10.1103/physreve.65.026107 · Cited by 1,088
Bose-Einstein Condensation in Complex Networks
Bianconi, G., & Barabási, A.-L. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5632 · Cited by 808
Self-citationMeeting Strangers and Friends of Friends: How Random Are Social Networks?
Jackson, M. O., & Rogers, B. W. (2007) · American Economic Review · doi:10.1257/aer.97.3.890 · Cited by 633
Vázquez, A. (2003) · Physical Review E · doi:10.1103/physreve.67.056104 · Cited by 563
Properties of highly clustered networks
Newman, M. E. J. (2003) · Physical Review E · doi:10.1103/physreve.68.026121 · Cited by 493
Spread of information through a population with socio-structural bias: I. Assumption of transitivity
Rapoport, A. (1953) · The Bulletin of Mathematical Biophysics · doi:10.1007/bf02476440 · Cited by 404
A MODEL OF LARGE-SCALE PROTEOME EVOLUTION
SOLÉ, R. V., PASTOR-SATORRAS, R., SMITH, E., & KEPLER, T. B. (2002) · Advances in Complex Systems · doi:10.1142/s021952590200047x · Cited by 330
Emergence of a Small World from Local Interactions: Modeling Acquaintance Networks
Davidsen, J., Ebel, H., & Bornholdt, S. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.128701 · Cited by 309
Characterizing the Community Structure of Complex Networks
Lancichinetti, A., Kivelä, M., Saramäki, J., & Fortunato, S. (2010) · PLoS ONE · doi:10.1371/journal.pone.0011976 · Cited by 267
Self-citationEmergence of Communities in Weighted Networks
Kumpula, J. M., Onnela, J.-P., Saramäki, J., Kaski, K., & Kertész, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.228701 · Cited by 222
Toivonen, R., Onnela, J.-P., Saramäki, J., Hyvönen, J., & Kaski, K. (2006) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.03.050 · Cited by 218
Duplication-divergence model of protein interaction network
Ispolatov, I., Krapivsky, P. L., & Yuryev, A. (2005) · Physical Review E · doi:10.1103/physreve.71.061911 · Cited by 179
Krapivsky, P. L., & Redner, S. (2005) · Physical Review E · doi:10.1103/physreve.71.036118 · Cited by 175
The rise and fall of a networked society: A formal model
Marsili, M., Vega-Redondo, F., & Slanina, F. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0305684101 · Cited by 172
Triadic closure dynamics drives scaling laws in social multiplex networks
Klimek, P., & Stefan Thurner, A. (2013) · New Journal of Physics · doi:10.1088/1367-2630/15/6/063008 · Cited by 98
Clustering drives assortativity and community structure in ensembles of networks
Foster, D., Foster, J. G., Grassberger, P., & Paczuski, M. (2011) · Physical Review E · doi:10.1103/physreve.84.066117 · Cited by 81
Multilevel Local Optimization of Modularity
Aynaud, T., Blondel, V. D., Guillaume, J., & Lambiotte, R. (2013) · Wiley eBooks · doi:10.1002/9781118601181.ch13 · Cited by 30
Cited by
Networks beyond pairwise interactions: Structure and dynamics
Battiston, F., Cencetti, G., Iacopini, I., Latora, V., Lucas, M., Patania, A., Young, J.-G., & Petri, G. (2020) · Physics Reports · doi:10.1016/j.physrep.2020.05.004 · Cited by 1,602
The physics of higher-order interactions in complex systems
Battiston, F., Amico, E., Barrat, A., Bianconi, G., Ferraz de Arruda, G., Franceschiello, B., Iacopini, I., Kéfi, S., Latora, V., Moreno, Y., et al. (2021) · Nature Physics · doi:10.1038/s41567-021-01371-4 · Cited by 932
Self-citationMultilayer Networks: Structure and Function
Bianconi, G. (2018) · doi:10.1093/oso/9780198753919.001.0001 · Cited by 334
Self-citationBianconi, G. (2021) · doi:10.1017/9781108770996 · Cited by 223
Self-citationEmergent Complex Network Geometry
Wu, Z., Menichetti, G., Rahmede, C., & Bianconi, G. (2015) · Scientific Reports · doi:10.1038/srep10073 · Cited by 98
Metadata
- Authors
- Bianconi, G., Darst, R. K., Iacovacci, J., & Fortunato, S.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2014-10-10
- Volume
- 90
- Issue
- 4
- Pages
- 042806-042806
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2074990030
- Cited by
- 268
- References
- 36
- FWCI
- 10.11
- Type
- journal article
- Language
- en
- Open access
- green
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.