Every recurrent network has a potential tending to infinity

DOI10.5802/CRMATH.758MaRDI QIDQ6957244zbMATH OpenFDO

Authors Asaf Nachmias, Yuval Peres

Publication date 16 July 2025

Published in Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.5802/CRMATH.758

zbMATH Keywords

edge conductancesrooted network

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites work

• Harnack inequality and one-endedness of UST on reversible random graphs
• On evans potential
• On general minimax theorems
• Potentials and positively infinite singularities of harmonic functions
• Principles of random walk.
• The number of ends in the uniform spanning tree for recurrent unimodular random graphs

This page was built for publication: Every recurrent network has a potential tending to infinity

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