Infinite weighted graphs with bounded resistance metric
Palle Jorgensen, Feng Tian

TL;DR
This paper studies infinite weighted graphs with bounded resistance metrics, establishing boundary representations for harmonic functions, and showing that the metric completion is compact with implications for potential theory.
Contribution
It introduces explicit boundary representations for finite-energy harmonic functions on graphs with bounded resistance metrics and analyzes the properties of the metric completion.
Findings
Finite-energy harmonic functions form a Lipschitz algebra.
The metric completion of the graph is compact.
V is open in the completion.
Abstract
We consider infinite weighted graphs , i.e., sets of vertices , and edges assumed countable infinite. An assignment of weights is a positive symmetric function on (the edge-set), conductance. From this, one naturally defines a reversible Markov process, and a corresponding Laplace operator acting on functions on , voltage distributions. The harmonic functions are of special importance. We establish explicit boundary representations for the harmonic functions on of finite energy. We compute a resistance metric from a given conductance function. (The resistance distance between two vertices and is the voltage drop from to , which is induced by the given assignment of resistors when 1 amp is inserted at the vertex , and then extracted again at .) We study the class of models where this resistance metric is bounded. We show that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLow-power high-performance VLSI design · VLSI and FPGA Design Techniques · Graphene research and applications
