Related papers: Spectral Theory for Discrete Lapacians
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…
We consider a metric graph $\mathcal{G}$ made of two graphs $\mathcal{G}_1$ and $\mathcal{G}_2$ attached at one point. We derive a formula relating the spectral determinant of the Laplace operator $S_\mathcal{G}(\gamma)=\det(\gamma-\Delta)$…
Laplacian Eigenvectors of the graph constructed from a data set are used in many spectral manifold learning algorithms such as diffusion maps and spectral clustering. Given a graph constructed from a random sample of a $d$-dimensional…
Graph Laplacians on finite compact metric graphs are considered under the assumption that the matching conditions at the graph vertices are of either $\delta$ or $\delta'$ type. In either case, an infinite series of trace formulae which…
We consider the relationship between the Laplacians on two sequences of planar graphs, one from the theory of self-similar groups and one from analysis on fractals. By establishing a spectral decimation map between these sequences we give…
In graph signal processing, the graph adjacency matrix or the graph Laplacian commonly define the shift operator. The spectral decomposition of the shift operator plays an important role in that the eigenvalues represent frequencies and the…
We consider topological dynamical systems over $\ZZ$ and, more generally, locally compact, $\sigma$-compact abelian groups. We relate spectral theory and diffraction theory. We first use a a recently developed general framework of…
It is reported that dynamical systems over digraphs have superior performance in terms of system damping and tolerance to time delays if the underlying graph Laplacian has a purely real spectrum. This paper investigates the topological…
We consider Laplacians on $\Z^2$-periodic discrete graphs. The following results are obtained: 1) The Floquet-Bloch decomposition is constructed and basic properties are derived. 2) The estimates of the Lebesgue measure of the spectrum in…
Embedded point spectra of rank one singular perturbations of an arbitrary self-adjoint operator A on a Hilbert space H is studied. It is shown that these perturbations can be regarded as self-adjoint extensions of a densely defined closed…
We study the $p$-independence of spectra of Laplace operators on graphs arising from regular Dirichlet forms on discrete spaces. Here, a sufficient criterion is given solely by a uniform subexponential growth condition. Moreover, under a…
We compute spectra of symmetric random matrices describing graphs with general modular structure and arbitrary inter- and intra-module degree distributions, subject only to the constraint of finite mean connectivities. We also evaluate…
We study Harper operators and the closely related discrete magnetic Laplacians (DML) on a graph with a free action of a discrete group, as defined by Sunada. The spectral density function of the DML is defined using the von Neumann trace…
We construct a family of self-adjoint operators on the prime numbers whose entries depend on pairwise arithmetic divergences, replacing geometric distance with number-theoretic dissimilarity. The resulting spectra encode how coherence…
We consider single-particle spectra of a symmetric narrow-band Anderson impurity model, where the host bandwidth $D$ is small compared to the hybridization strength $\Delta_{0}$. Simple 2nd order perturbation theory (2PT) in $U$ is found to…
We develop a graph-Hilbert-space framework, inspired by non-commutative geometry, on (infinite) graphs and use it to study spectral properies of \tit{graph-Laplacians} and so-called \tit{graph-Dirac-operators}. Putting the various pieces…
We define a (pseudo-)distance between graphs based on the spectrum of the normalized Laplacian, which is easy to compute or to estimate numerically. It can therefore serve as a rough classification of large empirical graphs into families…
Motivated by discrete Laplacian differential operators with various accuracy orders in numerical analysis, we introduce new matrices attached to a simple graph that can be considered graph Laplacians with higher accuracy. In particular, we…
We present a model for spectral theory of families of selfadjoint operators, and their corresponding unitary one-parameter groups (acting in Hilbert space.) The models allow for a scale of complexity, indexed by the natural numbers…
Laplacian operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. An infinite series of trace formulae is obtained which link together two…