Jian Ding

Stanford University
Scientific, Seminar
Probability Seminar: Jian Ding, Stanford University
January 25, 2012
University of British Columbia
Abstract: We show that on bounded degree graphs and general trees the cover time of the simple random walk is asymptotically equal to the product of the number of edges and the square of the supremum of the Gaussian free field on the graph, assuming...