arXiv subjects

Marvin Plümer

Publications and source records attributed to Marvin Plümer.

8 recordsLinked to original sources

arXiv2026

Spectral minimal partitions of combinatorial graphs

This paper investigates spectral minimal partitions for weighted graphs, thus extending the extensive class of results that are currently available on domains and, to a lesser extent, manifolds and metric graphs. We provide a rigorous framework for analyzing graph Laplacians under Dirichlet, Neumann, and boundaryless energy formulations; a central focus of the study is establishing existence theorems for minimal partitions. While existence is straightforward for finite connected graphs due to the finiteness of the class of admissible partitions, infinite graphs require advanced topological and functional-analytic machinery. Specifically, we introduce the notion of canonical compactifiability, which relates to compact embeddings and uniform Poincaré-type constants for Neumann and boundaryless energies; and an appropriate notion of subgraph convergence. In this way, we can relax the spectral minimal problem on infinite graphs by reducing it to the study of finite graphs; and can, thus, guarantee that optimal spectral energies are actually attained by appropriate partitions even in non-compact settings.

math.SP↗

arXiv2025

On The Spectrum Of Infinite Quantum Graphs

We study the interplay between spectrum, geometry and boundary conditions for two distinguished self-adjoint realisations of the Laplacian on infinite metric graphs, the so-called riedrichs and Neumann extensions. We introduce a new criterion for compactness of the resolvent and apply this to identify a transition from purely discrete to non-empty essential spectrum among a class of infinite metric graphs, a phenomenon that seems to have no known counterpart for Laplacians on Euclidean domains of infinite volume. In the case of discrete spectrum we then prove upper and lower bounds on eigenvalues, thus extending a number of bounds previously only known in the compact setting to infinite graphs. Some of our bounds, for instance in terms of the inradius, are new even on compact graphs.

math.SP↗

arXiv2022

On torsional rigidity and ground-state energy of compact quantum graphs

We develop the theory of torsional rigidity -- a quantity routinely considered for Dirichlet Laplacians on bounded planar domains -- for Laplacians on metric graphs with at least one Dirichlet vertex. Using a variational characterization that goes back to Pólya, we develop surgical principles that, in turn, allow us to prove isoperimetric-type inequalities: we can hence compare the torsional rigidity of general metric graphs with that of intervals of the same total length. In the spirit of the Kohler-Jobin Inequality, we also derive sharp bounds on the ground-state energy of a quantum graph in terms of its torsional rigidity: this is particularly attractive since computing the torsional rigidity reduces to inverting a matrix whose size is the number of the graph's vertices and is, thus, much easier than computing eigenvalues.

math.SP↗

arXiv2021

On fully supported eigenfunctions of quantum graphs

We prove that every metric graph which is a tree has an orthonormal sequence of Laplace-eigenfunctions of full support. This implies that the number of nodal domains $ν_n$ of the $n$-th eigenfunction of the Laplacian with standard conditions satisfies $ν_n/n \to 1$ along a subsequence and has previously only been known in special cases such as mutually rationally dependent or rationally independent side lengths. It shows in particular that the Pleijel nodal domain asymptotics from two- or higher dimensional domains cannot occur on these graphs: Despite their more complicated topology, they still behave as in the one-dimensional case. We prove an analogous result on general metric graphs under the condition that they have at least one Dirichlet vertex. Furthermore, we generalize our results to Delta vertex conditions and to edgewise constant potentials. The main technical contribution is a new expression for a secular function in which modifications to the graph, to vertex conditions, and to the potential are particularly easy to understand.

math.SP↗

arXiv2021

Asymptotics and estimates for spectral minimal partitions of metric graphs

We study properties of spectral minimal partitions of metric graphs within the framework recently introduced in [Kennedy et al, Calc. Var. 60 (2021), 61]. We provide sharp lower and upper estimates for minimal partition energies in different classes of partitions; while the lower bounds are reminiscent of the classic isoperimetric inequalities for metric graphs, the upper bounds are more involved and mirror the combinatorial structure of the metric graph as well. Combining them, we deduce that these spectral minimal energies also satisfy a Weyl-type asymptotic law similar to the well-known one for eigenvalues of quantum graph Laplacians with various vertex conditions. Drawing on two examples we show that in general no second term in the asymptotic expansion for minimal partition energies can exist, but show that various kinds of behaviour are possible. We also study certain aspects of the asymptotic behaviour of the minimal partitions themselves.

math-ph↗

arXiv2020

On Pleijel's nodal domain theorem for quantum graphs

We establish metric graph counterparts of Pleijel's theorem on the asymptotics of the number of nodal domains $ν_n$ of the $n$-th eigenfunction(s) of a broad class of operators on compact metric graphs, including Schrödinger operators with $L^1$-potentials and a variety of vertex conditions as well as the $p$-Laplacian with natural vertex conditions, and without any assumptions on the lengths of the edges, the topology of the graph, or the behaviour of the eigenfunctions at the vertices. {Among other things, these results characterise the accumulation points of the sequence $(\frac{ν_n}{n})_{n\in\mathbb N}$, which are shown always to form a finite subset of $(0,1]$. This} extends the previously known result that $ν_n\sim n$ \textit{generically}, for certain realisations of the Laplacian, in several directions. In particular, in the special cases of the Laplacian with natural conditions, we show that for graphs with rationally dependent edge lengths, one can find eigenfunctions thereon for which ${ν_n}\not\sim {n}$; but in this case even the set of points of accumulation may depend on the choice of eigenbasis.

math.SP↗

arXiv2020

Lower Estimates on Eigenvalues of Quantum Graphs

A method for estimating the spectral gap along with higher eigenvalues of nonequilateral quantum graphs has been introduced by Amini and Cohen-Steiner recently: it is based on a new transference principle between discrete and continuous models of a graph. We elaborate on it by developing a more general transference principle and by proposing alternative ways of applying it. To illustrate our findings, we present several spectral estimates on planar metric graphs that are oftentimes sharper than those obtained by isoperimetric inequalities and further previously known methods.

math.FA↗

arXiv2020

Upper Eigenvalue Bounds for the Kirchhoff Laplacian on Embbeded Metric Graphs

We derive upper bounds for the eigenvalues of the Kirchhoff Laplacian on a compact metric graph depending on the graph's genus g. These bounds can be further improved if $g = 0$, i.e. if the metric graph is planar. Our results are based on a spectral correspondence between the Kirchhoff Laplacian and a particular a certain combinatorial weighted Laplacian. In order to take advantage of this correspondence, we also prove new estimates for the eigenvalues of the weighted combinatorial Laplacians that were previously known only in the weighted case.

math.SP↗