Long-range percolation mixing time

Itai Benjamini, Noam Berger, Ariel Yadin

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


We provide an estimate, sharp up to poly-logarithmic factors, of the asymptotic almost sure mixing time of the graph created by long-range percolation on the cycle of length N (ℤ/Nℤ). While it is known that the asymptotic almost sure diameter drops from linear to poly-logarithmic as the exponent s decreases below 2 [4, 9], the asymptotic almost sure mixing time drops from N2 only to Ns-1 (up to poly-logarithmic factors).

Original languageEnglish
Pages (from-to)487-494
Number of pages8
JournalCombinatorics Probability and Computing
Issue number4
StatePublished - 1 Jul 2008
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Statistics and Probability
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Long-range percolation mixing time'. Together they form a unique fingerprint.

Cite this