Long Range Percolation Mixing Time

Simple item page
dc.creatorBenjamini, Itai
dc.creatorBerger, Noam
dc.creatorYadin, Ariel
dc.date2007-03-29
dc.date2009-04-19
dc.date.accessioned2026-07-07T13:05:23Z
dc.date.available2026-07-07T13:05:23Z
dc.descriptionWe 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).
dc.descriptionProof of Proposition 2.1 corrected
dc.identifierhttps://arxiv.org/abs/math/0703872
dc.identifierhttp://arxiv.org/abs/math/0703872
dc.identifierCombinatorics, Probability and Computing 17 (2008), 487-494
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/227473
dc.subjectProbability
dc.subjectMathematical Physics
dc.subjectCombinatorics
dc.titleLong Range Percolation Mixing Time
dc.typetext

Files

Collections

arXiv