Fully graphic degree sequences and P-stable degree sequences

DOI10.1016/J.AAM.2024.102805MaRDI QIDQ6655400

István Miklós, Lajos Soukup, Péter L. Erdős

Publication date: 23 December 2024

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

switch Markov chain\(P\)-stable degree sequencesfully graphic degree sequencessimple degree sequence region

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Enumerative combinatorics (05A99) Vertex degrees (05C07)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On realization graphs of degree sequences
• Fast uniform generation of regular graphs
• The splittance of a graph
• Contributions to the theory of graphic sequences
• Decomposition of graphical sequences and unigraphs
• The switch Markov chain for sampling irregular graphs and digraphs
• A note on a theorem of Erdős and Gallai
• Half-graphs, other non-stable degree sequences, and the switch Markov chain
• The mixing time of switch Markov chains: a unified approach
• A sharp refinement of a result of Zverovich-Zverovich
• Mixing time of the switch Markov chain and stable degree sequences
• Approximating the Permanent
• New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling

This page was built for publication: Fully graphic degree sequences and P-stable degree sequences

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