The mixing time of the giant component of a random graph

Details The mixing time of the giant component of a random graph The mixing time of the giant component of a random graph

2006-10-15

arxiv.org/abs/math/0610459v1

Mathematics

Probability

21 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The mixing time of the giant component of a random graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The mixing time of the giant component of a random graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The mixing time of the giant component of a random graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-244802