Harnack inequality and one-endedness of UST on reversible random graphs
Nathana\"el Berestycki, Diederik van Engelenburg

TL;DR
This paper establishes the equivalence of several key properties related to harmonic functions and the structure of the Uniform Spanning Tree on reversible graphs, providing new insights into their geometric and probabilistic behavior.
Contribution
It introduces a new anchored Harnack inequality and proves the equivalence of multiple conditions on recurrent, reversible graphs, advancing understanding of UST structure and harmonic measures.
Findings
Equivalence of potential kernel, harmonic measure, Harnack inequality, and one-endedness.
Proof of the anchored Harnack inequality on the UIPT.
Progress towards a conjecture of Aldous and Lyons for subdiffusive graphs.
Abstract
We prove that for recurrent, reversible graphs, the following conditions are equivalent: (a) existence and uniqueness of the potential kernel, (b) existence and uniqueness of harmonic measure from infinity, (c) a new anchored Harnack inequality, and (d) one-endedness of the wired Uniform Spanning Tree. In particular this gives a proof of the anchored (and in fact also elliptic) Harnack inequality on the UIPT. This also complements and strengthens some results of Benjamini, Lyons, Peres and Schramm. Furthermore, we make progress towards a conjecture of Aldous and Lyons by proving that these conditions are fulfilled for strictly subdiffusive recurrent unimodular graphs. Finally, we discuss the behaviour of the random walk conditioned to never return to the origin, which is well defined as a consequence of our results
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Geometry and complex manifolds · Limits and Structures in Graph Theory
