87 citations · 100 across the 18 of their papers we have counts for
4 papers · 2 filters
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…
Martin Capacity for Markov Chains
Itai Benjamini, Robin Pemantle, Yuval Peres
The probability that a transient Markov chain, or a Brownian path, will ever visit a given set Lambda, is classically estimated using the capacity of Lambda with respect to the Gre…