Topological Resonances in Scattering on Networks (Graphs)
Sven Gnutzmann, Holger Schanz, Uzy Smilansky

TL;DR
This paper uncovers a new type of topological resonances in quantum graph scattering, arising from the graph's connectivity, with unique signatures in resonance statistics, supported by analytical and numerical evidence, and proposes experimental verification.
Contribution
It introduces the concept of topological resonances in quantum graphs, linking resonance features to the graph's topology, a novel insight beyond existing paradigms.
Findings
Topological resonances are caused by graph cycles and are distinct from classical or disorder-induced resonances.
Resonance parameters show signatures directly related to topological features like the shortest cycle length.
The study provides analytical and numerical evidence for the existence and properties of these resonances.
Abstract
We report on a hitherto unnoticed type of resonances occurring in scattering from networks (quantum graphs) which are due to the complex connectivity of the graph - its topology. We consider generic open graphs and show that any cycle leads to narrow resonances which do not fit in any of the prominent paradigms for narrow resonances (classical barriers, localization due to disorder, chaotic scattering). We call these resonances `topological' to emphasize their origin in the non-trivial connectivity. Topological resonances have a clear and unique signature which is apparent in the statistics of the resonance parameters (such as e.g., the width, the delay time or the wave-function intensity in the graph). We discuss this phenomenon by providing analytical arguments supported by numerical simulation, and identify the features of the above distributions which depend on genuine topological…
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.
