Quasi-isospectrality on Quantum Graphs

  title={Quasi-isospectrality on Quantum Graphs},
  author={Ralf Rueckriemen},
  journal={The Journal of Geometric Analysis},
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 eigenvalue-spectra and the length-spectra of the two quantum graphs are completely identical. Similarly, if their length-spectra agree everywhere aside from a sufficiently sparse set, then the quantum graphs have the same eigenvalue-spectrum and length-spectrum. 
2 Citations

Figures from this paper

Asymptotically isospectral quantum graphs and generalised trigonometric polynomials
Abstract The theory of almost periodic functions is used to investigate spectral properties of Schrodinger operators on metric graphs, also known as quantum graphs. In particular we prove that twoExpand
The nodal count {0,1,2,3,…} implies the graph is a tree
  • R. Band
  • Mathematics, Physics
  • Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2014
It is shown that it is not possible for all (or even almost all, in the metric case) the eigenvalues to exhibit a diamagnetic behaviour, and the converse theorems for both discrete and metric graphs are proved. Expand


Trace formulae for quantum graphs
Quantum graph models are based on the spectral theory of (differential) Laplace operators on metric graphs. We focus on compact graphs and survey various forms of trace formulae that relate LaplaceExpand
The Trace Formula for Quantum Graphs with General Self Adjoint Boundary Conditions
Abstract.We consider compact metric graphs with an arbitrary self adjoint realisation of the differential Laplacian. After discussing spectral properties of Laplacians, we prove several versions ofExpand
Periodic Orbit Theory and Spectral Statistics for Quantum Graphs
Abstract We quantize graphs (networks) which consist of a finite number of bonds and vertices. We show that the spectral statistics of fully connected graphs is well reproduced by random matrixExpand
Quantum graphs: Applications to quantum chaos and universal spectral statistics
During the last few years quantum graphs have become a paradigm of quantum chaos with applications from spectral statistics to chaotic scattering and wavefunction statistics. In the first part ofExpand
Quantum Wires with Magnetic Fluxes
Abstract: In the present article magnetic Laplacians on a graph are analyzed. We provide a complete description of the set of all operators which can be obtained from a given self-adjoint LaplacianExpand
Heat kernels on metric graphs and a Trace Formula
We study heat semigroups generated by self-adjoint Laplace operators on metric graphs characterized by the property that the local scattering matrices associated with each vertex of the graph areExpand
On a Spectral Analog of the Strong Multiplicity One Theorem
We prove spectral analogs of the classical strong multiplicity one theorem for newforms. Let Γ 1 and Γ 2 be uniform lattices in a semisimple group G. Suppose all but finitely many irreducible unitaryExpand
Can one hear the shape of a graph
We show that the spectrum of the Schroperator on a finite, metric graph determines uniquely the connectivity matrix and the bond lengths, provided that the lengths are non-commensurate and theExpand
Nodal domains on isospectral quantum graphs: the resolution of isospectrality ?
We present and discuss isospectral quantum graphs which are not isometric. These graphs are the analogues of the isospectral domains in which were introduced recently in Gordon et al (1992 Bull. Am.Expand
A refinement of strong multiplicity one for spectra of hyperbolic manifolds
Let $\calM_1$ and $\calM_2$ denote two compact hyperbolic manifolds. Assume that the multiplicities of eigenvalues of the Laplacian acting on $L^2(\calM_1)$ and $L^2(\calM_2)$ (respectively,Expand