N. Berestycki & D. van Engelenburg: Harnack inequality and one-endedness of UST on reversible random graphs

Abstract: This talk is concerned with the geometry of the (wired) Uniform Spanning Tree (UST) on an infinite graph, and in particular with a property called one-endedness, which says that the removal of a finite subset does not produce multiple infinite clusters. The question of the one-endedness for the UST is the analogue of the question of percolation at criticality.

We will discuss recent joint work in which we show that for recurrent, stationary random 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. (All these terms will be introduced in the talk).

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.

arXiv: 2110.05100


Password Protected

This video is password-protected. Please verify with a password to unlock the content.