2 papers
math.PR2004
Some Conditional Correlation Inequalities for Percolation and Related Processes
Jacob van den Berg, Olle Haggstrom, Jeff Kahn
Consider ordinary bond percolation on a finite or countably infinite graph. Let s, t, a and b be vertices. An earlier paper proved the (nonintuitive) result that, conditioned on th…
math.PR2000
The cover time, the blanket time, and the Matthews bound
J. Kahn, J. H. Kim, L. Lovasz +1
The cover time C of a graph G is the expected time for a random walk starting from the worst vertex to cover all vertices in G. Similarly, the blanket time B is the expected time t…