Corrigendum: Sampling regular graphs and a peer-to-peer network
Combinatorics
2012-03-29 v1
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 .
Keywords
Cite
@article{arxiv.1203.6111,
title = {Corrigendum: Sampling regular graphs and a peer-to-peer network},
author = {Colin Cooper and Martin Dyer and Catherine Greenhill},
journal= {arXiv preprint arXiv:1203.6111},
year = {2012}
}
Comments
8 pages, 7 figures