相关论文: Laplace operators in finite energy and dissipation…
The main goal of this paper is to build a measurable analogue to the theory of weighted networks on infinite graphs. Our basic setting is an infinite $\sigma$-finite measure space $(V, \mathcal B, \mu)$ and a symmetric measure $\rho$ on…
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…
For a given infinite connected graph $G=(V,E)$ and an arbitrary but fixed conductance function $c$, we study an associated graph Laplacian $\Delta_{c}$; it is a generalized difference operator where the differences are measured across the…
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$…
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…
Using functions from electrical networks (graphs with resistors assigned to edges), we prove existence (with explicit formulas) of a canonical Parseval frame in the energy Hilbert space $\mathscr{H}_{E}$ of a prescribed infinite (or finite)…
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…
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…
Let $(G,c)$ be an infinite network, and let $\mathcal{E}$ be the canonical energy form. Let $\Delta_2$ be the Laplace operator with dense domain in $\ell^2(G)$ and let $\Delta_{\mathcal{E}}$ be the Laplace operator with dense domain in the…
We study the operator theory associated with such infinite graphs $G$ as occur in electrical networks, in fractals, in statistical mechanics, and even in internet search engines. Our emphasis is on the determination of spectral data for a…
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…
For a network consisting of a graph with edge weights prescribed by a given conductance function $c$, we consider the effects of replacing these weights with a new function $b$ that satisfies $b \leq c$ on each edge. In particular, we…
Formal Laplace operators are analyzed for a large class of resistance networks with vertex weights. The graphs are completed with respect to the minimal resistance path metric. Compactness and a novel connectivity hypothesis for the…
We consider Laplace operators on metric graphs, networks of one-dimensional line segments (bonds), with matching conditions at the vertices that make the operator self-adjoint. Such quantum graphs provide a simple model of quantum mechanics…
Effective resistance (ER) is an attractive way to interrogate the structure of graphs. It is an alternative to computing the eigen-vectors of the graph Laplacian. Graph laplacians are used to find low dimensional structures in high…
We represent in this note the solutions of the electronic Schr\"odinger equation as traces of higher-dimensional functions. This allows to decouple the electron-electron interaction potential but comes at the price of a degenerate elliptic…
We study infinite weighted graphs with view to \textquotedblleft limits at infinity,\textquotedblright or boundaries at infinity. Examples of such weighted graphs arise in infinite (in practice, that means \textquotedblleft…
We study kernel functions, and associated reproducing kernel Hilbert spaces $\mathscr{H}$ over infinite, discrete and countable sets $V$. Numerical analysis builds discrete models (e.g., finite element) for the purpose of finding…
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…
This paper extends the definitions of effective resistance and effective conductance to characterize the overall relation (positive coupling or antagonism) between any two disjoint sets of nodes in a signed graph. It generalizes the…