Can One Hear the Shape of a Graph?
arXiv:nlin/0105020 · doi:10.1088/0305-4470/34/31/301
Abstract
We show that the spectrum of the Schrodinger operator on a finite, metric graph determines uniquely the connectivity matrix and the bond lengths, provided that the lengths are non-commensurate and the connectivity is simple (no parallel bonds between vertices and no loops connecting a vertex to itself). That is, one can hear the shape of the graph! We also consider a related inversion problem: A compact graph can be converted into a scattering system by attaching to its vertices leads to infinity. We show that the scattering phase determines uniquely the compact part of the graph, under similar conditions as above.
9 pages, 1 figure
Cited by in corpus (62)
- Quantum Graphs: Applications to Quantum Chaos and Universal Spectral Statistics
- Quantum graphs: an introduction and a brief survey
- Are Scattering Properties of Graphs Uniquely Connected to Their Shapes?
- Hearing shapes of drums - mathematical and physical aspects of isospectrality
- The Isospectral Fruits of Representation Theory: Quantum Graphs and Drums
- The trace formula for quantum graphs with general self adjoint boundary conditions
- Nodal portraits of quantum billiards: Domains, lines, and statistics
- Resolving isospectral "drums" by counting nodal domains
- Chaos in Dirac electron optics: Emergence of a relativistic quantum chimera
- The inverse scattering problem for metric graphs and the traveling salesman problem
- Linear Representations and Isospectrality with Boundary Conditions
- Nodal domains on isospectral quantum graphs: the resolution of isospectrality ?
- Scattering from isospectral quantum graphs
- Green's function approach for quantum graphs: an overview
- Quantum graphs where back-scattering is prohibited
- Hearing Euler characteristic of graphs
- Stable polynomials and crystalline measures
- Hearing the Shape of the Ising Model with a Programmable Superconducting-Flux Annealer
- Small-Energy Analysis for the Selfadjoint Matrix Schroedinger Operator on the Half Line
- Fundamental length in quantum theories with PT-symmetric Hamiltonians II: The case of quantum graphs
- High-Energy analysis and Levinson's theorem for the selfadjoint matrix Schroedinger operator on the half line
- The Nodal Count {0, 1, 2, 3,...} Implies The Graph is a Tree
- Resonances and poles in isoscattering microwave networks and graphs
- Isospectral graphs with identical nodal counts
- Scattering Theory for the matrix Schrödinger operator on the half line with general boundary conditions
- Small-energy analysis for the selfadjoint matrix Schroedinger operator on the half line. II
- Hearing Shapes via p-Adic Laplacians
- Well-Posedness and Symmetries of Strongly Coupled Network Equations
- Quantum Graphs: -symmetry and reflection symmetry of the spectrum
- Spectral analysis of metric graphs and related spaces
- Degeneracies in the length spectra of metric graphs
- A geometric construction of isospectral magnetic graphs
- Distinguishing co-spectral quantum graphs by scattering
- On the Decomposition of the Laplacian on Metric Graphs
- Edge switching transformations of quantum graphs
- Diffusion systems and heat equations on networks
- Trace Identities for the matrix Schrödinger operator on the half line with general boundary conditions
- Inverse problems in geometric graphs using internal measurements
- Quantum graphs -- Generic eigenfunctions and their nodal count and Neumann count statistics
- Inverse scattering problem for quantum graph vertices
- Inverse Steklov spectral problem for curvilinear polygons
- Recovering quantum graph spectrum from vertex data
- Hearing the shape of a quantum boundary condition
- The number of eigenvalues of the matrix Schrödinger operator on the half line with general boundary conditions
- Isospectral discrete and quantum graphs with the same flip counts and nodal counts
- Spectral Statistics of "Cellular" Billiards
- Families of isospectral and isoscattering quantum graphs
- Trace formulae for Schrodinger operators on metric graphs with applications to recovering matching conditions
- estimates for matrix Schrödinger equations
- Isospectrality for graph Laplacians under the change of coupling at graph vertices: necessary and sufficient conditions
- A Frucht's theorem for quantum graphs
- Resolvent expansions on hybrid manifolds
- Can One Hear the Spanning Trees of a Quantum Graph?
- Trace formulae for graph Laplacians with applications to recovering matching conditions
- Concrete method for recovering the Euler characteristic of quantum graphs
- GSE spectra in uni-directional quantum systems
- Inverse scattering on the quantum graph for graphene
- The Inverse Scattering Problem for the Matrix Schrödinger Equation
- Inverse scattering on the quantum graph -- Edge model for graphen
- Quantum Shape Effects
- Generating isospectral but not isomorphic quantum graphs
- Note on the role of symmetry in scattering from isospectral graphs and drums