Strongly Clustered Random Graphs via Triadic Closure: Degree Correlations and Clustering Spectrum
Open Access
- 22 May 2026
- journal article
- research article
- Published by MDPI AG in Complexities
- Vol. 2 (2) , 13
Abstract
Real-world networks often exhibit strong transitivity with nontrivial local clustering spectra and degree correlations. Such features are not easily modeled in tractable network models, creating an obstacle to the theoretical understanding of such complex network structures. Here, we address this problem using a model for strongly clustered random graphs in which each triad of a random network backbone is closed with a certain probability. Despite the intricate loopy local structure of the graphs obtained, we provide exact expressions for the local clustering spectrum and the degree correlations, filling the gap in the theoretical description of this model for random graphs. In particular, we find positive degree assortativity accompanying high transitivity, and nontrivial structure in the clustering spectrum. Exact asymptotic analytical results, obtained for uncorrelated locally tree-like backbones, are complemented with extensive numerical characterization of finite-size effects.Keywords
All Related Versions
Funding Information
- Fundação para a Ciência e Tecnologia (UIDB/50025/2020)
- Fundação para a Ciência e Tecnologia (UIDP/50025/2020)
- Leverhulme Trust (RPG-2023-187)
- Ministero dell'Università e della Ricerca (PNRR MUR PE 0000023-NQSTI)
This publication has 29 references indexed in Scilit:
- Strongly clustered random graphs via triadic closure: An exactly solvable modelPhysical Review E, 2024
- Random graphs with arbitrary clustering and their applicationsPhysical Review E, 2021
- Transitivity and degree assortativity explained: The bipartite structure of social networksPhysical Review E, 2020
- Triadic Closure in Configuration Models with Unbounded Degree FluctuationsJournal of Statistical Physics, 2018
- Complex Networks2017
- Clustering coefficients of large networksInformation Sciences, 2017
- A model for social networksPhysica A: Statistical Mechanics and its Applications, 2006
- Hierarchical organization in complex networksPhysical Review E, 2003
- Large-scale topological and dynamical properties of the InternetPhysical Review E, 2002
- Growing scale-free networks with tunable clusteringPhysical Review E, 2002