Unitary stochastic matrix ensembles and spectral statistics

Abstract

We propose to study unitary matrix ensembles defined in terms of unitary stochastic transition matrices associated with Markov processes on graphs. We argue that the spectral statistics of such an ensemble (after ensemble averaging) depends crucially on the spectral gap between the leading and subleading eigenvalue of the underlying transition matrix. It is conjectured that unitary stochastic ensembles follow one of the three standard ensembles of random matrix theory in the limit of infinite matrix size $N\to \infty$ if the spectral gap of the corresponding transition matrices closes slower than 1/N. The hypothesis is tested by considering several model systems ranging from binary graphs to uniformly and non-uniformly connected star graphs and diffusive networks in arbitrary dimensions.

14 pages, 5 figures, submitted to J Phys A

References in corpus (1)

• Spectral gap of doubly stochastic matrices generated from equidistributed unitary matrices

Cited by in corpus (45)

• Quantum Graphs: Applications to Quantum Chaos and Universal Spectral Statistics
• Experimental simulation of quantum graphs by microwave networks
• Universal spectral statistics in quantum graphs
• Random unistochastic matrices
• Birkhoff's polytope and unistochastic matrices, N=3 and N=4
• Functionals of the Brownian motion, localization and metric graphs
• Universal Quantum Graphs
• The Leading Off-Diagonal Correction to the Form Factor of Large Graphs
• Scars on quantum networks ignore the Lyapunov exponent
• Exact Elliptic Compactons in Generalized Korteweg-DeVries Equations
• Spectral correlations of individual quantum graphs
• Value distribution of the eigenfunctions and spectral determinants of quantum star graphs
• Shot noise from action correlations
• No quantum ergodicity for star graphs
• Form factor for a family of quantum graphs: An expansion to third order
• A Quantum Graph Approach to Metamaterial Design
• The Dirichlet Markov Ensemble
• Finite pseudo orbit expansions for spectral quantities of quantum graphs
• Quantum graphs where back-scattering is prohibited
• Volume of the set of unistochastic matrices of order 3 and the mean Jarlskog invariant
• Sigma models for quantum chaotic dynamics
• From quantum graphs to quantum random walks
• Quantum ergodicity for graphs related to interval maps
• Regular quantum graphs
• Universal spectral statistics in Wigner-Dyson, chiral and Andreev star graphs I: construction and numerical results
• Form factor for large quantum graphs: evaluating orbits with time-reversal
• Quantum decay of an open chaotic system: a semiclassical approach
• Universal spectral statistics of Andreev billiards: semiclassical approach
• Decohering Tensor Network Quantum Machine Learning Models
• Universal spectral statistics in Wigner-Dyson, chiral and Andreev star graphs II: semiclassical approach
• The autocorrelation function for spectral determinants of quantum graphs
• Universality of nodal count distribution in large metric graphs
• Quantum ergodicity for quantum graphs without back-scattering
• Mathematical Aspects of Vacuum Energy on Quantum Graphs
• Rényi and Tsallis entropies related to eigenfunctions of quantum graphs
• Periodic orbit evaluation of a spectral statistic of quantum graphs without the semiclassical limit
• Average scattering entropy for periodic, aperiodic and random distribution of vertices in simple quantum graphs
• Locality for quantum systems on graphs depends on the number field
• Quantizing graphs, one way or two?
• Random stochastic matrices from classical compact Lie groups and symmetric spaces
• Spectral Statistics of Non-Hermitian Matrices and Dissipative Quantum Chaos
• Level compressibility of certain random unitary matrices
• Sub-quadratic scalable approximate linear converter using multi-plane light conversion with low-entropy mode mixers
• Pointwise Weyl law for graphs from quantized interval maps
• Maximal scarring for eigenfunctions of quantum graphs