Papers
Topics
Authors
Recent
Search
2000 character limit reached

Neumann Domains on Quantum Graphs

Published 27 Nov 2019 in math-ph and math.MP | (1911.12435v2)

Abstract: The Neumann points of an eigenfunction $f$ on a quantum (metric) graph are the interior zeros of $f'$. The Neumann domains of $f$ are the sub-graphs bounded by the Neumann points. Neumann points and Neumann domains are the counterparts of the well-studied nodal points and nodal domains. We prove some foundational results in this field: bounds on the number of Neumann points and properties of the probability distribution of this number. Two basic properties of Neumann domains are presented: the wavelength capacity and the spectral position. We state and prove bounds on those as well as key features of their probability distributions. To rigorously investigate those probabilities, we establish the notion of random variables for quantum graphs. In particular, we provide conditions for considering spectral functions of quantum graphs as random variables with respect to the natural density on $\mathbb{N}$.

Summary

Paper to Video (Beta)

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 (2)

Collections

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