Papers
Topics
Authors
Recent
Search
2000 character limit reached

Differences between Robin and Neumann eigenvalues on metric graphs

Published 23 Dec 2022 in math-ph, math.MP, and math.SP | (2212.12531v2)

Abstract: We consider the Laplacian on a metric graph, equipped with Robin ($\delta$-type) vertex condition at some of the graph vertices and Neumann-Kirchhoff condition at all others. The corresponding eigenvalues are called Robin eigenvalues, whereas they are called Neumann eigenvalues if the Neumann-Kirchhoff condition is imposed at all vertices. The sequence of differences between these pairs of eigenvalues is called the Robin-Neumann gap. We prove that the limiting mean value of this sequence exists and equals a geometric quantity, analogous to the one obtained for planar domains. Moreover, we show that the sequence is uniformly bounded and provide explicit upper and lower bounds. We also study the possible accumulation points of the sequence and relate those to the associated probability distribution of the gaps. To prove our main results, we prove a local Weyl law, as well as explicit expressions for the second moments of the eigenfunction scattering amplitudes.

Citations (7)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.