Quantum graphs which optimize the spectral gap
From MaRDI portal
Publication:1675054
DOI10.1007/S00023-017-0601-2zbMATH Open1431.81055arXiv1608.00520OpenAlexW3106499786MaRDI QIDQ1675054FDOQ1675054
Publication date: 26 October 2017
Published in: Annales Henri Poincaré (Search for Journal in Brave)
Abstract: A finite discrete graph is turned into a quantum (metric) graph once a finite length is assigned to each edge and the one-dimensional Laplacian is taken to be the operator. We study the dependence of the spectral gap (the first positive Laplacian eigenvalue) on the choice of edge lengths. In particular, starting from a certain discrete graph, we seek the quantum graph for which an optimal (either maximal or minimal) spectral gap is obtained. We fully solve the minimization problem for all graphs. We develop tools for investigating the maximization problem and solve it for some families of graphs.
Full work available at URL: https://arxiv.org/abs/1608.00520
Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) General topics in linear spectral theory for PDEs (35P05) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)
Cites Work
- Periodic orbit theory and spectral statistics for quantum graphs
- Title not available (Why is that?)
- Algorithmic Aspects of Graph Connectivity
- Title not available (Why is that?)
- Extremal properties of eigenvalues for a metric graph.
- Semi-classical measures on quantum graphs and the Gauß map of the determinant manifold
- Spectral gap for quantum graphs and their edge connectivity
- On the ground state of quantum graphs with attractive \(\delta \)-coupling
- On the spectral gap of a quantum graph
- Title not available (Why is that?)
- Rayleigh estimates for differential operators on graphs
- The first eigenvalue of the \(p-\)Laplacian on quantum graphs
- Genericity of simple eigenvalues for a metric graph
- Simplicity of eigenvalues and non-vanishing of eigenfunctions of a quantum graph
- Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs
- A lower bound for nodal count on discrete and metric graphs
- Eigenvalue estimates for the Laplacian on a metric tree
- Nodal counting on quantum graphs
- Certifying 3-edge-connectivity
- Spectral analysis of metric graphs and related spaces
- Edge connectivity and the spectral gap of combinatorial and quantum graphs
- Schrödinger operators on graphs: symmetrization and Eulerian cycles
- Shape optimization problems for metric graphs
Cited In (36)
- On the decomposition of the Laplacian on metric graphs
- On torsional rigidity and ground-state energy of compact quantum graphs
- An elementary introduction to quantum graphs
- Generic Laplacian eigenfunctions on metric graphs
- Lower estimates on eigenvalues of quantum graphs
- Distinguishing cospectral quantum graphs by scattering
- Peaked and Low Action Solutions of NLS Equations on Graphs with Terminal Edges
- Variational and stability properties of constant solutions to the NLS equation on compact metric graphs
- On the hot spots of quantum graphs
- Sharp diameter bound on the spectral gap for quantum graphs
- Competing nonlinearities in NLS equations as source of threshold phenomena on star graphs
- Title not available (Why is that?)
- A theory of spectral partitions of metric graphs
- Spectral gap for quantum graphs and their edge connectivity
- Optimal potentials for quantum graphs
- Asymptotics and estimates for spectral minimal partitions of metric graphs
- Quantum trees which maximize higher eigenvalues are unbalanced
- Upper eigenvalue bounds for the Kirchhoff Laplacian on embedded metric graphs
- Surgery transformations and spectral estimates of \(\delta\) beam operators
- Interlacing and Friedlander-type inequalities for spectral minimal partitions of metric graphs
- Mean distance on metric graphs
- Nodal statistics on quantum graphs
- Surgery principles for the spectral analysis of quantum graphs
- Spectral theory for Schrödinger operators on compact metric graphs with \(\delta\) and \(\delta '\) couplings: a survey
- Laplacians on bipartite metric graphs
- A finite element method for quantum graphs
- Limits of quantum graph operators with shrinking edges
- Gluing graphs and the spectral gap: a Titchmarsh–Weyl matrix-valued function approach
- Leaky Quantum Graphs: A Review
- A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs
- Spectral estimates for infinite quantum graphs
- Quantum graphs via exercises
- The Krein-von Neumann extension for Schrödinger operators on metric graphs
- Edge switching transformations of quantum graphs—a scattering approach
- Spectral Monotonicity for Schrödinger Operators on Metric Graphs
- Impediments to diffusion in quantum graphs: Geometry-based upper bounds on the spectral gap
Recommendations
- On the spectral gap of a quantum graph 👍 👎
- Spectral gap for quantum graphs and their edge connectivity 👍 👎
- Optimal potentials for quantum graphs 👍 👎
- Title not available (Why is that?) 👍 👎
- Spectral Inequalities for Quantum Graphs 👍 👎
- Periodic quantum graphs with predefined spectral gaps 👍 👎
- Sharp diameter bound on the spectral gap for quantum graphs 👍 👎
- Quantum graph as a quantum spectral filter 👍 👎
- Edge connectivity and the spectral gap of combinatorial and quantum graphs 👍 👎
- Applications of graph spectra in quantum physics 👍 👎
This page was built for publication: Quantum graphs which optimize the spectral gap
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675054)
