A theory of spectral partitions of metric graphs

DOI10.1007/S00526-021-01966-YzbMath1462.35222arXiv2005.01126OpenAlexW3141730740WikidataQ115386686 ScholiaQ115386686MaRDI QIDQ2663595

Delio Mugnolo, Pavel Kurasov, James Bernard Kennedy, Corentin Léna

Publication date: 19 April 2021

Published in: Calculus of Variations and Partial Differential Equations (Search for Journal in Brave)

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

zbMATH Keywords

Dirichlet Laplacian on graphs

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)

Related Items (10)

Doubly nonlinear Schrödinger ground states on metric graphs ⋮ Stability of spectral partitions and the Dirichlet-to-Neumann map ⋮ Ground states for the NLS equation with combined local nonlinearities on noncompact metric graphs ⋮ Spectral minimal partitions of unbounded metric graphs ⋮ Neumann domains on quantum graphs ⋮ On the hot spots of quantum graphs ⋮ Asymptotics and estimates for spectral minimal partitions of metric graphs ⋮ Interlacing and Friedlander-type inequalities for spectral minimal partitions of metric graphs ⋮ On Pleijel's nodal domain theorem for quantum graphs ⋮ Surgery principles for the spectral analysis of quantum graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the spectral gap of a quantum graph
• Clustering for metric graphs using the \(p\)-Laplacian
• On a magnetic characterization of spectral minimal partitions
• Rayleigh estimates for differential operators on graphs
• The number of nodal domains on quantum graphs as a stability index of graph partitions
• A lower bound for nodal count on discrete and metric graphs
• Nodal domains and spectral minimal partitions
• Spectral estimates for infinite quantum graphs
• Minimal partitions for \(p\)-norms of eigenvalues
• Quantum graphs which optimize the spectral gap
• On a class of optimal partition problems related to the Fučík spectrum and to the monotonicity formulae
• Extremal properties of eigenvalues for a metric graph.
• Optimal partitions for Robin Laplacian eigenvalues
• A characteristic equation associated to an eigenvalue problem on \(c^ 2\)-networks
• On the ground state for quantum graphs
• Courant's nodal domain theorem for positivity preserving forms
• Limits of quantum graph operators with shrinking edges
• Pleijel's nodal domain theorem for Neumann and Robin eigenfunctions
• Semigroup methods for evolution equations on networks
• An optimal partition problem for eigenvalues
• Minimal Dirichlet Energy Partitions for Graphs
• The nodal count {0,1,2,3,…} implies the graph is a tree
• Remarks on courant's nodal line theorem
• On the inverse scattering problem on branching graphs
• The spectrum of the Laplacian: A geometric approach
• Surgery principles for the spectral analysis of quantum graphs
• Spectral gap for quantum graphs and their edge connectivity
• 10 Nodal and spectral minimal partitions – The state of the art in 2016 –
• Nodal counting on quantum graphs
• Dependence of the spectrum of a quantum graph on vertex conditions and edge lengths
• Discrete nodal domain theorems

This page was built for publication: A theory of spectral partitions of metric graphs