A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs
From MaRDI portal
Publication:665755
zbMath1243.05095arXiv1105.0457MaRDI QIDQ665755
Publication date: 6 March 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1105.0457
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Directed graphs (digraphs), tournaments (05C20)
Related Items
Moments of Uniform Random Multigraphs with Fixed Degree Sequences, Half-regular factorizations of the complete bipartite graph, Mixing time of the switch Markov chain and stable degree sequences, Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs, Unnamed Item, Unnamed Item, The switch Markov chain for sampling irregular graphs and digraphs, The mixing time of switch Markov chains: a unified approach, Configuring Random Graph Models with Fixed Degree Sequences, Half-graphs, other non-stable degree sequences, and the switch Markov chain