The mixing time of the giant component of a random graph

Abstract

We show that the total variation mixing time of the simple random walk on the giant component of supercritical Erdos-Renyi graphs is log^2 n. This statement was only recently proved, independently, by Fountoulakis and Reed. Our proof follows from a structure result for these graphs which is interesting in its own right. We show that these graphs are "decorated expanders" - an expander glued to graphs whose size has constant expectation and exponential tail, and such that each vertex in the expander is glued to no more than a constant number of decorations.

21 pages. New version fixes a small mistake in the proof of Theorem 2.3 discovered by Johannes Blank

Cited by in corpus (8)

• Critical random graphs: Diameter and mixing time
• Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Mixing times for the interchange process
• Content replication and placement in mobile networks
• Universality of trap models in the ergodic time scale
• Long Range Percolation Mixing Time
• Expansion properties of a random regular graph after random vertex deletions