Related papers: A potential theory on weighted graphs
An old problem in mathematical physics deals with the structure of the dispersion relation of the Schr\"odinger operator $-\Delta+V(x)$ in $R^n$ with periodic potential near the edges of the spectrum. A well known conjecture says that…
The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In this paper, a spectral graph analogy to Heisenberg's celebrated uncertainty principle is developed.…
We study a class of delta-like perturbations of the Laplacian on the half-line, characterized by Robin boundary conditions at the origin. Using the formalism of nonstandard analysis, we derive a simple connection with a suitable family of…
Differential operators acting on functions defined on graphs by different studies do not form a consistent framework for the analysis of real or complex functions in the sense that they do not satisfy the Leibniz rule of any order. In this…
The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…
This work deals with Schr\"odinger equations with quadratic and sub-quadratic Hamiltonians perturbed by a potential. In particular we shall focus on bounded, but not necessarily smooth perturbations. We shall give a representation of such…
In this paper, we study the graph-theoretic analogues of vector Laplacian (or Helmholtz operator) and vector Laplace equation. We determine the graph matrix representation of vector Laplacian and obtain the dimension of solution space of…
We establish various nodal domain theorems for $p$-Laplacians on signed graphs, which unify most of the existing results on nodal domains of graph $p$-Laplacians and arbitrary symmetric matrices. Based on our nodal domain estimates, we…
We study the adjoint of the double layer potential associated with the Laplacian (the adjoint of the Neumann-Poincar\'e operator), as a map on the boundary surface $\Gamma$ of a domain in $\mathbb{R}^3$ with conical points. The spectrum of…
Motivated by potential theory on discrete spaces, we study a family of unbounded Hermitian operators in Hilbert space which generalize the usual graph-theoretic discrete Laplacian. These operators are discrete analogues of the classical…
We continue our study of matrix models of dually weighted graphs. Among the attractive features of these models is the possibility to interpolate between ensembles of regular and random two-dimensional lattices, relevant for the study of…
We introduce the weighted graph Laplacian and the notion of Schr\"odinger operator on a locally finite weighted graph . Concerning essential self-adjointness, we extend Wojciechowski's and Dodziuk's results for graphs with vertex constant…
Topological spaces, represented by simplicial complexes, capture richer relationships than graphs by modeling interactions not only between nodes but also among higher-order entities, such as edges or triangles. This motivates the…
In this paper, we introduce the notion of oriented faces especially triangles in a connected oriented locally finite graph. This framework then permits to define the Laplace operator on this structure of the 2-simplicial complex. We develop…
This expository essay discusses a finite dimensional approach to dilation theory. How much of dilation theory can be worked out within the realm of linear algebra? It turns out that some interesting and simple results can be obtained. These…
In a previous paper by one of us, a "compact version" of Rubio de Francia's weighted extrapolation theorem was proved, which allows one to extrapolate the compactness of an operator from just one space to the full range of weighted spaces,…
We characterize the essential spectrum of the plasmonic problem for polyhedra in $\mathbb{R}^3$. The description is particularly simple for convex polyhedra and permittivities $\epsilon < - 1$. The plasmonic problem is interpreted as a…
A key feature of neural network architectures is their ability to support the simultaneous interaction among large numbers of units in the learning and processing of representations. However, how the richness of such interactions trades off…
How might one "reduce" a graph? That is, generate a smaller graph that preserves the global structure at the expense of discarding local details? There has been extensive work on both graph sparsification (removing edges) and graph…
We consider a Laplacian on periodic discrete graphs. Its spectrum consists of a finite number of bands. In a class of periodic 1-forms, i.e., functions defined on edges of the periodic graph, we introduce a subclass of minimal forms with a…