Dynamics of nodal points and the nodal count on a family of quantum graphs
From MaRDI portal
Publication:421123
DOI10.1007/S00023-011-0124-1zbMATH Open1242.81085arXiv1008.0505OpenAlexW3099897537MaRDI QIDQ421123FDOQ421123
Authors: R. Band, Gregory Berkolaiko, Uzy Smilansky 
Publication date: 23 May 2012
Published in: Annales Henri Poincaré (Search for Journal in Brave)
Abstract: We investigate the properties of the zeros of the eigenfunctions on quantum graphs (metric graphs with a Schr"odinger-type differential operator). Using tools such as scattering approach and eigenvalue interlacing inequalities we derive several formulas relating the number of the zeros of the n-th eigenfunction to the spectrum of the graph and of some of its subgraphs. In a special case of the so-called dihedral graph we prove an explicit formula that only uses the lengths of the edges, entirely bypassing the information about the graph's eigenvalues. The results are explained from the point of view of the dynamics of zeros of the solutions to the scattering problem.
Full work available at URL: https://arxiv.org/abs/1008.0505
Recommendations
Closed and approximate solutions to the Schrödinger, Dirac, Klein-Gordon and other equations of quantum mechanics (81Q05) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)
Cites Work
- Title not available (Why is that?)
- Periodic orbit theory and spectral statistics for quantum graphs
- Title not available (Why is that?)
- Quantum graphs: I. Some basic structures
- Quantum Graphs and Their Applications
- On the number of nodal domains of random spherical harmonics
- Title not available (Why is that?)
- Kirchhoff's rule for quantum wires
- Hermitian symplectic geometry and extension theory
- The isospectral fruits of representation theory: quantum graphs and drums
- Discrete nodal domain theorems
- Resonances from perturbations of quantum graphs with rationally related edges
- Remarks on courant's nodal line theorem
- Graph models for waves in thin structures
- Dependence of the spectrum of a quantum graph on vertex conditions and edge lengths
- Resolving isospectral ‘drums’ by counting nodal domains
- Genericity of simple eigenvalues for a metric graph
- Nodal domains on graphs - How to count them and why?
- A lower bound for nodal count on discrete and metric graphs
- Quantum graphs: a simple model for chaotic scattering
- Trace formulae for quantum graphs
- Non-Weyl resonance asymptotics for quantum graphs
- Non-Weyl asymptotics for quantum graphs with general coupling conditions
- Oscillation properties of the spectrum of a boundary value problem on a graph
- Can one count the shape of a drum?
- Nodal domains on isospectral quantum graphs: the resolution of isospectrality?
- Counting nodal domains on surfaces of revolution
- Eigenvalue and nodal properties on quantum graph trees
- Some problems of the qualitative Sturm-Liouville theory on a spatial network
- Comment on ‘Resolving isospectral ‘drums’ by counting nodal domains’
- Nodal counting on quantum graphs
- Statistical properties of resonance widths for open quantum graphs
- Title not available (Why is that?)
Cited In (17)
- On Molchanov's condition for the spectrum discreteness of a quantum graph Hamiltonian with \(\delta\)-coupling
- The number of nodal domains on quantum graphs as a stability index of graph partitions
- Universality of Nodal Count Distribution in Large Metric Graphs
- Stability of eigenvalues of quantum graphs with respect to magnetic perturbation and the nodal count of the eigenfunctions
- Delay-time distribution in the scattering of time-narrow wave packets. II: Quantum graphs
- Nodal counting on quantum graphs
- Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs
- Visibility of quantum graph spectrum from the vertices
- Edge switching transformations of quantum graphs: a scattering approach
- On the hot spots of quantum graphs
- Simplicity of eigenvalues and non-vanishing of eigenfunctions of a quantum graph
- An elementary introduction to quantum graphs
- On Pleijel's nodal domain theorem for quantum graphs
- Nodal statistics on quantum graphs
- Edge-localized states on quantum graphs in the limit of large mass
- Neumann domains on quantum graphs
- The nodal count \(\{0,1,2,3,\ldots\}\) implies the graph is a tree
This page was built for publication: Dynamics of nodal points and the nodal count on a family of quantum graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q421123)
