Subscribe

Berkeley, California

Oct. 21, 2006 to Oct. 24, 2006

ISBN: 0-7695-2720-5

pp: 69-76

Tomas Feder , Stanford University, USA

Adam Guetz , Stanford University, USA

Milena Mihail , Georgia Tech, USA

Amin Saberi , Stanford University, USA

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.2006.5

ABSTRACT

We study a switch Markov chain on regular graphs, where switches are allowed only between links that are at distance 2; we call this the Flip. The motivation for studying the Flip Markov chain arises in the context of unstructured peer-to-peer networks, which constantly perform such flips in an effort to randomize. <p>We show that the Flip Markov chain on regular graphs is rapidly mixing, thus justifying this widely used peer-topeer networking practice. Our mixing argument uses the Markov chain comparison technique. In particular, we extend this technique to embedding arguments where the compared Markov chains are defined on different state spaces. We give several conditions which generalize our results beyond regular graphs.</p>

INDEX TERMS

null

CITATION

Tomas Feder,
Adam Guetz,
Milena Mihail,
Amin Saberi,
"A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks",

*FOCS*, 2006, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 2006, pp. 69-76, doi:10.1109/FOCS.2006.5