activity
20012005
most citedFast simulation of new coins from old

55 citations · 252 across the 32 of their papers we have counts for

collaborators
Showing 2004Show all

17 papers · 1 filter

math.PR200410 cited

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…

math.PR200425 cited

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…

math.PR2004

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…

math.PR2004

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…

math.PR2004

Mixing times for random walks on finite lamplighter groups

Yuval Peres, David Revelle

Given a finite graph G, a vertex of the lamplighter graph consists of a zero-one labeling of the vertices of G, and a marked vertex of G. For transitive graphs G, we show that, up…

math.PR2004

A phase transition in random coin tossing

David A. Levin, Robin Pemantle, Yuval Peres

Suppose that a coin with bias theta is tossed at renewal times of a renewal process, and a fair coin is tossed at all other times. Let mu_θbe the distribution of the observed seque…