Academic Journal

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

Bibliographic Details
Title: Harnack inequality and one-endedness of UST on reversible random graphs.
Authors: Berestycki, Nathanaël1 (AUTHOR) nathanael.berestycki@univie.ac.at, van Engelenburg, Diederik1 (AUTHOR)
Superior Title: Probability Theory & Related Fields. Feb2024, Vol. 188 Issue 1/2, p487-548. 62p.
Subject Terms: *RANDOM walks, SPANNING trees, RANDOM graphs, LOGICAL prediction
Geographic Terms: LYON (France)
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 et al. (Ann Probab 29(1):1–65, 2001). 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. [ABSTRACT FROM AUTHOR]
Copyright of Probability Theory & Related Fields is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Business Source Premier
Description
Description not available.