Related papers: Spectral Estimates for Infinite Quantum Graphs
Consider two quantum graphs with the standard Laplace operator and non-Robin type boundary conditions at all vertices. We show that if their eigenvalue-spectra agree everywhere aside from a sufficiently sparse set, then the…
We study the statistical properties of the scattering matrix associated with generic quantum graphs. The scattering matrix is the quantum analogue of the classical evolution operator on the graph. For the energy-averaged spectral form…
The aim of this paper is twofold. First, we study eigenvalues and eigenvectors of the adjacency matrix of a bond percolation graph when the base graph is finite and well approximated locally by an infinite regular graph. We relate…
In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…
We study a set of scattering matrices of quantum graphs containing minimal number of passbands, i.e., maximal number of zero elements. The cases of even and odd vertex degree are considered. Using a solution of inverse scattering problem,…
We study a natural discrete Bochner-type inequality on graphs, and explore its merit as a notion of curvature in discrete spaces. An appealing feature of this discrete version seems to be that it is fairly straightforward to compute this…
We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…
In this paper we establish spectral comparison results for Schr\"odinger operators on a certain class of infinite quantum graphs, using recent results obtained in the finite setting. We also show that new features do appear on infinite…
We prove that the spectrum of an individual chaotic quantum graph shows universal spectral correlations, as predicted by random--matrix theory. The stability of these correlations with regard to non--universal corrections is analyzed in…
Here we study the spectral properties of an underlying weighted graph of a non-uniform hypergraph by introducing different connectivity matrices, such as adjacency, Laplacian and normalized Laplacian matrices. We show that different…
We study topological Poincar\'e type inequalities on general graphs. We characterize graphs satisfying such inequalities and then turn to the best constants in these inequalities. Invoking suitable metrics we can interpret these constants…
Consider a sequence of finite regular graphs (GN) converging, in the sense of Benjamini-Schramm, to the infinite regular tree. We study the induced quantum graphs with equilateral edge lengths, Kirchhoff conditions (possibly with a non-zero…
We investigate spectral properties of quantum graphs in the form of a periodic chain of rings with a connecting link between each adjacent pair, assuming that wave functions at the vertices are matched through conditions manifestly…
In this paper, we introduce Cheeger type constants via isocapacitary constants introduced by Maz'ya to estimate first Dirichlet, Neumann and Steklov eigenvalues on a finite subgraph of a graph. Moreover, we estimate the bottom of the…
We consider magnetic Schroedinger operators on quantum graphs with identical edges. The spectral problem for the quantum graph is reduced to the discrete magnetic Laplacian on the underlying combinatorial graph and a certain Hill operator.…
We discuss Laplacian spectrum on a finite metric graph with vertex couplings violating the time-reversal invariance. For the class of star graphs we determine, under the condition of a fixed total edge length, the configurations for which…
We study the spectral statistics of quantum (metric) graphs whose vertices are equipped with preferred orientation vertex conditions. When comparing their spectral statistics to those predicted by suitable random matrix theory ensembles,…
The quantum chromatic number, $\chi_q(G)$, of a graph $G$ was originally defined as the minimal number of colors necessary in a quantum protocol in which two provers that cannot communicate with each other but share an entangled state can…
Kirchoff's matrix tree theorem of 1847 connects the number of spanning trees of a graph to the spectral determinant of the discrete Laplacian [22]. Recently an analogue was obtained for quantum graphs relating the number of spanning trees…
We introduce a set of multi-way dual Cheeger constants and prove universal higher-order dual Cheeger inequalities for eigenvalues of normalized Laplace operators on weighted finite graphs. Our proof proposes a new spectral clustering…