Smilansky's nodal universality conjecture for quantum graphs
Smilansky's nodal universality conjecture for quantum graphs
Let be any sequence of standard graphs, with first Betti numbers . Choosing arbitrary rationally independent edge lengths for each , let denote its nodal surplus random variable.
Nodal universality conjecture. The variance has linear growth
and, as ,
where convergence is in distribution and is the standard normal distribution. This conjecture concerns the universality of nodal-surplus statistics as the complexity of a quantum graph grows. It has been rigorously established only for certain families of quantum graphs, so the stated generality remains open.
Sources & referencesView supporting material
Primary source
Gregory Berkolaiko and Sven Gnutzmann, “Quantum graph models of quantum chaos: an introduction and some recent applications”, arXiv:2604.12690 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.