Dependence of the spectrum of a quantum graph on vertex conditions and edge lengths

@article{Berkolaiko2010DependenceOT,
  title={Dependence of the spectrum of a quantum graph on vertex conditions and edge lengths},
  author={Gregory Berkolaiko and Peter Kuchment},
  journal={arXiv: Mathematical Physics},
  year={2010}
}
We study the dependence of the quantum graph Hamiltonian, its resolvent, and its spectrum on the vertex conditions and graph edge lengths. In particular, several results on the interlacing (bracketing) of the spectra of graphs with different vertex conditions are obtained and their applications are discussed. 

Figures from this paper

Eigenvalue estimates on quantum graphs

On a finite connected metric graph, we establish upper bounds for the eigenvalues of the Laplacian. These bounds depend on the length, the Betti number, and the number of pendant vertices. For trees,

Spectral gaps for star-like quantum graph and for two coupled rings

A BSTRACT The spectral problems for two types of quantum graphs are considered. We deal with star-like graph and a graph consisting of two rings connected through a segment. The spectral gap, i.e.

Dynamics of Nodal Points and the Nodal Count on a Family of Quantum Graphs

We investigate the properties of the zeros of the eigenfunctions on quantum graphs (metric graphs with a Schrödinger-type differential operator). Using tools such as scattering approach and

Surgery transformations and eigenvalue estimates for quantum graphs with $\delta'$ vertex interactions

ABSTRACT. We extend the surgical tool box for quantum graphs to anti-standard and δ vertex conditions. Monotonicity properties of eigenvalues of graph Laplacian with δ interactions at vertices depend

SIMPLICITY OF EIGENVALUES AND NON-VANISHING OF EIGENFUNCTIONS OF A QUANTUM GRAPH

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

SIMPLICITY OF EIGENVALUES AND NON-VANISHING OF EIGENFUNCTIONS OF A QUANTUM GRAPH

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

SIMPLICITY OF EIGENVALUES AND NON-VANISHING OF EIGENFUNCTIONS OF A QUANTUM GRAPH

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

Sharp diameter bound on the spectral gap for quantum graphs

We establish an upper bound on the spectral gap for compact quantum graphs which depends only on the diameter and total number of vertices. This bound is asymptotically sharp for pumpkin chains with

An elementary introduction to quantum graphs

We describe some basic tools in the spectral theory of Schr\"odinger operator on metric graphs (also known as "quantum graph") by studying in detail some basic examples. The exposition is kept as

References

SHOWING 1-10 OF 29 REFERENCES

Quantum graphs: I. Some basic structures

A quantum graph is a graph equipped with a self-adjoint differential or pseudo-differential Hamiltonian. Such graphs have been studied recently in relation to some problems of mathematics, physics

Eigenvalue bracketing for discrete and metric graphs

Index theorems for quantum graphs

In geometric analysis, an index theorem relates the difference of the numbers of solutions of two differential equations to the topological structure of the manifold or bundle concerned, sometimes

A Lower Bound for Nodal Count on Discrete and Metric Graphs

The number of nodal domains (maximal connected regions on which a function has constant sign) of the eigenfunctions of Schrödinger operators on graphs is shown to be bounded below by n, where ℓ is the number of links that distinguish the graph from a tree.

Quantum graphs: an introduction and a brief survey

Eigenvalue and nodal properties on quantum graph trees

We consider the Schrödinger operator on a finite tree with linear separate (e.g. Dirichlet or Neumann) conditions at the boundary. The potential q is assumed to be real-valued, positive and finite.

First Order Approach and Index Theorems for Discrete and Metric Graphs

  • O. Post
  • Mathematics, Computer Science
  • 2007
The notion of exterior derivative, differential forms, Dirac and Laplace operators in the discrete and metric case, using a supersymmetric framework is developed, and the (supersymmetric) index of the discrete Dirac operator generalising the standard index formula involving the Euler characteristic of a graph is calculated.

Quantum graphs

This special section of Waves in Random Media is devoted to quantum graphs and their applications. We use the name quantum graph for a graph considered as one-dimensional (rather than just a purely

Hermitian symplectic geometry and extension theory

Here we give brief account of Hermitian symplectic spaces, showing that they are intimately connected to symmetric as well as self-adjoint extensions of a symmetric operator. Furthermore, we find an

Kirchhoff's rule for quantum wires

We formulate and discuss one-particle quantum scattering theory on an arbitrary finite graph with n open ends and where we define the Hamiltonian to be (minus) the Laplace operator with general