Form factor for a family of quantum graphs: An expansion to third order

Abstract

For certain types of quantum graphs we show that the random-matrix form factor can be recovered to at least third order in the scaled time $\tau$ from periodic-orbit theory. We consider the contributions from pairs of periodic orbits represented by diagrams with up to two self-intersections connected by up to four arcs and explain why all other diagrams are expected to give higher-order corrections only. For a large family of graphs with ergodic classical dynamics the diagrams that exist in the absence of time-reversal symmetry sum to zero. The mechanism for this cancellation is rather general which suggests that it may also apply at higher-orders in the expansion. This expectation is in full agreement with the fact that in this case the linear-$\tau$ contribution, the diagonal approximation, already reproduces the random-matrix form factor for $\tau <1$. For systems with time-reversal symmetry there are more diagrams which contribute at third order. We sum these contributions for quantum graphs with uniformly hyperbolic dynamics, obtaining $+2{\tau }^3$, in agreement with random-matrix theory. As in the previous calculation of the leading-order correction to the diagonal approximation we find that the third order contribution can be attributed to exceptional orbits representing the intersection of diagram classes.

23 pages (including 4 fig.) - numerous typos corrected

Cited by in corpus (6)

• Periodic-Orbit Theory of Universality in Quantum Chaos
• Universal spectral form factor for chaotic dynamics
• Shot noise from action correlations
• Classical basis for quantum spectral fluctuations in hyperbolic systems
• Quantum decay of an open chaotic system: a semiclassical approach
• Diagonal approximation of the form factor of the unitary group