scholarly journals Infinite weighted graphs with bounded resistance metric

2018 ◽  
Vol 123 (1) ◽  
pp. 5-38
Author(s):  
Palle Jorgensen ◽  
Feng Tian

We consider infinite weighted graphs $G$, i.e., sets of vertices $V$, and edges $E$ assumed countably infinite. An assignment of weights is a positive symmetric function $c$ on $E$ (the edge-set), conductance. From this, one naturally defines a reversible Markov process, and a corresponding Laplace operator acting on functions on $V$, voltage distributions. The harmonic functions are of special importance. We establish explicit boundary representations for the harmonic functions on $G$ of finite energy.We compute a resistance metric $d$ from a given conductance function. (The resistance distance $d(x,y)$ between two vertices $x$ and $y$ is the voltage drop from $x$ to $y$, which is induced by the given assignment of resistors when $1$ amp is inserted at the vertex $x$, and then extracted again at $y$.)We study the class of models where this resistance metric is bounded. We show that then the finite-energy functions form an algebra of ${1}/{2}$-Lipschitz-continuous and bounded functions on $V$, relative to the metric $d$. We further show that, in this case, the metric completion $M$ of $(V,d)$ is automatically compact, and that the vertex-set $V$ is open in $M$. We obtain a Poisson boundary-representation for the harmonic functions of finite energy, and an interpolation formula for every function on $V$ of finite energy. We further compare $M$ to other compactifications; e.g., to certain path-space models.

Author(s):  
Qun Liu ◽  
Jiabao Liu

Let G[F,Vk, Huv] be the graph with k pockets, where F is a simple graph of order n ≥ 1,Vk= {v1,v2,··· ,vk} is a subset of the vertex set of F and Hvis a simple graph of order m ≥ 2,v is a specified vertex of Hv. Also let G[F,Ek, Huv] be the graph with k edge pockets, where F is a simple graph of order n ≥ 2, Ek= {e1,e2,···ek} is a subset of the edge set of F and Huvis a simple graph of order m ≥ 3, uv is a specified edge of Huvsuch that Huv− u is isomorphic to Huv− v. In this paper, we derive closed-form formulas for resistance distance and Kirchhoff index of G[F,Vk, Hv] and G[F,Ek, Huv] in terms of the resistance distance and Kirchhoff index F, Hv and F, Huv, respectively.


2020 ◽  
Vol 36 (36) ◽  
pp. 277-292
Author(s):  
R. Balaji ◽  
R.B. Bapat ◽  
Shivani Goel

Let $G=(V,E)$ be a strongly connected and balanced digraph with vertex set $V=\{1,\dotsc,n\}$. The classical distance $d_{ij}$ between any two vertices $i$ and $j$ in $G$ is the minimum length of all the directed paths joining $i$ and $j$. The resistance distance (or, simply the resistance) between any two vertices $i$ and $j$ in $V$ is defined by $r_{ij}:=l_{ii}^{\dagger}+l_{jj}^{\dagger}-2l_{ij}^{\dagger}$, where $l_{pq}^{\dagger}$ is the $(p,q)^{\rm th}$ entry of the Moore-Penrose inverse of $L$ which is the Laplacian matrix of $G$. In practice, the resistance $r_{ij}$ is more significant than the classical distance. One reason for this is, numerical examples show that the resistance distance between $i$ and $j$ is always less than or equal to the classical distance, i.e., $r_{ij} \leq d_{ij}$. However, no proof for this inequality is known. In this paper, it is shown that this inequality holds for all directed cactus graphs.


Author(s):  
Václav Blažej ◽  
Pratibha Choudhary ◽  
Dušan Knop ◽  
Jan Matyáš Křišt’an ◽  
Ondřej Suchý ◽  
...  

AbstractConsider a vertex-weighted graph G with a source s and a target t. Tracking Paths requires finding a minimum weight set of vertices (trackers) such that the sequence of trackers in each path from s to t is unique. In this work, we derive a factor 66-approximation algorithm for Tracking Paths in weighted graphs and a factor 4-approximation algorithm if the input is unweighted. This is the first constant factor approximation for this problem. While doing so, we also study approximation of the closely related r-Fault Tolerant Feedback Vertex Set problem. There, for a fixed integer r and a given vertex-weighted graph G, the task is to find a minimum weight set of vertices intersecting every cycle of G in at least $$r+1$$ r + 1 vertices. We give a factor $$\mathcal {O}(r^2)$$ O ( r 2 ) approximation algorithm for r-Fault Tolerant Feedback Vertex Set if r is a constant.


1998 ◽  
Vol 50 (6) ◽  
pp. 1163-1175 ◽  
Author(s):  
Jingyi Chen ◽  
Elton P. Hsu

AbstractWe introduce a distributional Ricci curvature on complete smooth manifolds with Lipschitz continuous metrics. Under an assumption on the volume growth of geodesics balls, we obtain a gradient estimate for weakly harmonic functions if the distributional Ricci curvature is bounded below.


Mathematics ◽  
2019 ◽  
Vol 7 (1) ◽  
pp. 83
Author(s):  
Fangguo He ◽  
Zhongxun Zhu

For a graph G, the resistance distance r G ( x , y ) is defined to be the effective resistance between vertices x and y, the multiplicative degree-Kirchhoff index R ∗ ( G ) = ∑ { x , y } ⊂ V ( G ) d G ( x ) d G ( y ) r G ( x , y ) , where d G ( x ) is the degree of vertex x, and V ( G ) denotes the vertex set of G. L. Feng et al. obtained the element in C a c t ( n ; t ) with first-minimum multiplicative degree-Kirchhoff index. In this paper, we first give some transformations on R ∗ ( G ) , and then, by these transformations, the second-minimum multiplicative degree-Kirchhoff index and the corresponding extremal graph are determined, respectively.


2017 ◽  
Vol 60 (1) ◽  
pp. 197-205 ◽  
Author(s):  
Zikai Tang ◽  
Hanyuan Deng

AbstractLet G be a connected graph with vertex set V(G).The degree Kirchhoò index of G is defined as S'(G) = Σ{u,v}⊆V(G) d(u)d(v)R(u, v), where d(u) is the degree of vertex u, and R(u, v) denotes the resistance distance between vertices u and v. In this paper, we characterize the graphs having maximum and minimum degree Kirchhoò index among all n-vertex bicyclic graphs with exactly two cycles.


2016 ◽  
Vol 08 (02) ◽  
pp. 1650021
Author(s):  
Lu Lu ◽  
Qiongxiang Huang ◽  
Lin Chen

Let [Formula: see text] denote the set of all weighted cycles with vertex set [Formula: see text], edge set [Formula: see text] and positive weight set [Formula: see text]. A weighted cycle [Formula: see text] is called maximum if [Formula: see text] for any [Formula: see text]. In this paper, we give some properties of the Perron vector for the maximum weighted graphs and then determine the maximum weighted cycle in [Formula: see text].


Sign in / Sign up

Export Citation Format

Share Document