Every recurrent network has a potential tending to infinity
Probability
2025-02-25 v1 Analysis of PDEs
Abstract
A rooted network consists of a connected, locally finite graph G, equipped with edge conductances and a distinguished vertex o. A nonnegative function on the vertices of G which vanishes at o, has Laplacian 1 at o, and is harmonic at all other vertices is called a potential. We prove that every infinite recurrent rooted network admits a potential tending to infinity. This is an analogue of classical theorems due to Evans and Nakai in the settings of Euclidean domains and Riemannian surfaces.
Cite
@article{arxiv.2502.17285,
title = {Every recurrent network has a potential tending to infinity},
author = {Asaf Nachmias and Yuval Peres},
journal= {arXiv preprint arXiv:2502.17285},
year = {2025}
}
Comments
5 pages