4 citations · 4 across the 6 of their papers we have counts for
6 papers
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…
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…
The GHP scaling limit of uniform spanning trees of dense graphs
Eleanor Archer, Matan Shalev
We consider dense graph sequences that converge to a connected graphon and prove that the GHP scaling limit of their uniform spanning trees is Aldous' Brownian CRT. Furthermore, we…
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…
The diameter of the uniform spanning tree of dense graphs
Noga Alon, Asaf Nachmias, Matan Shalev
We show that the diameter of a uniformly drawn spanning tree of a simple connected graph on vertices with minimal degree linear in is typically of order . A bypro…
The diameter of uniform spanning trees in high dimensions
Peleg Michaeli, Asaf Nachmias, Matan Shalev
We show that the diameter of a uniformly drawn spanning tree of a connected graph on vertices which satisfies certain high-dimensionality conditions typically grows like $Θ(\sq…