Itai Benjamini 2026-11-05
Itai Benjamini studies random geometric and combinatorial structures. His joint work with Russell Lyons, Yuval Peres and Oded Schramm investigates uniform spanning forests as limits of finite uniform spanning trees.[ref]
On an infinite graph, a limiting forest need not be a single tree. Free and wired boundary conditions can lead to different laws. The paper relates this distinction and the number of connected components to random walks and harmonic functions, making infinite-volume geometry accessible through probabilistic tests.[ref]
Russell Lyons 2026-11-05
Finite spanning-tree laws can approach different limits depending on whether the boundary is left free or wired together. Their work connects these limits with random walks, potential theory and harmonic functions. One result characterizes the number of wired-forest components through intersections of independent walks, showing that global connectivity is encoded in stochastic paths.[ref]