Related papers: Universality and sharp matrix concentration inequa…
We consider two $n\times n$ non-Hermitian random matrices such that the $ij$th entry of one matrix is correlated with the $ij$th entry of the other matrix. However, the entries of any particular matrix are i.i.d. random variables. We study…
We introduce a complex-plane generalization of the consecutive level-spacing distribution, used to distinguish regular from chaotic quantum spectra. Our approach features the distribution of complex-valued ratios between nearest- and…
Theoretical analysis of biological and artificial neural networks e.g. modelling of synaptic or weight matrices necessitate consideration of the generic real-asymmetric matrix ensembles, those with varying order of matrix elements e.g. a…
Random matrix models consisting of normal matrices, defined by the sole constraint $[N^{\dag},N]=0$, will be explored. It is shown that cubic eigenvalue repulsion in the complex plane is universal with respect to the probability…
Two landmark results in combinatorial random matrix theory, due to Koml\'os and Costello-Tao-Vu, show that discrete random matrices and symmetric discrete random matrices are typically nonsingular. In particular, in the language of graph…
Asymptotic freeness of independent Haar distributed unitary matrices was discovered by Voiculescu. Many refinements have been obtained, including strong asymptotic freeness of random unitaries and strong asymptotic freeness of random…
We obtain sequences of inclusion sets for the spectrum, essential spectrum, and pseudospectrum of banded, in general non-normal, matrices of finite or infinite size. Each inclusion set is the union of the pseudospectra of certain…
For sample covariance matrices with iid entries with sub-Gaussian tails, when both the number of samples and the number of variables become large and the ratio approaches to one, it is a well-known result of A. Soshnikov that the limiting…
We study random band matrices within the framework of traffic probability, an operadic non-commutative probability theory introduced by Male based on graph operations. As a starting point, we revisit the familiar case of the permutation…
We present some applications of central limit theorems on mesoscopic scales for random matrices. When combined with the recent theory of "homogenization" for Dyson Brownian Motion, this yields the universality of quantities which depend on…
It has been observed that the performances of many high-dimensional estimation problems are universal with respect to underlying sensing (or design) matrices. Specifically, matrices with markedly different constructions seem to achieve…
We propose a generalization of the random matrix theory following the basic prescription of the recently suggested concept of superstatistics. Spectral characteristics of systems with mixed regular-chaotic dynamics are expressed as weighted…
We establish, under a moment matching hypothesis, the local universality of the correlation functions associated with products of $M$ independent iid random matrices, as $M$ is fixed, and the sizes of the matrices tend to infinity. This…
Random matrix theory has played an important role in recent work on statistical network analysis. In this paper, we review recent results on regimes of concentration of random graphs around their expectation, showing that dense graphs…
Symmetry is a cornerstone of much of mathematics, and many probability distributions possess symmetries characterized by their invariance to a collection of group actions. Thus, many mathematical and statistical methods rely on such…
We study the singularity probability of n*n random matrices with i.i.d. entries from highly biased discrete distributions. We obtain sharp non-asymptotic bounds for this probability and derive estimates on the least singular values. Our…
We use methods of random matrix theory to analyze the cross-correlation matrix C of price changes of the largest 1000 US stocks for the 2-year period 1994-95. We find that the statistics of most of the eigenvalues in the spectrum of C agree…
Computing the distribution of permanents of random matrices has been an outstanding open problem for several decades. In quantum computing, "anti-concentration" of this distribution is an unproven input for the proof of hardness of the task…
We study the asymptotics of sums of matricially free random variables called random pseudomatrices, and we compare it with that of random matrices with block-identical variances. For objects of both types we find the limit joint…
This paper is a detailed account of the recent progress in understanding the statistical properties of complex eigenvalues of random non-Hermitian matrices reported earlier in our two short communications: Physics Letters A v.226, 46 (1997)…