The evolution of the mixing rate of a simple random walk on the giant component of a random graph
Research output: Contribution to journal › Article
Colleges, School and Institutes
In this article we present a study of the mixing time of a random walk on the largest component of a supercritical random graph, also known as the giant component. We identify local obstructions that slow down the random walk, when the average degree d is at most O(root ln n), proving that the mixing time in this case is Theta((ln n/d)(2)) asymptotically almost surely. As the average degree grows these become negligible and it is the diameter of the largest component that takes over, yielding mixing time Theta(ln n/ ln d) a.a.s.. We proved these results during the 2003-04 academic year. Similar results but for constant d were later proved independently by Benjamini et al. in . (C) 2008 Wiley Periodicals, Inc.
|Number of pages||19|
|Journal||Random Structures and Algorithms|
|Publication status||Published - 1 Aug 2008|
- random graph, giant component, mixing time