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… Show more
“…[21][22][23] where many of its properties were displayed with the help of numerical simulations. We benefit from the developments in these papers and from the recent discovery of "topological resonances" in the chaotic scattering on graphs [24]. We take advantage of the fact that chaotic quantum graphs are easier to handle than general dynamical chaotic systems because the propagator amplitudes are plane waves, and the semiclassical approximation is exact in that case.…”
For chaotic scattering on quantum graphs, the semiclassical approximation is exact. We use this fact and employ supersymmetry, the colour-flavour transformation, and the saddle-point approximation to calculate the exact expression for the lowest and asymptotic expressions in the Ericson regime for all higher correlation functions of the scattering matrix. Our results agree with those available from the random-matrix approach to chaotic scattering. We conjecture that our results hold universally for quantum-chaotic scattering.
“…[21][22][23] where many of its properties were displayed with the help of numerical simulations. We benefit from the developments in these papers and from the recent discovery of "topological resonances" in the chaotic scattering on graphs [24]. We take advantage of the fact that chaotic quantum graphs are easier to handle than general dynamical chaotic systems because the propagator amplitudes are plane waves, and the semiclassical approximation is exact in that case.…”
For chaotic scattering on quantum graphs, the semiclassical approximation is exact. We use this fact and employ supersymmetry, the colour-flavour transformation, and the saddle-point approximation to calculate the exact expression for the lowest and asymptotic expressions in the Ericson regime for all higher correlation functions of the scattering matrix. Our results agree with those available from the random-matrix approach to chaotic scattering. We conjecture that our results hold universally for quantum-chaotic scattering.
“…Indeed, it has been observed [19] that nonlinear effects such as multistability in quantum graphs occur generically already when the incoming flow is very low due to a generic mechanism for narrow resonances, the so-called topological resonances [20]. We refer to [20] for a more detailed discussion of topological resonances in linear quantum graphs and to [19] for a numerical analysis how topological resonances magnify nonlinearities and lead to multistability for arbitrarily small incoming flows. Here, we want to describe this mechanism briefly for two example graphs.…”
Section: An Outlook On Challenging Graph Structures: Topological Rmentioning
We consider exact and asymptotic solutions of the stationary cubic nonlinear Schrödinger equation on metric graphs. We focus on some basic example graphs. The asymptotic solutions are obtained using the canonical perturbation formalism developed in our earlier paper [S. Gnutzmann and D. Waltner, Phys. Rev. E 93, 032204 (2016)]. For closed example graphs (interval, ring, star graph, tadpole graph), we calculate spectral curves and show how the description of spectra reduces to known characteristic functions of linear quantum graphs in the low-intensity limit. Analogously for open examples, we show how nonlinear scattering of stationary waves arises and how it reduces to known linear scattering amplitudes at low intensities. In the short-wavelength asymptotics we discuss how genuine nonlinear effects may be described using the leading order of canonical perturbation theory: bifurcation of spectral curves (and the corresponding solutions) in closed graphs and multistability in open graphs.
“…With this averaging procedure we get rid off any individual network characteristic (such as scars [72], which in turn produce topological resonances [73]) that may lead to deviations from RMT predictions used here as a reference (see also [74]). More specifically, we choose this network model to retrieve well known random matrices in the appropriate limits -remember that a diagonal random matrix is obtained for α = 0, when the vertices are isolated, whereas a member of the GOE is recovered for α = 1, when the network is fully connected.…”
Section: Other Erdős-rényi Random Networkmentioning
By the use of extensive numerical simulations we show that the nearest-neighbor energy level spacing distribution P (s) and the entropic eigenfunction localization length of the adjacency matrices of Erdős-Rényi (ER) fully random networks are universal for fixed average degree ξ ≡ αN (α and N being the average network connectivity and the network size, respectively). We also demonstrate that Brody distribution characterizes well P (s) in the transition from α = 0, when the vertices in the network are isolated, to α = 1, when the network is fully connected. Moreover, we explore the validity of our findings when relaxing the randomness of our network model and show that, in contrast to standard ER networks, ER networks with diagonal disorder also show universality. Finally, we also discuss the spectral and eigenfunction properties of small-world networks.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.