3 papers
math.PR2024
Random choice spanning trees
Eleanor Archer, Matan Shalev
In this paper we introduce a new model of random spanning trees that we call choice spanning trees, constructed from so-called choice random walks. These are random walks for which…
math.PR2023
The union of independent USFs on is transient
Eleanor Archer, Asaf Nachmias, Matan Shalev +1
We show that the union of two or more independent uniform spanning forests (USF) on with almost surely forms a connected transient graph. In fact, this als…
math.PR2021
The GHP scaling limit of uniform spanning trees in high dimensions
Eleanor Archer, Asaf Nachmias, Matan Shalev
We show that the Brownian continuum random tree is the Gromov-Hausdorff-Prohorov scaling limit of the uniform spanning tree on high-dimensional graphs including the -dimensional…