A Pairing Formula for Resonant States on Finite Regular Graphs
Christian Arends, Jan Frahm, Joachim Hilgert

TL;DR
This paper introduces two pairings of resonant and coresonant states on finite regular graphs and proves their equivalence up to a resonance-dependent constant, advancing understanding of spectral properties of transfer operators.
Contribution
The paper defines two novel pairings of resonant states on finite regular graphs and proves their equivalence up to a constant depending on the eigenvalue.
Findings
The vertex pairing depends only on initial/terminal vertices.
The geodesic pairing involves integration over all geodesics.
Both pairings coincide up to a resonance-dependent constant.
Abstract
On a finite regular graph, (co)resonant states are eigendistributions of the transfer operator associated to the shift on one-sided infinite non-backtracking paths. We introduce two pairings of resonant and coresonant states, the vertex pairing which involves only the dependence on the initial/terminal vertex of the path, and the geodesic pairing which is given by integrating over all geodesics the evaluation of the coresonant state on the first half of the geodesic times the resonant state on the second half. The main result is that these two pairings coincide up to a constant which depends on the resonance, i.e. the corresponding eigenvalue of the transfer operator.
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.
Taxonomy
TopicsGraph theory and applications · Spectral Theory in Mathematical Physics · Quantum chaos and dynamical systems
