Interlacing and Friedlander-type inequalities for spectral minimal partitions of metric graphs

DOI10.1007/S11005-021-01438-6zbMATH Open1472.35418arXiv2102.07585OpenAlexW3184511191MaRDI QIDQ2046836FDOQ2046836

Matthias Hofmann, James Bernard Kennedy

Publication date: 19 August 2021

Published in: Letters in Mathematical Physics (Search for Journal in Brave)

Abstract: We prove interlacing inequalities between spectral minimal energies of metric graphs built on Dirichlet and standard Laplacian eigenvalues, as recently introduced in [Kennedy et al, arXiv:2005.01126]. These inequalities, which involve the first Betti number and the number of degree one vertices of the graph, recall both interlacing and other inequalities for the Laplacian eigenvalues of the whole graph, as well as estimates on the difference between the number of nodal and Neumann domains of the whole graph eigenfunctions. To this end we study carefully the principle of cutting a graph, in particular quantifying the size of a cut as a perturbation of the original graph via the notion of its rank. As a corollary we obtain an inequality between these energies and the actual Dirichlet and standard Laplacian eigenvalues, valid for all compact graphs, which complements a version for tree graphs of Friedlander's inequalities between Dirichlet and Neumann eigenvalues of a domain. In some cases this results in better Laplacian eigenvalue estimates than those obtained previously via more direct methods.

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

zbMATH Keywords

first Betti numberLaplacian eigenvaluesspectral geometryspectral minimal partition

Mathematics Subject Classification ID

Estimates of eigenvalues in context of PDEs (35P15) Optimization of shapes other than minimal surfaces (49Q10) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35) PDEs on graphs and networks (ramified or polygonal spaces) (35R02)

Cites Work

• The number of nodal domains on quantum graphs as a stability index of graph partitions
• Title not available (Why is that?)
• Nodal domains and spectral minimal partitions
• On a class of optimal partition problems related to the Fučík spectrum and to the monotonicity formulae
• Friedlander's eigenvalue inequalities and the Dirichlet-to-Neumann semigroup
• On the spectral gap of a quantum graph
• Title not available (Why is that?)
• Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs
• A lower bound for nodal count on discrete and metric graphs
• Spectral Minimal Partitions for a Family of Tori
• Eigenvalue estimates for the Laplacian on a metric tree
• Some inequalities between Dirichlet and Neumann eigenvalues
• On an inequality between Dirichlet and Neumann eigenvalues for the Laplace operator
• Pucci eigenvalues on geodesic balls
• 10 Nodal and spectral minimal partitions – The state of the art in 2016 –
• A theory of spectral partitions of metric graphs
• On extremal eigenvalues of the graph Laplacian ^*
• On the sharpness of spectral estimates for graph Laplacians
• Edge connectivity and the spectral gap of combinatorial and quantum graphs
• Quantum graphs which optimize the spectral gap
• Minimal partitions for \(p\)-norms of eigenvalues
• Nodal statistics on quantum graphs
• Surgery principles for the spectral analysis of quantum graphs
• Asymptotics and estimates for spectral minimal partitions of metric graphs
• Analysis and Geometry on Graphs and Manifolds

Cited In (3)

• Spectral minimal partitions of unbounded metric graphs
• A theory of spectral partitions of metric graphs
• Stability of spectral partitions and the Dirichlet-to-Neumann map

This page was built for publication: Interlacing and Friedlander-type inequalities for spectral minimal partitions of metric graphs

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