Related papers: A note on Spectral Analysis of Quantum graphs
It is shown the stability of the essential self-adjointness, and an inclusion of the essential spectra of Laplacians under the change of Riemannian metric on a subset K of M. The set K may have infinite volume measured with the new metric…
We study the spectral geometric properties of the scalar Laplace-Beltrami operator associated to the Weil-Petersson metric $g_{\mathrm{WP}}$ on $\mathcal M_\gamma$, the Riemann moduli space of surfaces of genus $\gamma > 1$. This space has…
In this thesis, we study Laplacian eigenfunctions on metric graphs, also known as quantum graphs. We restrict the discussion to standard quantum graphs. These are finite connected metric graphs with functions that satisfy Neumann vertex…
How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian matrices are close. The achieved approximation is shown to…
A finite dimensional operator that commutes with some symmetry group admits quotient operators, which are determined by the choice of associated representation. Taking the quotient isolates the part of the spectrum supporting the chosen…
We consider symmetric powers of a graph. In particular, we show that the spectra of the symmetric square of strongly regular graphs with the same parameters are equal. We also provide some bounds on the spectra of the symmetric squares of…
In this note we elaborate on some notions of surface area for discrete graphs which are closely related to the inverse degree. These notions then naturally lead to associated connectivity measures of graphs and to the definition of a…
Learning a graph with a specific structure is essential for interpretability and identification of the relationships among data. It is well known that structured graph learning from observed samples is an NP-hard combinatorial problem. In…
In this article we consider the spectrum of a Laplacian matrix, also known as the Markov matrix, under the independence assumption. We assume that the entries have a variance profile. Motivated by recent works on generalized Wigner matrices…
Because of the significant increase in size and complexity of the networks, the distributed computation of eigenvalues and eigenvectors of graph matrices has become very challenging and yet it remains as important as before. In this paper…
We establish two results concerning the Quantum Limits (QLs) of some sub-Laplacians. First, under a commutativity assumption on the vector fields involved in the definition of the sub- Laplacian, we prove that it is possible to split any QL…
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 provide a unified method to study the adjacency matrices of regular graphs (including infinite ones) using holomorphic functional calculus. By applying this calculus on a specific ellipse that contains the spectrum, we derive an…
We locate gaps in the spectrum of a Hamiltonian on a periodic cuboidal (and generally hyperrectangular) lattice graph with $\delta$ couplings in the vertices. We formulate sufficient conditions under which the number of gaps is finite. As…
The explicit solution to the spectral problem of quantum graphs found recently in \cite{Anima}, is used to produce the exact periodic orbit theory description for the probability distributions of spectral statistics, including the…
The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a ``transmission`` system. A transmission system is a mathematical representation of a means of transmitting…
We prove a spectral decomposition theorem for a well-known self-similar graph, for some finite graphs which are quotients of this graph and for a compactification of it.
This book is devoted to the spectral analysis of the magnetic Laplacian in various geometric situations. In particular the influence of the geometry on the discrete spectrum is analysed in many asymptotic regimes.
We study Laplacians associated to a graph and single out a class of such operators with special regularity properties. In the case of locally finite graphs, this class consists of all selfadjoint, non-negative restrictions of the standard…
Given a graph Laplacian with positively and negatively weighted edges we are interested in characterizing the set of weights that give a particular spectral index, i.e.~give a prescribed number of positive, zero, and negative eigenvalues.…