Simplicity of eigenvalues and non-vanishing of eigenfunctions of a quantum graph
From MaRDI portal
(Redirected from Publication:323869)
Abstract: We prove that after an arbitrarily small adjustment of edge lengths, the spectrum of a compact quantum graph with -type vertex conditions can be simple. We also show that the eigenfunctions, with the exception of those living entirely on a looping edge, can be made to be non-vanishing on all vertices of the graph. As an application of the above result, we establish that the secular manifold (also called "determinant manifold") of a large family of graphs has exactly two smooth connected components.
Recommendations
Cites work
- scientific article; zbMATH DE number 3140172 (Why is no real title available?)
- A lower bound for nodal count on discrete and metric graphs
- Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs
- Dependence of the spectrum of a quantum graph on vertex conditions and edge lengths
- Dynamics of nodal points and the nodal count on a family of quantum graphs
- Eigenfunctions of Laplace operators
- Generic Properties of Eigenfunctions
- Genericity of simple eigenvalues for a metric graph
- Graph Laplacians and topology
- Introduction to quantum graphs
- Nodal domains on graphs - How to count them and why?
- On the ground state of quantum graphs with attractive -coupling
- On the level spacing distribution in quantum graphs.
- Periodic orbit theory and spectral statistics for quantum graphs
- Semi-classical measures on quantum graphs and the Gauß map of the determinant manifold
- Simple spectrum and Rayleigh quotients
- Stability of eigenvalues of quantum graphs with respect to magnetic perturbation and the nodal count of the eigenfunctions
- The nodal count \(\{0,1,2,3,\ldots\}\) implies the graph is a tree
- Two-point spectral correlations for star graphs
Cited in
(29)- Ground state and orbital stability for the NLS equation on a general starlike graph with potentials
- Edge connectivity and the spectral gap of combinatorial and quantum graphs
- Rényi and Tsallis entropies related to eigenfunctions of quantum graphs
- Universality of Nodal Count Distribution in Large Metric Graphs
- Non-compact quantum graphs with summable matrix potentials
- Generic Laplacian eigenfunctions on metric graphs
- From the AKNS system to the matrix Schrödinger equation with vanishing potentials: Direct and inverse problems
- Exotic eigenvalues of shrinking metric graphs
- Visibility of quantum graph spectrum from the vertices
- A matrix Schrödinger approach to focusing nonlinear Schrödinger equations with nonvanishing boundary conditions
- On the hot spots of quantum graphs
- Eigenspaces of symmetric graphs are not typically irreducible
- Quantum graphs which optimize the spectral gap
- On topological bound states and secular equations for quantum-graph eigenvalues
- Optimizing the fundamental eigenvalue gap of quantum graphs
- On the lack of bound states for certain NLS equations on metric graphs
- Topological resonances on quantum graphs
- An elementary introduction to quantum graphs
- Inverse nodal problems for Sturm–Liouville operators on quantum star graphs
- First-order asymptotic perturbation theory for extensions of symmetric operators
- On Pleijel's nodal domain theorem for quantum graphs
- Nodal statistics on quantum graphs
- Surgery principles for the spectral analysis of quantum graphs
- Neumann domains on quantum graphs
- On fully supported eigenfunctions of quantum graphs
- The Green function for simplest quantum graphs
- Genericity of simple eigenvalues for a metric graph
- Polynomial splines and eigenvalue approximations on quantum graphs
- A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs
This page was built for publication: Simplicity of eigenvalues and non-vanishing of eigenfunctions of a quantum graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323869)
