A linear-time algorithm for sampling graphs with given degrees

MaRDI QIDQ2789573zbMATH OpenFDO

Authors James Y. Zhao

Publication date 1 March 2016

Full work available at URL https://hal.inria.fr/hal-01077251v2/document

zbMATH Keywords

perfect matchinguniform samplingMarkov chain couplinggraphs with given degrees

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40)

Recommendations

• Fast uniform generation of random graphs with given degree sequences
• Uniform generation of random regular graphs
• A sequential algorithm for generating random graphs
• A Sequential Algorithm for Generating Random Graphs
• Fast uniform generation of regular graphs

Cited in

(8)

• Sampling to provide or to bound: With applications to fully dynamic graph algorithms
• Exact sampling of graphs with prescribed degree correlations
• On the Complexity of Sampling Vertices Uniformly from a Graph
• Uniform random sampling of planar graphs in linear time
• Constructing and sampling directed graphs with given degree sequences
• Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs
• Randomly Sampling Molecules
• Sampling hypergraphs with given degrees

This page was built for publication: A linear-time algorithm for sampling graphs with given degrees

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