Related papers: A Hilbert space approach to effective resistance m…
In this paper, we study the performance of an energy efficient wireless communication system, assisted by a finite-element-intelligent reflecting surface (IRS). With no instantaneous channel state information (CSI) at the transmitter, we…
We investigate the effective resistance $R_n$ and conductance $C_n$ between the root and leaves of a binary tree of height $n$. In this electrical network, the resistance of each edge $e$ at distance $d$ from the root is defined by…
In this paper, we consider regression models with a Hilbert-space-valued predictor and a scalar response, where the response depends on the predictor only through a finite number of projections. The linear subspace spanned by these…
We develop a mathematical framework to address a broad class of metric and preference learning problems within a Hilbert space. We obtain a novel representer theorem for the simultaneous task of metric and preference learning. Our key…
This paper studies the "energy space" $\mathcal{H}_{\mathcal{E}}$ (the Hilbert space of functions of finite energy, aka the Dirichlet-finite functions) on an infinite network (weighted connected graph), from the point of view of the…
Development of metrics for structural data-generating mechanisms is fundamental in machine learning and the related fields. In this paper, we give a general framework to construct metrics on random nonlinear dynamical systems, defined with…
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…
We develop parametric classes of covariance functions on linear networks and their extension to graphs with Euclidean edges, i.e., graphs with edges viewed as line segments or more general sets with a coordinate system allowing us to…
We consider (locally) energy finite coordinates associated with a strongly local regular Dirichlet form on a metric measure space. We give coordinate formulas for substitutes of tangent spaces, for gradient and divergence operators and for…
The classical electromagnetic modes outside a long, straight, superconducting cosmic string are calculated, assuming the string to be surrounded by a superconducting cylindric surface of radius R. Thereafter, by use of a Bogoliubov-type…
We study the boundary theory of a connected weighted graph $G$ from the viewpoint of stochastic integration. For the Hilbert space \HE of Dirichlet-finite functions on $G$, we construct a Gel'fand triple $S \ci {\mathcal H}_{\mathcal E} \ci…
Given a resistor network on $\mathbb Z^d$ with nearest-neighbor conductances, the effective conductance in a finite set with a given boundary condition is the the minimum of the Dirichlet energy over functions with the prescribed boundary…
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…
A framework for estimation and hypothesis testing of functional restrictions against general alternatives is proposed. The parameter space is a reproducing kernel Hilbert space (RKHS). The null hypothesis does not necessarily define a…
A framework for coherent pattern extraction and prediction of observables of measure-preserving, ergodic dynamical systems with both atomic and continuous spectral components is developed. It is based on an approximation of the generator of…
Given a resistive electrical network, we would like to determine whether all the resistances (edges) in the network are working, and if not, identify which edge (or edges) are faulty. To make this determination, we are allowed to measure…
Physical networks can develop diverse responses, or functions, by design, evolution or learning. We focus on electrical networks of nodes connected by resistive edges. Such networks can learn by adapting edge conductances to lower a cost…
$ \def\vecc#1{\boldsymbol{#1}} $We design a polynomial time algorithm that for any weighted undirected graph $G = (V, E,\vecc w)$ and sufficiently large $\delta > 1$, partitions $V$ into subsets $V_1, \ldots, V_h$ for some $h\geq 1$, such…
For a simple graph $G=(V,E)$ and edge $e\in E$, the effective resistance is defined as a ratio $\frac{\tau(G/e)}{\tau(G)}$, where $\tau(G)$ denotes the number of spanning trees in $G$. We resolve the inverse problem for the effective…
We define and study two new kinds of "effective resistances" based on hubs-biased -- hubs-repelling and hubs-attracting -- models of navigating a graph/network. We prove that these effective resistances are squared Euclidean distances…