The mixing time of the giant component of a random graph
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 and is . 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 right. We …