Gnutzmann–Smilansky–Weber universal nodal-surplus Gaussian conjecture

At least 5 years old · documented by

Let {Γl⃗(β)}β↗∞\{\Gamma_{\vec{l}}^{(\beta)}\}_{\beta\nearrow\infty} be any sequence of standard graphs parameterized by their first Betti numbers, with each graph having rationally independent edge lengths. Let σ(β)\sigma^{(\beta)} be the corresponding nodal surplus random variable. Gnutzmann–Smilansky–Weber's conjecture.

σ(β)−β2Var⁡(σ(β))→β→∞DN(0,1),\frac{\sigma^{(\beta)}-\frac{\beta}{2}}{\sqrt{\operatorname{Var}(\sigma^{(\beta)})}}\xrightarrow[\beta\to\infty]{\mathcal{D}}N(0,1),

where the convergence is in distribution and

Var⁡(σ(β))=O(β).\operatorname{Var}(\sigma^{(\beta)})=\mathcal{O}(\beta).

This is the universal formulation of the nodal-statistics conjecture in terms of nodal surplus. The source proves it for trees of cycles, while the assertion for arbitrary such graph sequences remains open.

References

Primary source

Lior Alon, “Quantum graphs – Generic eigenfunctions and their nodal count and Neumann count statistics”, arXiv:2010.03004 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.