123 citations · 404 across the 40 of their papers we have counts for
Showing 2010 · math.PRShow all
2 papers · 2 filters
math.PR2010★ 5 cited
Nonconcentration of return times
Ori Gurel-Gurevich, Asaf Nachmias
We show that the distribution of the first return time to the origin, v, of a simple random walk on an infinite recurrent graph is heavy tailed and nonconcentrated. More precis…
math.PR2010
The evolution of the cover time
Martin T. Barlow, Jian Ding, Asaf Nachmias +1
The cover time of a graph is a celebrated example of a parameter that is easy to approximate using a randomized algorithm, but for which no constant factor deterministic polynomial…