A theory of spectral partitions of metric graphs
From MaRDI portal
Publication:2663595
Abstract: We introduce an abstract framework for the study of clustering in metric graphs: after suitably metrising the space of graph partitions, we restrict Laplacians to the clusters thus arising and use their spectral gaps to define several notions of partition energies; this is the graph counterpart of the well-known theory of spectral minimal partitions on planar domains and includes the setting in [Band extit{et al}, Comm. Math. Phys. extbf{311} (2012), 815--838] as a special case. We focus on the existence of optimisers for a large class of functionals defined on such partitions, but also study their qualitative properties, including stability, regularity, and parameter dependence. We also discuss in detail their interplay with the theory of nodal partitions. Unlike in the case of domains, the one-dimensional setting of metric graphs allows for explicit computation and analytic -- rather than numerical -- results. Not only do we recover the main assertions in the theory of spectral minimal partitions on domains, as studied in [Conti extit{et al}, Calc. Var. extbf{22} (2005), 45--72; Helffer extit{et al}, Ann. Inst. Henri Poincar'e Anal. Non Lin'eaire extbf{26} (2009), 101--138], but we can also generalise some of them and answer (the graph counterparts of) a few open questions.
Recommendations
- Spectral minimal partitions of unbounded metric graphs
- Asymptotics and estimates for spectral minimal partitions of metric graphs
- On spectral bounds for the \(k\)-partitioning of graphs
- Spectral radius and clique partitions of graphs
- Spectra and optimal partitions of weighted graphs
- Theorems on partitioned matrices revisited and their applications to graph spectra
- Spectral partitions on infinite graphs
- Interlacing and Friedlander-type inequalities for spectral minimal partitions of metric graphs
- Spectral analysis of metric graphs and related spaces
- scientific article; zbMATH DE number 5844285
Cites work
- A characteristic equation associated to an eigenvalue problem on c^ 2-networks
- A lower bound for nodal count on discrete and metric graphs
- An optimal partition problem for eigenvalues
- Clustering for metric graphs using the p-Laplacian
- Courant's nodal domain theorem for positivity preserving forms
- Dependence of the spectrum of a quantum graph on vertex conditions and edge lengths
- Discrete nodal domain theorems
- Extremal properties of eigenvalues for a metric graph.
- scientific article; zbMATH DE number 4050157 (Why is no real title available?)
- scientific article; zbMATH DE number 1239739 (Why is no real title available?)
- Introduction to quantum graphs
- Limits of quantum graph operators with shrinking edges
- Minimal Dirichlet energy partitions for graphs
- Minimal partitions for \(p\)-norms of eigenvalues
- Nodal and spectral minimal partitions -- The state of the art in 2016
- Nodal counting on quantum graphs
- Nodal domains and spectral minimal partitions
- On a class of optimal partition problems related to the Fučík spectrum and to the monotonicity formulae
- On a magnetic characterization of spectral minimal partitions
- On the ground state for quantum graphs
- On the inverse scattering problem on branching graphs
- On the spectral gap of a quantum graph
- Optimal partitions for Robin Laplacian eigenvalues
- Pleijel's nodal domain theorem for Neumann and Robin eigenfunctions
- Quantum graphs which optimize the spectral gap
- Rayleigh estimates for differential operators on graphs
- Remarks on courant's nodal line theorem
- Remarks on two notions of spectral minimal partitions
- Semigroup methods for evolution equations on networks
- Spectral estimates for infinite quantum graphs
- Spectral gap for quantum graphs and their edge connectivity
- Surgery principles for the spectral analysis of quantum graphs
- The nodal count \(\{0,1,2,3,\ldots\}\) implies the graph is a tree
- The number of nodal domains on quantum graphs as a stability index of graph partitions
- The spectrum of the Laplacian: A geometric approach
Cited in
(21)- 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
- Neumann domains on quantum graphs
- On the hot spots of quantum graphs
- Stability of spectral partitions and the Dirichlet-to-Neumann map
- Minimal Dirichlet energy partitions for graphs
- A general method to obtain the spectrum and local spectra of a graph from its regular partitions
- Clustering for metric graphs using the p-Laplacian
- A Spectral Lower Bound for the Divisorial Gonality of Metric Graphs
- Network partition via a bound of the spectral radius
- Doubly nonlinear Schrödinger ground states on metric graphs
- Surgery principles for the spectral analysis of quantum graphs
- Ground states for the NLS equation with combined local nonlinearities on noncompact metric graphs
- Spectral minimal partitions of unbounded metric graphs
- Vertex partitions of metric spaces with finite distance sets
- Geometric spectral theory of quantum graphs
- Local minimizers for the NLS equation with localized nonlinearity on noncompact metric graphs
- Yamabe systems, optimal partitions and nodal solutions to the Yamabe equation
- Cheeger cuts and Robin spectral minimal partitions of metric graphs
- Optimal eigenvalues on a metric graph with densities
This page was built for publication: A theory of spectral partitions of metric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2663595)
