Long Range Percolation Mixing Time

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We provide an estimate, sharp up to poly-logarithmic factors, of the asymptotically almost sure mixing time of the graph created by long-range percolation on the cycle of length N (Z/NZ). While it is known that the almost sure diameter drops from linear to poly-logarithmic as the exponent s decreases below 2, the almost sure mixing time drops from N^2 only to N^(s-1) (up to poly-logarithmic factors).
Proof of Proposition 2.1 corrected

Keywords

Probability, Mathematical Physics, Combinatorics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/227473

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0703872
 http://arxiv.org/abs/math/0703872
 Combinatorics, Probability and Computing 17 (2008), 487-494

Collections

arXiv