The mixing time of the giant component of a random graph

We show that the total variation mixing time of the simple random walk on the giant component of supercritical G(n,p) and G(n,m) is Θ(log2n). This statement was proved, independently, by Fountoulakis and Reed. Our proof follows from a structure result for these graphs which is interesting in its own...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Random structures & algorithms 2014-10, Vol.45 (3), p.383-407
Hauptverfasser:	Benjamini, Itai, Kozma, Gady, Wormald, Nicholas
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Constants Decoration expander Expanders giant component Graphs mixing time Proving random graph Random walk Random walk theory Reeds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!