Uniform generation of temporal graphs with given degrees

DOI10.1007/978-3-031-53499-7_33MaRDI QIDQ6621468zbMATH OpenFDO

Authors Daniel Allendorf

Publication date 18 October 2024

Full work available at URL https://doi.org/10.1007/978-3-031-53499-7_33

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• A sequential importance sampling algorithm for generating random graphs with prescribed degrees
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Connected components in random graphs with given expected degree sequences
• Fast uniform generation of random graphs with given degree sequences
• Fast uniform generation of regular graphs
• Generating graphs randomly
• Generating random regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• The mixing time of switch Markov chains: a unified approach
• Uniform generation of random graphs with power-law degree sequences
• Uniform generation of random regular graphs
• Uniform generation of random regular graphs of moderate degree

This page was built for publication: Uniform generation of temporal graphs with given degrees

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