Harnack inequality and one-endedness of UST on reversible random graphs

DOI10.1007/S00440-023-01239-ZzbMATH Open1530.05167arXiv2110.05100OpenAlexW3207080524MaRDI QIDQ6145693FDOQ6145693

Authors: Nathanaël Berestycki, Diederik van Engelenburg 

Publication date: 9 January 2024

Published in: Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

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

Full work available at URL: https://arxiv.org/abs/2110.05100

zbMATH Keywords

Harnack inequalitypotential theoryuniform spanning treereversible random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Geometric probability and stochastic geometry (60D05) Sums of independent random variables; random walks (60G50) Probabilistic potential theory (60J45)

Cites Work

• Title not available (Why is that?)
• Simple random walk on the uniform infinite planar quadrangulation: Subdiffusivity via pioneer points
• Random walk: A modern introduction
• Isometric Riemannian manifolds at infinity
• Processes on unimodular random networks
• Probability on trees and networks
• Analysis and geometry on groups
• Title not available (Why is that?)
• Markov Chains
• The Liouville and the intersection properties are equivalent for planar graphs
• Principle de Harnack à la frontière et théorème de Fatou pour un opérateur elliptique dans un domaine lipschitzien
• Two-dimensional random interlacements and late points for random walks
• Discrete harmonic functions on an orthant in \(\mathbb{Z}^d\)
• Title not available (Why is that?)
• Two-dimensional random walk. From path counting to random interlacements
• Choosing a spanning tree for the integer lattice uniformly
• Ergodic theory on stationary random graphs
• Collisions of random walks in reversible random graphs
• Uniform spanning forests
• The Alexander-Orbach conjecture holds in high dimensions
• Amenability, unimodularity, and the spectral radius of random walks on infinite graphs
• Random walks on disordered media and their scaling limits. École d'Été de Probabilités de Saint-Flour XL -- 2010
• Random walk on the incipient infinite cluster for oriented percolation in high dimensions
• Disorder, entropy and harmonic functions
• Ends in uniform spanning forests
• GRAPHS WITH POLYNOMIAL GROWTH
• Wired cycle-breaking dynamics for uniform spanning forests
• Title not available (Why is that?)
• Random walk on random planar maps: spectral dimension, resistance and displacement
• The Tutte embedding of the mated-CRT map converges to Liouville quantum gravity
• The incipient infinite cluster for high-dimensional unoriented percolation
• Random walks and heat kernels on graphs
• Stability of the elliptic Harnack inequality
• Hyperbolic and parabolic unimodular random maps
• Interlacements and the wired uniform spanning forest
• On the range of a two-dimensional conditioned simple random walk
• Universality of high-dimensional spanning forests and sandpiles
• Random walks on mated-CRT planar maps and Liouville Brownian motion
• Transience of conditioned walks on the plane: encounters and speed of escape

Cited In (1)

• The number of ends in the uniform spanning tree for recurrent unimodular random graphs

This page was built for publication: Harnack inequality and one-endedness of UST on reversible random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6145693)