Corrigendum: Sampling regular graphs and a peer-to-peer network

Abstract

In [Combinatorics, Probability and Computing 16 (2007), 557 - 593, Theorem 1] we proved a polynomial-time bound on the mixing rate of the switch chain for sampling d-regular graphs. This corrigendum corrects a technical error in the proof. In order to fix the error, we must multiply the bound on the mixing time by a factor of d^8 .

8 pages, 7 figures

Cited by in corpus (6)

• The switch Markov chain for sampling irregular graphs
• Smaller Universes for Uniform Sampling of 0,1-matrices with fixed row and column sums
• Uniform generation of random regular graphs
• The Connection between the Number of Realizations for Degree Sequences and Majorization
• Making Markov chains less lazy
• Uniform generation of spanning regular subgraphs of a dense graph