Nodal domains on quantum graphs
Sven Gnutzmann, Uzy Smilansky, Joachim Weber
Abstract
We consider the real eigenfunctions of the Schrödinger operator on graphs, and count their nodal domains. The number of nodal domains fluctuates within an interval whose size equals the number of bonds B. For well connected graphs, with incommensurate bond lengths, the distribution of the number of nodal domains in the interval mentioned above approaches a Gaussian distribution in the limit when the number of vertices is large. The approach to this limit is not simple, and we discuss it in detail. At the same time we define a random wave model for graphs, and compare the predictions of this model with analytic and numerical computations.
Create a lesson
Related papers
Ordinal-pattern transition networks as a symbolic substrate for reservoir computing
Max Potratzki, Thomas G. de Jong, Michael Small et al.
A general feedback mechanism unifying stochasticity, long transients, and resilience
Misha Chai, Holger Kantz
Statistical Characterization of Erratic and Chaotic Processes through Their Extrema I. Thermodynamics
Jacob Sonnenschein
Online training of Echo State Networks to predict chaotic dynamical systems
Astero Provata, Markos Syroukis, Johanne Hizanidis
Partial Multistep Prediction of Chaotic Time Series: What Remains Predictable beyond the Horizon of Predictability?
Vasilii A. Gromov, Maksim Lomakin, Aleksei Kudryashov et al.
Stability of inverse cascade in NLS Wave turbulence
Guillaume Costa, Sergey Nazarenko, Giorgio Krstulovic