Counting triangles in power-law uniform random graphs

DOI10.37236/9239zbMath1445.05094arXiv1812.04289OpenAlexW3082642148MaRDI QIDQ785565

Remco van der Hofstad, Angus Southwell, Pu Gao, Clara Stegehuis

Publication date: 7 August 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

asymptotic number of triangles in uniform random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30)

Related Items

The Threshold of Symmetry in Random Graphs with Specified Degree Sequences, Optimal subgraph structures in scale-free configuration models, Limit theorems for assortativity and clustering in null models for scale-free networks, Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating simple random graphs with prescribed degree distribution
• The asymptotic distribution of short cycles in random regular graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Triadic closure in configuration models with unbounded degree fluctuations
• Short cycles in random regular graphs
• Asymptotic enumeration by degree sequence of graphs of high degree
• An old approach to the giant component problem
• Random Graphs and Complex Networks
• Why do simple algorithms for triangle enumeration work in the real world?
• The Probability That a Random Multigraph is Simple
• A critical point for random graphs with a given degree sequence
• The probability that a random multigraph is simple. II
• Distances in random graphs with finite variance degrees
• The average distances in random graphs with given expected degrees