517 citations · 2.8k across the 215 of their papers we have counts for
21 papers · 1 filter
Noise Stability of Weighted Majority
Yuval Peres
Benjamini, Kalai and Schramm (2001) showed that weighted majority functions of independent unbiased bits are uniformly stable under noise: when each bit is flipped with probabi…
Minimal spanning forests
Russell Lyons, Yuval Peres, Oded Schramm
Minimal spanning forests on infinite graphs are weak limits of minimal spanning trees from finite subgraphs. These limits can be taken with free or wired boundary conditions and ar…
Markov chains in smooth Banach spaces and Gromov hyperbolic metric spaces
Assaf Naor, Yuval Peres, Oded Schramm +1
A metric space has {\em Markov type} 2, if for any reversible finite-state Markov chain (with chosen according to the stationary distribution) and any map f…
Scaling limits of the uniform spanning tree and loop-erased random walk on finite graphs
Yuval Peres, David Revelle
Let x and y be chosen uniformly in a graph G. We find the limiting distribution of the length of a loop-erased random walk from x to y on a large class of graphs that include the d…
An LIL for cover times of disks by planar random walk and Wiener sausage
J. Ben Hough, Yuval Peres
Let R_n be the radius of the largest disk covered after n steps of a simple random walk. We prove that almost surely limsup_{n \to \infty}(log R_n)^2/(log n log_3 n) = 1/4, where l…
Recurrent graphs where two independent random walks collide finitely often
Manjunath Krishnapur, Yuval Peres
We present a class of graphs where simple random walk is recurrent, yet two independent walkers meet only finitely many times almost surely. In particular, the comb lattice, obtain…