2 citations · 2 across the 7 of their papers we have counts for
7 papers
Shy couplings
Itai Benjamini, Krzysztof Burdzy, Zhen-Qing Chen
A pair of Markov processes is called a Markov coupling if both processes have the same transition probabilities and the pair is also a Markov process. We say that a coupling is ``s…
Excited random walk against a wall
Gideon Amir, Itai Benjamini, Gady Kozma
We analyze random walk in the upper half of a three dimensional lattice which goes down whenever it encounters a new vertex, a.k.a. excited random walk. We show that it is recurren…
The isoperimetric constant of the random graph process
Itai Benjamini, Simi Haber, Michael Krivelevich +1
The isoperimetric constant of a graph on vertices, , is the minimum of , taken over all nonempty subsets of size at most $n/…
Routing Complexity of Faulty Networks
Omer Angel, Itai Benjamini, Eran Ofek +1
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper invest…
Random walks with -wise independent increments
Itai Benjamini, Gady Kozma, Dan Romik
We construct examples of a random walk with pairwise-independent steps which is almost-surely bounded, and for any and a random walk with -wise independent steps which h…
Random Walks in Varying Dimensions
Itai Benjamini, Robin Pemantle, Yuval Peres
We establish recurrence criteria for sums of independent random variables which take values in Euclidean lattices of varying dimension. In particular, we describe transient inhomog…