Long-Range Percolation Mixing Time
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 ($\Integer/N\Integer$). While it is known that the asymptotic almost sure diameter drops from linear to poly-logarithmic as...
Gespeichert in:
| Veröffentlicht in: | Combinatorics, probability & computing probability & computing, 2008-07, Vol.17 (4), p.487-494 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!