EUVIMEDSkopri EUVIMED
Open access · CC BY 4.0

Strongly Clustered Random Graphs via Triadic Closure: Degree Correlations and Clustering Spectrum

Lorenzo Cirigliano, Gareth J. Baxter, Gábor Timár

Complexities · 2026-05-22 · 2 (2) · 13

DOI: 10.3390/complexities2020013 ↗

At a glance

Journal article in Complexities, published online on 2026-05-22. Written by Lorenzo Cirigliano and 2 co-authors. 32 references. The full text is freely available (open access, CC BY 4.0). Funded by: Fundação para a Ciência e Tecnologia, Leverhulme Trust, Ministero dell'università e della ricerca.

AstrattDettalji biblijografiċiCiteRelated studies

Abstract (original language)

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.

Funding

  • Fundação para a Ciência e Tecnologia
  • Leverhulme Trust
  • Ministero dell'università e della ricerca

Cite

APA

Cirigliano, L., Baxter, G. J., & Timár, G. (2026). Strongly Clustered Random Graphs via Triadic Closure: Degree Correlations and Clustering Spectrum. Complexities, 2(2), 13. https://doi.org/10.3390/complexities2020013

Vancouver

Cirigliano L, Baxter GJ, Timár G. Strongly Clustered Random Graphs via Triadic Closure: Degree Correlations and Clustering Spectrum. Complexities. 2026;2(2):13. doi:10.3390/complexities2020013

BibTeX
@article{Cirigliano2026,
  author = {Cirigliano, Lorenzo and Baxter, Gareth J. and Timár, Gábor},
  title = {Strongly Clustered Random Graphs via Triadic Closure: Degree Correlations and Clustering Spectrum},
  journal = {Complexities},
  year = {2026},
  volume = {2},
  number = {2},
  pages = {13},
  doi = {10.3390/complexities2020013}
}
Start for free →