Statistical properties of eigenvectors and eigenvalues of structured random matrices

Abstract

We study the eigenvalues and the eigenvectors of $N\times N$ structured random matrices of the form $H=W\tilde{H}W+D$ with diagonal matrices $D$ and $W$ and $\tilde{H}$ from the Gaussian Unitary Ensemble. Using the supersymmetry technique we derive general asymptotic expressions for the density of states and the moments of the eigenvectors. We find that the eigenvectors remain ergodic under very general assumptions, but a degree of their ergodicity depends strongly on a particular choice of $W$ and $D$. For a special case of $D=0$ and random $W$, we show that the eigenvectors can become critical and are characterized by non-trivial fractal dimensions.

arXiv comment14 pages, 4 figures

References in corpus (6)

• A random matrix model with localization and ergodic transitions
• Eigenvectors under a generic perturbation: non-perturbative results from the random matrix approach
• Quantum Criticality at the Origin of Life
• Spectral Properties of Random Reactance Networks and Random Matrix Pencils
• Exact spectral densities of complex noise-plus-structure random matrices
• Statistics of eigenvectors in the deformed Gaussian unitary ensemble of random matrices

Cited by in corpus (8)

• Multifractal dimensions for random matrices, chaotic quantum maps, and many-body systems
• Many-body Multifractality throughout Bosonic Superfluid and Mott Insulator Phases
• Random matrices with row constraints and eigenvalue distributions of graph Laplacians
• Statistical analysis of chiral structured ensembles: role of matrix constraints
• Eigenvalue and Eigenvector Statistics in Time Series Analysis
• Hammerstein equations for sparse random matrices
• First return times on sparse random graphs
• Statistical field theory of random graphs with prescribed degrees