Approximate sampling of graphs with near-\(P\)-stable degree intervals

DOI10.1007/s00026-023-00678-8arXiv2204.09493OpenAlexW4390044175MaRDI QIDQ6192073

Tamás Róbert Mezei, István Miklós, Péter L. Erdős

Publication date: 11 March 2024

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.09493

zbMATH Keywords

P-stabilityrealizationsswitch Markov chaindegree sequencesrapidly mixingSinclair's multi-commodity flow methodweak P-stability

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Fast uniform generation of regular graphs
• The mixing time of switch Markov chains: a unified approach
• Generating Random Networks and Graphs
• Approximating the Permanent
• Uniform sampling of bipartite graphs with degrees in prescribed intervals
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
• 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: Approximate sampling of graphs with near-\(P\)-stable degree intervals