Mathematics – Probability
Scientific paper
2007-03-29
Combinatorics, Probability and Computing 17 (2008), 487-494
Mathematics
Probability
Proof of Proposition 2.1 corrected
Scientific paper
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).
Benjamini Itai
Berger Noam
Yadin Ariel
No associations
LandOfFree
Long Range Percolation Mixing Time 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 Long Range Percolation Mixing Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Long Range Percolation Mixing Time will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-711255