Short cycle distribution in random regular graphs recursively generated by pegging

DOI10.1002/RSA.20253zbMATH Open1193.05146OpenAlexW3083259271MaRDI QIDQ3608313FDOQ3608313

Authors: Pu Gao, Nicholas 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

Recommendations

• Rate of convergence of the short cycle distribution in random regular graphs generated by pegging
• Connectivity of random regular graphs generated by the pegging algorithm
• Short cycles in random regular graphs
• Pegging graphs yields a small diameter
• Generating Random Regular Graphs Quickly

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)

Cites Work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Title not available (Why is that?)
• Uniform generation of random regular graphs of moderate degree
• Random Graph Processes with Degree Restrictions
• The asymptotic distribution of short cycles in random regular graphs
• Sampling regular graphs and a peer-to-peer network
• Random Star Processes
• Random graphs generated by the Star 2-Process

Cited In (3)

• Connectivity of random regular graphs generated by the pegging algorithm
• Rate of convergence of the short cycle distribution in random regular graphs generated by pegging
• Pegging graphs yields a small diameter

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608313)