A characterization of effective resistance metrics

DOI10.1007/S11118-018-9718-2MaRDI QIDQ2334560zbMATH OpenOpenAlexFDO

Authors Tobias Weihrauch

Publication date 7 November 2019

Published in Potential Analysis (Search for Journal in Brave)

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

zbMATH Keywords

random walkweak convergenceweighted grapheffective resistancegraph Laplacianresistance metrics

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Signed and weighted graphs (05C22) Random walks on graphs (05C81) Potential theory on fractals and metric spaces (31E05) Probabilistic metric spaces (54E70) Probabilistic potential theory (60J45)

Abstract: We produce a characterization of finite metric spaces which are given by the effective resistance of a graph. This characterization is applied to the more general context of resistance metrics defined by Kigami. A countably infinite resistance metric gives rise to a sequence of finite, increasing graphs with invariant effective resistance. We show that these graphs have a unique limit graph in terms of the convergence of edge weights and that their associated random walks converge weakly to the random walk on the limit graph. If the limit graph is recurrent, its effective resistance is identified as the initial resistance metric.

Recommendations

• On graph-like continua of finite length
• Metric and ultrametric spaces of resistances
• Infinite weighted graphs with bounded resistance metric
• A Hilbert space approach to effective resistance metric
• Infinitesimal resistance metrics on Sierpinski gasket type fractals

Cites work

• scientific article; zbMATH DE number 3934150 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• A Hilbert space approach to effective resistance metric
• Analysis on fractals
• Convergence of metric graphs and energy forms
• Graph theory. Foreword by Crispin St. J. A. Nash-Williams.
• Kron Reduction of Graphs With Applications to Electrical Networks
• Potential theory on infinite networks
• Probability on trees and networks
• Random walks and heat kernels on graphs
• Random walks and the effective resistance of networks
• The electrical resistance of a graph captures its commute and cover times

Cited in

(8)

• Metric and ultrametric spaces of resistances
• A Note on Rough Isometry Invariance of Resistance
• Metric and ultrametric spaces of resistances
• Effective resistance is more than distance: Laplacians, simplices and the Schur complement
• Scaling limits of stochastic processes associated with resistance forms
• Effective resistance on graphs and the epidemic quasimetric
• On the probabilistic representation of the free effective resistance of infinite graphs
• A Hilbert space approach to effective resistance metric

This page was built for publication: A characterization of effective resistance metrics

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