OpenAlex ·
A quadratic ancestor inequality for spanning trees
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.22180
- Original
- Read it at the publisher
- Topics
Abstract
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.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Mathematical Physics
A complete classification of perfect state transfer in Grover walks on abelian Cayley graphs
Near optimal gap in the Lonely Runner Conjecture
Connectivity Bounds for GHZ Graphs
Revisiting separators in string graphs, region intersection graphs, and induced-minor-free graphs
Geometric Graph Representations via Compact SAT Encodings
Get the few papers worth your time in Mathematical Physics every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.