GOE statistics for Anderson models on antitrees and thin boxes in $\mathbb{Z}^3$ with deformed Laplacian
Christian Sadel

TL;DR
This paper demonstrates that the Anderson model on certain antitree graphs and deformed Laplacian operators on thin boxes in three-dimensional integer lattices exhibit GOE statistics, with eigenvalue processes converging to the Sine_1 process.
Contribution
It introduces new graph constructions and operator models where GOE eigenvalue statistics emerge without rescaling, expanding understanding of universality in random matrix theory.
Findings
Eigenvalue processes converge to the Sine_1 process
GOE statistics observed without matrix size rescaling
New models on antitrees and deformed Laplacians in 3D lattices
Abstract
Sequences of certain finite graphs, antitrees, are constructed along which the Anderson model shows GOE statistics, i.e. a re-scaled eigenvalue process converges to the process. The Anderson model on the graph is a random matrix being the sum of the adjacency matrix and a random diagonal matrix with independent identically distributed entries along the diagonal. The strength of the randomness stays fixed, there is no re-scaling with matrix size. These considered random matrices giving GOE statistics can also be viewed as random Schr\"odinger operators on thin finite boxes in where the Laplacian is deformed by a projection commuting with .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
