Quantum chaos on discrete graphs
Seminar Room 1, Newton Institute
The spectral statistics of the discrete Laplacian on random d-regular graphs (in the limit of large graphs), will be discussed. It will be shown that in this limit some spectral statistics follow the predictions of Random Matrix Theory. Counting statistics of cycles on the graphs play an important role in the analysis. The level sets of eigenvectors will be shown to display a percollation transition which can be proved by assuming that eigenvectors distribute normally, with a covariance which can be computed using the special properties of the random ensemble of large d-regular graphs.