The switch Markov chain for sampling irregular graphs (Extended Abstract)

DOI10.1137/1.9781611973730.103zbMath1371.60126OpenAlexW4236051973MaRDI QIDQ5363053

Catherine Greenhill

Publication date: 5 October 2017

Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973730.103

Mathematics Subject Classification ID

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

Related Items (18)

Mixing times of random walks on dynamic configuration models ⋮ Moments of Uniform Random Multigraphs with Fixed Degree Sequences ⋮ Fast uniform generation of random graphs with given degree sequences ⋮ Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs ⋮ Unnamed Item ⋮ Improved baselines for causal structure learning on interventional data ⋮ Approximate sampling of graphs with near-\(P\)-stable degree intervals ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The switch Markov chain for sampling irregular graphs and digraphs ⋮ Network-Ensemble Comparisons with Stochastic Rewiring and Von Neumann Entropy ⋮ A survey of discrete methods in (algebraic) statistics for networks ⋮ The mixing time of switch Markov chains: a unified approach ⋮ Configuring Random Graph Models with Fixed Degree Sequences ⋮ New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling ⋮ How to determine if a random graph with a fixed degree sequence has a giant component ⋮ Uniform Generation of Random Regular Graphs ⋮ Fast Sequential Creation of Random Realizations of Degree Sequences

This page was built for publication: The switch Markov chain for sampling irregular graphs (Extended Abstract)