11 citations · 17 across the 9 of their papers we have counts for
Showing 2010Show all
3 papers · 1 filter
math.PR2010
Mobile Geometric Graphs: Detection, Coverage and Percolation
Yuval Peres, Alistair Sinclair, Perla Sousi +1
We consider the following dynamic Boolean model introduced by van den Berg, Meester and White (1997). At time 0, let the nodes of the graph be a Poisson point process in R^d with c…
math.PR2010★ 1 cited
Hitting times for random walks with restarts
Svante Janson, Yuval Peres
The time it takes a random walker in a lattice to reach the origin from another vertex , has infinite mean. If the walker can restart the walk at at will, then the minimum e…
math.PR2010★ 3 cited
Collisions of Random Walks
Martin T. Barlow, Yuval Peres, Perla Sousi
A recurrent graph has the infinite collision property if two independent random walks on , started at the same point, collide infinitely often a.s. We give a simple criterio…