Quantum ergodicity on large regular graphs
classification
🧮 math-ph
math.MPmath.PRmath.SP
keywords
graphsregularergodicitylargequantumanalysisconsidercycles
read the original abstract
We propose a version of the Quantum Ergodicity theorem on large regular graphs of fixed valency. This is a property of delocalization of "most" eigenfunctions. We consider expander graphs with few short cycles (for instance random large regular graphs). Our method mimics the proof of Quantum Ergodicity on manifolds: it uses microlocal analysis on regular trees.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.