Related papers: Spectral gap for quantum graphs and their connecti…
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)$…
In this paper, we study the problem of scattering by several strictly convex obstacles, with smooth boundary and satisfying a non eclipse condition. We show, in dimension 2 only, the existence of a spectral gap for the meromorphic…
We obtain new bounds for the Laplacian spectral radius of a signed graph. Most of these new bounds have a dependence on edge sign, unlike previously known bounds, which only depend on the underlying structure of the graph. We then use some…
The paper is concerned with the number of open gaps in spectra of periodic quantum graphs. The well-known conjecture by Bethe and Sommerfeld (1933) says that the number of open spectral gaps for a system periodic in more than one direction…
Kirchhoff showed that the number of spanning trees of a graph is the spectral determinant of the combinatorial Laplacian divided by the number of vertices; we reframe this result in the quantum graph setting. We prove that the spectral…
We study the dependence of the quantum graph Hamiltonian, its resolvent, and its spectrum on the vertex conditions and graph edge lengths. In particular, several results on the interlacing (bracketing) of the spectra of graphs with…
The spectral theory of quantum graphs is related via an exact trace formula with the spectrum of the lengths of periodic orbits (cycles) on the graphs. The latter is a degenerate spectrum, and understanding its structure (i.e.,finding out…
In this paper, we demonstrate a useful interaction between the theory of clique partitions, edge clique covers of a graph, and the spectra of graphs. Using a clique partition and an edge clique cover of a graph we introduce the notion of a…
The principal ratio of a connected graph $G$, $\gamma(G)$, is the ratio between the largest and smallest coordinates of the principal eigenvector of the adjacency matrix of $G$. Over all connected graphs on $n$ vertices, $\gamma(G)$ ranges…
This paper explores interlacing inequalities in the Laplacian spectrum of signed cycles and investigates interlacing relationship between the spectrum of the net-Laplacian of a signed graph and its subgraph formed by removing a vertex…
We are interested in the general question: to what extent are the spectral properties of a graph connected to the distance function? Our motivation is a concrete example of this question that is due to Steinerberger. We provide some…
Can one reduce the size of a graph without significantly altering its basic properties? The graph reduction problem is hereby approached from the perspective of restricted spectral approximation, a modification of the spectral similarity…
We investigate spectral properties of the Laplace operator on a class of non-compact Riemannian manifolds. For a given number $N$ we construct periodic (i.e. covering) manifolds such that the essential spectrum of the corresponding…
For a connected graph $G$ and $\alpha\in [0,1)$, the distance $\alpha$-spectral radius of $G$ is the spectral radius of the matrix $D_{\alpha}(G)$ defined as $D_{\alpha}(G)=\alpha T(G)+(1-\alpha)D(G)$, where $T(G)$ is a diagonal matrix of…
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…
Periodic $2$nd order ordinary differential operators on $\R$ are known to have the edges of their spectra to occur only at the spectra of periodic and antiperiodic boundary value problems. The multi-dimensional analog of this property is…
We estimate the size of the spectral gap at zero for some Hermitian block matrices. Included are quasi-definite matrices, quasi-semidefinite matrices (the closure of the set of the quasi-definite matrices) and some related block matrices…
We study the spectral gap behavior of an operator obtained by summing a random permutation $M$ and a deterministic bistochastic matrix $Q$. We are interested in the asymptotic in terms of dimension. In the case where $(M,Q)$ are…
We propose an efficient heuristic for mapping the logical qubits of quantum algorithms to the physical qubits of connectivity-limited devices, adding a minimal number of connectivity-compliant SWAP gates. In particular, given a quantum…
The spectral gap of local random quantum circuits is a fundamental property that determines how close the moments of the circuit's unitaries match those of a Haar random distribution. When studying spectral gaps, it is common to bound these…