Short cycle distribution in random regular graphs recursively generated by pegging

DOI10.1002/rsa.20253zbMath1193.05146OpenAlexW3083259271MaRDI QIDQ3608313

Pu Gao, Nicholas C. Wormald

Publication date: 4 March 2009

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20253

zbMATH Keywords

couplingrandom graph processpeggingshort cycle distribution

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Discrete-time Markov processes on general state spaces (60J05) Combinatorial probability (60C05) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Connectivity of random regular graphs generated by the pegging algorithm ⋮ Pegging Graphs Yields a Small Diameter

Cites Work

• Unnamed Item
• Unnamed Item
• The asymptotic distribution of short cycles in random regular graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Uniform generation of random regular graphs of moderate degree
• Random Graph Processes with Degree Restrictions
• Random graphs generated by the Star 2-Process
• Random Star Processes

This page was built for publication: Short cycle distribution in random regular graphs recursively generated by pegging