Recovering a quantum graph spectrum from vertex data

DOI10.1088/1751-8113/48/16/165202MaRDI QIDQ5248751zbMATH OpenOpenAlexFDO

Authors Jonathan Rohleder

Publication date 8 May 2015

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1411.3835

zbMATH Keywords

Titchmarsh-Weyl function\(\delta\)-type matching conditionsSchrödinger operator on a finite compact metric graph

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Schrödinger operator, Schrödinger equation (35J10) Estimates of eigenvalues in context of PDEs (35P15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Closed and approximate solutions to the Schrödinger, Dirac, Klein-Gordon and other equations of quantum mechanics (81Q05) Eigenvalue problems for linear operators (47A75)

Abstract: We study the question to what extent spectral information of a Schr"odinger operator on a finite, compact metric graph subject to standard or $delta$-type matching conditions can be recovered from a corresponding Titchmarsh-Weyl function on the boundary of the graph. In contrast to the case of ordinary or partial differential operators, the knowledge of the Titchmarsh-Weyl function is in general not sufficient for recovering the complete spectrum of the operator (or the potentials on the edges). However, it is shown that those eigenvalues with sufficiently high (depending on the cyclomatic number of the graph) multiplicities can be recovered. Moreover, we prove that under certain additional conditions the Titchmarsh-Weyl function contains even the full spectral information.

Recommendations

• Inverse problems for quantum trees. II: Recovering matching conditions for star graphs
• On the Inverse Spectral Problems for Quantum Graphs
• Recovering the shape of a quantum graph
• Visibility of quantum graph spectrum from the vertices
• Trace formulae for Schrödinger operators on metric graphs with applications to recovering matching conditions

Cited in

(3)

• Visibility of quantum graph spectrum from the vertices
• Concrete method for recovering the Euler characteristic of quantum graphs
• A Calderón type inverse problem for tree graphs

This page was built for publication: Recovering a quantum graph spectrum from vertex data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248751)