Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Shalev, Matan"'
Autor:
Archer, Eleanor, Shalev, Matan
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 each step is chosen from a subset of random options, according to som
Externí odkaz:
http://arxiv.org/abs/2402.05800
We show that the union of two or more independent uniform spanning forests (USF) on $\mathbb{Z}^d$ with $d\geq 3$ almost surely forms a connected transient graph. In fact, this also holds when taking the union of a deterministic everywhere percolatin
Externí odkaz:
http://arxiv.org/abs/2311.09183
Autor:
Archer, Eleanor, Shalev, Matan
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 are able to extract the precise scaling constant from the limiting gr
Externí odkaz:
http://arxiv.org/abs/2301.00461
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 $d$-dimensional torus $\mathbb{Z}_n^d$ with $d>4$, the hypercube $\{0,1\}^n$, and tra
Externí odkaz:
http://arxiv.org/abs/2112.01203
We show that the diameter of a uniformly drawn spanning tree of a simple connected graph on $n$ vertices with minimal degree linear in $n$ is typically of order $\sqrt{n}$. A byproduct of our proof, which is of independent interest, is that on such g
Externí odkaz:
http://arxiv.org/abs/2009.09656
We show that the diameter of a uniformly drawn spanning tree of a connected graph on $n$ vertices which satisfies certain high-dimensionality conditions typically grows like $\Theta(\sqrt{n})$. In particular this result applies to expanders, finite t
Externí odkaz:
http://arxiv.org/abs/1911.12319
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Archer, Eleanor, Shalev, Matan
Publikováno v:
Random Structures & Algorithms; Aug2024, Vol. 65 Issue 1, p149-190, 42p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Combinatorics, Probability and Computing. 31:1010-1030
We show that the diameter of a uniformly drawn spanning tree of a simple connected graph on $n$ vertices with minimal degree linear in $n$ is typically of order $\sqrt{n}$. A byproduct of our proof, which is of independent interest, is that on such g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b8f46e33a55d433a18184e18f26491e8
https://doi.org/10.1017/s0963548322000062
https://doi.org/10.1017/s0963548322000062