Related papers: Quantum ergodicity for quantum graphs without back…
We identify the quantum limits of scattering states for the modular surface. This is obtained through the study of quantum measures of non-holomorphic Eisenstein series away from the critical line. We provide a range of stability for the…
Asymptotic properties of random graph sequences, like occurrence of a giant component or full connectivity in Erd\H{o}s-R\'enyi graphs, are usually derived with very specific choices for defining parameters. The question arises to which…
We provide explicit expressions for the constants involved in the characterisation of ergodicity of sub-geometric Markov chains. The constants are determined in terms of those appearing in the assumed drift and one-step minorisation…
The purpose of this note is to explain the structure, general strategy, and main ideas of the proof in the work of Huang, McKenzie, and Yau (2024) on the Ramanujan property and edge universality of random regular graphs. The core of the…
The unitary evolution maps in closed chaotic quantum graphs are known to have universal spectral correlations, as predicted by random matrix theory. In chaotic graphs with absorption the quantum maps become non-unitary. We show that their…
We quantize graphs (networks) which consist of a finite number of bonds and vertices. We show that the spectral statistics of fully connected graphs is well reproduced by random matrix theory. We also define a classical phase space for the…
We compute the eigenvalue fluctuations of uniformly distributed random biregular bipartite graphs with fixed and growing degrees for a large class of analytic functions. As a key step in the proof, we obtain a total variation distance bound…
We study wave function structure for quantum graphs in the chaotic and disordered regime, using measures such as the wave function intensity distribution and the inverse participation ratio. The result is much less ergodicity than expected…
The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…
We provide a versatile plateform to investigate wave-particle duality. This photonic waveguide network implements quantum (wave) graphs as proposed in the seminal paper by Kottos \& Smilansky [PRL \textbf{85} 968 (2000)]. We experimentally…
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…
This work deals with the scattering entropy of quantum graphs in many different circumstances. We first consider the case of the Shannon entropy and then the R\'enyi and Tsallis entropies, which are more adequate to study distinct…
We connect quantum graphs with infinite leads, and turn them to scattering systems. We show that they display all the features which characterize quantum scattering systems with an underlying classical chaotic dynamics: typical poles, delay…
We consider the edge-triangle model, a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. In the so-called replica symmetric regime, the limiting free energy exists together…
Deterministic dynamical systems such as the baker maps are useful to shed light on some of the conditions verified by deterministic models in non-equilibrium statistical physics. We investigate a 2D dynamical system, enjoying a weak form of…
We prove quantum unique ergodicity for a subspace of the continuous spectrum spanned by the degenerate Eisenstein Series on GL(n).
We investigate the quantum dynamics of particles on graphs ("quantum random walks"), with the aim of developing quantum algorithms for determining if two graphs are isomorphic (related to each other by a relabeling of vertices). We focus on…
Quantum networks are often modelled using Schroedinger operators on metric graphs. To give meaning to such models one has to know how to interpret the boundary conditions which match the wave functions at the graph vertices. In this article…
The unconstrained exponential family of random graphs assumes no prior knowledge of the graph before sampling, but it is natural to consider situations where partial information about the graph is known, for example the total number of…