126 citations · 1k across the 145 of their papers we have counts for
158 papers
Very sharp distance and range transitions for random walk bridges on Ramanujan graphs
Itai Benjamini
For vertex-transitive Ramanujan graphs with logarithmic girth, a simple random walk bridge of length of order , where is the size of the graph, has a maximum distance t…
Percolation on Finite Graphs
Michael Krivelevich
Lecture notes from a graduate course given by Michael Krivelevich at the School of Mathematical Sciences of Tel Aviv University in the spring semester of 2026. Topics covered inclu…
The Conclave Process
Itai Benjamini, Zhenhao Cai, Guanyi Chen +2
We introduce a stochastic model for the papal conclave in which cardinals vote repeatedly among themselves until one cardinal receives all the votes. In each round, the probabi…
The Uniform Gromov Hausdorff Gap Problem for Approximating Spheres by Finite Homogeneous Spaces
Itai Benjamini
Let be the unit round sphere with its intrinsic angular metric, normalized so that . For finite homogeneous metric spaces , put \[ δ_n=\inf_X d_{…
Euclidean vs Graph Metric: The Fixed-Source Problem
Itai Benjamini
We prove that two fixed sources in the Euclidean plane can be realized by a bounded-degree planar unit-edge graph on a 10-net, with graph distance from each source agreeing with Eu…
The Pile Process on a Cycle
Itai Benjamini, Eric Shellef
Consider a finite particle system in which, at each step, one particle from a vertex with a lower neighboring vertex moves to a neighboring vertex of minimum height. For the cycle…