Metraipolis › archive › dc_33510c30decb
A quadratic ancestor inequality for spanning trees — arXiv:2610.22180
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.22180
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:29:46.759Z
- SHA-256 of the archived text
d4384171b2d6f5d33db26526e3cbef30ca7b840d6653c25800bbc614ace817ea- Stable URL of this page
https://metraipolis.com/documento/dc_33510c30decb
How to cite
A quadratic ancestor inequality for spanning trees — arXiv:2610.22180 — arXiv (en), https://arxiv.org/abs/2610.22180 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_33510c30decb (Metraipolis archive dc_33510c30decb, sha256 d4384171b2d6f5d33db26526e3cbef30ca7b840d6653c25800bbc614ace817ea)
BibTeX
@misc{dc33510c30decb,
title = {A quadratic ancestor inequality for spanning trees — arXiv:2610.22180},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.22180},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_33510c30decb; sha256 d4384171b2d6f5d33db26526e3cbef30ca7b840d6653c25800bbc614ace817ea},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.22180. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We introduce a quadratic ancestor inequality for weighted spanning trees on finite undirected graphs and give two applications. First, for every finite $n$-vertex transitive graph, the expected distance in its uniform spanning tree (UST) between two independent uniform vertices is at least $\sqrt{n}-1$, resolving a conjecture in [Benjamini--Kozma, Comm. Math. Phys. 259 (2005), 257--286]. Second, we prove that the growth exponent of three-dimensional loop-erased random walk (LERW) is at least 3/2.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Probability (math.PR) ; Mathematical Physics (math-ph); Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.22180 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T08:50:17.595Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).