Fast Sequential Creation of Random Realizations of Degree Sequences

DOI10.1080/15427951.2016.1164768zbMath1465.05157DBLPjournals/im/Cloteaux16OpenAlexW2312808162WikidataQ37148208 ScholiaQ37148208MaRDI QIDQ5856436

Brian D. Cloteaux

Publication date: 26 March 2021

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2016.1164768

zbMATH Keywords

MCMC methodsequential importance sampling schemes

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Vertex degrees (05C07)

Related Items (7)

Vertex-weighted graphs: realizable and unrealizable domains ⋮ On vertex-weighted realizations of acyclic and general graphs ⋮ Graph realizations: maximum degree in vertex neighborhoods ⋮ Unnamed Item ⋮ On vertex-weighted graph realizations ⋮ Vertex-weighted realizations of graphs ⋮ Relaxed and approximate graph realizations

Cites Work

• Unnamed Item
• Unnamed Item
• Longest chains in the lattice of integer partitions ordered by majorization
• Degree sequences and majorization
• Realizability and uniqueness in graphs
• Confirming two conjectures about the integer partitions
• The lattice of integer partitions
• A note on a theorem of Erdős and Gallai
• Threshold graphs and related topics
• Algorithms for constructing graphs and digraphs with given valences and factors
• A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
• Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs
• A Sequential Algorithm for Generating Random Graphs
• The switch Markov chain for sampling irregular graphs (Extended Abstract)
• Sampling Regular Graphs and a Peer-to-Peer Network

This page was built for publication: Fast Sequential Creation of Random Realizations of Degree Sequences