pith. sign in

arxiv: 1507.06520 · v1 · pith:GRSUSD3Pnew · submitted 2015-07-23 · 🧮 math-ph · math.MP

Quantum ergodicity for quantum graphs without back-scattering

classification 🧮 math-ph math.MP
keywords graphsquantumergodicityback-scatteringestimatefamiliesrandomregular
0
0 comments X
read the original abstract

We give an estimate of the quantum variance for $d$-regular graphs quantised with boundary scattering matrices that prohibit back-scattering. For families of graphs that are expanders, with few short cycles, our estimate leads to quantum ergodicity for these families of graphs. Our proof is based on a uniform control of an associated random walk on the bonds of the graph. We show that recent constructions of Ramanujan graphs, and asymptotically almost surely, random $d$-regular graphs, satisfy the necessary conditions to conclude that quantum ergodicity holds.

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.