相关论文: A Hilbert space approach to effective resistance m…

A resistance network is a connected graph $(G,c)$. The conductance function $c_{xy}$ weights the edges, which are then interpreted as conductors of possibly varying strengths. The Dirichlet energy form $\mathcal E$ produces a Hilbert space…

A resistance network is a weighted graph $(G,c)$ with intrinsic (resistance) metric $R$. We embed the resistance network into the Hilbert space ${\mathcal H}_{\mathcal E}$ of functions of finite energy. We use the resistance metric to study…

A resistance network is a connected graph $(G,c)$. The conductance function $c_{xy}$ weights the edges, which are then interpreted as resistors of possibly varying strengths. The relationship between the natural Dirichlet form $\mathcal E$…

We consider infinite weighted graphs $G$, i.e., sets of vertices $V$, and edges $E$ assumed countable infinite. An assignment of weights is a positive symmetric function $c$ on $E$ (the edge-set), conductance. From this, one naturally…

Recent applications of large network models to machine learning, and to neural network suggest a need for a systematic study of the general correspondence, (i) discrete vs (ii) continuous. Even if the starting point is (i), limit…

In the setting of finite-dimensional $C^*$-algebras ${\mathcal A}$ we define what we call a Riemannian metric for ${\mathcal A}$, which when ${\mathcal A}$ is commutative is very closely related to a finite resistance network. We explore…

We investigate the behavior of two dimensional resistor networks, with finite sizes and different kinds (rectangular, hexagonal, and triangular) of lattice geometry. We construct the network by having a network-element repeat itself $L_x$…

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…

Effective resistance (ER) is an attractive way to interrogate the structure of graphs. It is an alternative to computing the eigenvectors of the graph Laplacian. One attractive application of ER is to point clouds, i.e. graphs whose…

For a graph $G=(V,E)$, assigning each edge $e\in E$ a weight of a dual number $w(e)=1+\widehat{a}_{e}\varepsilon$, the weighted graph $G^{w}=(V,E,w)$ is called a dual number weighted graph, where $-\widehat{a}_{e}$ can be regarded as the…

We study a conductance-weighted arboricity for a finite simple undirected graph $G=(V,E,c)$ with a conductance assignment $c:E\to[0,\infty)$: \[ A_c(G):=\max\bigl\{ D_c(H): H\subseteq G\text{ connected}, |V(H)|\ge 2 \bigr\},\qquad…

Using a Hilbert space framework inspired by the methods of orthogonal projections and Hodge decompositions, we study a general class of problems (called Z-problems) that arise in effective media theory, especially within the theory of…

Let $G$ be a finite plane multigraph and $G'$ its dual. Each edge $e$ of $G$ is interpreted as a resistor of resistance $R_e$, and the dual edge $e'$ is assigned the dual resistance $R_{e'}:=1/R_e$. Then the equivalent resistance $r_e$ over…

The effective conductivity ($T^{eff}$) of 2D and 3D Random Resistor Networks (RRNs) with random edge conductivity are studied. The combined influence of geometrical disorder, which controls the overall connectivity of the medium, and leads…

It is known that electrical networks with resistors are related to the Laplace operator and random walk on weighted graphs. In this paper we consider more general electrical networks with coils, capacitors, and resistors. We give two…

The graphical notion of effective resistance has found wide-ranging applications in many areas of pure mathematics, applied mathematics and control theory. By the nature of its construction, effective resistance can only be computed in…

The concept of effective resistance, originally introduced in electrical circuit theory, has been extended to the setting of graphs by interpreting each edge as a resistor. In this context, the effective resistance between two vertices…

This paper presents an introduction and expository account of a beautiful, current, and active application of recursions to the computation of resistance distance. Resistance distance, also referred to as effective resistance, is a…

We give identities for the voltage and resistance functions on a metrized graph to show how these functions behave under any edge deletion/contraction and the identification of any two vertices. This leads to explicit versions of Rayleigh's…

In this paper we deal with the notion of the effective impedance of AC networks consisting of resistances, coils and capacitors. Mathematically such a network is a locally finite graph whose edges are endowed with complex-valued weights…