On the probabilistic representation of the free effective resistance of infinite graphs

DOI10.1007/S10959-022-01218-5zbMath1527.05127arXiv1902.01110MaRDI QIDQ6071169

Stefan Bachmann, Tobias Weihrauch

Publication date: 21 November 2023

Published in: Journal of Theoretical Probability (Search for Journal in Brave)

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

zbMATH Keywords

weighted graphtransiencerandom walkelectrical networkseffective resistance

Mathematics Subject Classification ID

Applications of graph theory (05C90) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Distance in graphs (05C12) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Infinite graphs (05C63) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• A Hilbert space approach to effective resistance metric
• Random walks and the effective resistance of networks
• Uniform spanning forests
• A characterization of effective resistance metrics
• Probability on Trees and Networks
• Random Walks and Heat Kernels on Graphs
• Probability on Graphs

This page was built for publication: On the probabilistic representation of the free effective resistance of infinite graphs