87 citations · 281 across the 61 of their papers we have counts for
Showing 2010Show all
3 papers · 1 filter
math.PR2010
Linear Cover Time is Exponentially Unlikely
Itai Benjamini, Ori Gurel-Gurevich, Ben Morris
We show that the probability that a simple random walk covers a finite, bounded degree graph in linear time is exponentially small. More precisely, for every D and C, there exists…
math.PR2010
Tightness of Fluctuations of First Passage Percolation on Some Large Graphs
Itai Benjamini, Ofer Zeitouni
The theorem of Dekking and Host regarding tightness around the mean of first passage percolation on the binary tree, from the root to a boundary of a ball, is generalized to a clas…
math.MG2010★ 2 cited
Nonamenable Liouville Graphs
Itai Benjamini, Gady Kozma
Add to each level of binary tree edges to make the induced graph on the level a uniform expander. It is shown that such a graph admits no non-constant bounded harmonic functions.