English
Related papers

Related papers: Edge Universality for Inhomogeneous Random Matrice…

200 papers

We present and investigate an extension of the classical random graph to a general class of inhomogeneous random graph models, where vertices come in different types, and the probability of realizing an edge depends on the types of its…

Statistical Mechanics · Physics 2009-11-07 Bo Soderberg

A well-known result in random matrix theory, proven by Kahn, Koml\'os and Szemer\'edi in 1995, states that a square random matrix with i.i.d. uniform $\{\pm 1\}$ entries is invertible with probability $1-\exp(-\Omega(n))$. As a natural…

Probability · Mathematics 2026-02-20 Yi Han

A known result in random matrix theory states the following: Given a random Wigner matrix $X$ which belongs to the Gaussian Orthogonal Ensemble (GOE), then such matrix $X$ has an invariant distribution under orthogonal conjugations. The…

Probability · Mathematics 2019-10-02 Jose Angel Sanchez Gomez , Victor Amaya Carvajal

For a class of symmetric random matrices whose entries are martingale differences adapted to an increasing filtration, we prove that under a Lindeberg-like condition, the empirical spectral distribution behaves asymptotically similarly to a…

Probability · Mathematics 2014-02-27 Florence Merlevède , Costel Peligrad , Magda Peligrad

Conventionally used exponential random graphs cannot directly model weighted networks as the underlying probability space consists of simple graphs only. Since many substantively important networks are weighted, this limitation is…

Probability · Mathematics 2019-06-10 Ryan DeMuse , Danielle Larcomb , Mei Yin

We study the time dynamics of random density matrices generated by evolving the same pure state using a Gaussian orthogonal ensemble (GOE) of Hamiltonians. We show that the spectral statistics of the resulting mixed state is well described…

In this paper, we prove the edge universality of largest eigenvalues for separable covariance matrices of the form $\mathcal Q :=A^{1/2}XBX^*A^{1/2}$. Here $X=(x_{ij})$ is an $n\times N$ random matrix with $x_{ij}=N^{-1/2}q_{ij}$, where…

Probability · Mathematics 2019-11-11 Fan Yang

We prove multi-dimensional central limit theorems for the spectral moments (of arbitrary degrees) associated with random matrices with real-valued i.i.d. entries, satisfying some appropriate moment conditions. Our techniques rely on a…

Probability · Mathematics 2009-09-30 Ivan Nourdin , Giovanni Peccati

We study the spectral properties of and spectral-crossovers between different random matrix ensembles (Poissonian, GOE, GUE) in correlated spin-chain systems, in the presence of random magnetic fields, and the scalar spin-chirality term,…

Statistical Mechanics · Physics 2023-09-26 Debojyoti Kundu , Santosh Kumar , Subhra Sen Gupta

Recently much effort has been made towards the introduction of non-Hermitian random matrix models respecting $PT$-symmetry. Here we show that there is a one-to-one correspondence between complex $PT$-symmetric matrices and split-complex and…

Mathematical Physics · Physics 2015-09-17 Eva-Maria Graefe , Steve Mudute-Ndumbe , Matthew Taylor

We study the set of probability distributions visited by a continuous-time quantum walk on graphs. An edge-weighted graph G is universal mixing if the instantaneous or average probability distribution of the quantum walk on G ranges over…

Quantum Physics · Physics 2008-06-13 W. Carlson , A. Ford , E. Harris , J. Rosen , C. Tamon , K. Wrobel

Following E. Wigner's original vision, we prove that sampling the eigenvalue gaps within the bulk spectrum of a fixed (deformed) Wigner matrix $H$ yields the celebrated Wigner-Dyson-Mehta universal statistics with high probability.…

Mathematical Physics · Physics 2024-04-18 Giorgio Cipolloni , László Erdős , Dominik Schröder

We analyze properties of non-hermitian matrices of size M constructed as square submatrices of unitary (orthogonal) random matrices of size N>M, distributed according to the Haar measure. In this way we define ensembles of random matrices…

chao-dyn · Physics 2009-10-31 Karol Zyczkowski , Hans-Juergen Sommers

We consider the convergence of the ESD for non-Hermitian random band matrices with independent entries to the circular law, which is the uniform measure on the unit disk in the center of the complex plane. We assume that the bandwidth of…

Probability · Mathematics 2025-12-02 Yi Han

We give a proof of the Universality Conjecture for orthogonal and symplectic ensembles of random matrices in the scaling limit for a class of weights w(x)=exp(-V(x)) where V is a polynomial, V(x)=kappa_{2m}x^{2m}+..., kappa_{2m}>0. For such…

Mathematical Physics · Physics 2007-05-23 Percy Deift , Dimitri Gioev

A remarkable property of Hermitian ensembles is their universal behavior, that is, once properly rescaled the eigenvalue statistics does not depend on particularities of the ensemble. Recently, normal matrix ensembles have attracted…

Mathematical Physics · Physics 2009-09-21 Alexei M. Veneziani , Tiago Pereira , Domingos H. U. Marchetti

The Wigner-Dyson-Gaudin-Mehta conjecture asserts that the local eigenvalue statistics of large real and complex Hermitian matrices with independent, identically distributed entries are universal in a sense that they depend only on the…

Probability · Mathematics 2014-07-24 Laszlo Erdos

Correlation functions involving products and ratios of half-integer powers of characteristic polynomials of random matrices from the Gaussian Orthogonal Ensemble (GOE) frequently arise in applications of Random Matrix Theory (RMT) to…

Mathematical Physics · Physics 2015-04-23 Yan V. Fyodorov , André Nock

We study time-inhomogeneous random walks on finite groups in the case where each random walk step need not be supported on a generating set of the group. When the supports of the random walk steps satisfy a natural condition involving…

Probability · Mathematics 2026-02-04 Elia Gorokhovsky

We consider the problem of sampling an edge almost uniformly from an unknown graph, $G = (V, E)$. Access to the graph is provided via queries of the following types: (1) uniform vertex queries, (2) degree queries, and (3) neighbor queries.…

Computational Complexity · Computer Science 2017-06-30 Talya Eden , Will Rosenbaum