Triadic closure in configuration models with unbounded degree fluctuations

DOI10.1007/s10955-018-1952-xzbMath1475.05157arXiv1710.02027OpenAlexW2761107277WikidataQ92730037 ScholiaQ92730037MaRDI QIDQ1756538

Johan S. H. van Leeuwaarden, Remco van der Hofstad, Clara Stegehuis

Publication date: 21 December 2018

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.02027

zbMATH Keywords

clusteringrandom graphsconfiguration model

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Stochastic integrals (60H05)

Related Items (4)

Scale-free network clustering in hyperbolic and other random graphs ⋮ Threshold functions for small subgraphs in simple graphs and multigraphs ⋮ Counting triangles in power-law uniform random graphs ⋮ Limit theorems for assortativity and clustering in null models for scale-free networks

Uses Software

• SNAP

Cites Work

• Unnamed Item
• Unnamed Item
• Generating simple random graphs with prescribed degree distribution
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Mesoscopic scales in hierarchical configuration models
• Random Graphs and Complex Networks
• Upper Bounds for Number of Removed Edges in the Erased Configuration Model
• The average distances in random graphs with given expected degrees
• Local Clustering Coefficient in Generalized Preferential Attachment Models
• Networks

This page was built for publication: Triadic closure in configuration models with unbounded degree fluctuations