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

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

2012-03-27

arxiv.org/abs/1203.6111v1

Mathematics

Combinatorics

8 pages, 7 figures

Scientific paper

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 .

Affiliated with

Also associated with

No associations

Rating

Corrigendum: Sampling regular graphs and a peer-to-peer network does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Corrigendum: Sampling regular graphs and a peer-to-peer network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Corrigendum: Sampling regular graphs and a peer-to-peer network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-271334