Path Counting and Random Matrix Theory

Studies of density matrices for random quantum states lead naturally to the fixed trace Laguerre ensemble in random matrix theory. Previous studies have uncovered explicit rational function formulas for moments of purity statistic (trace of the squared density matrix), and also a third order linear differential equation satisfied by the eigenvalue density. We further probe the origin of these results from the viewpoint of integrability, which is taken here to mean wider classes of recursions and differential equations, and give extensions. Prominent in our study are first order linear matrix differential equations. One application given is to the derivation of the third order scalar equation for the density. Another is to obtain the explicit rational function formula for the variance of the purity statistic in the β generalised fixed trace Laguerre ensemble. In the original case (β = 2), the purity cumulants are expressed in terms of the large argument expansion of a particular σ-Painlevé IV transcendent. In a different but related direction, the exact computation of the two-point correlation for the fixed determinant circular unitary ensemble SU(N ) is given in the Appendix.Dedicated to the memory of Santosh Kumar and his work on exact results in RMT and their applications 1

We give a streamlined proof of a quantitative version of a result from P. Deift and D. Gioev, Universality in Random Matrix Theory for Orthogonal and Symplectic Ensembles. IMRP Int. Math. Res. Pap. (in press) which is crucial for the proof of universality in the bulk P. Deift and D. Gioev, Universality in Random Matrix Theory for Orthogonal and Symplectic Ensembles. IMRP Int. Math. Res. Pap. (in press) and also at the edge P. Deift and D. Gioev, {Universality at the edge of the spectrum for unitary, orthogonal and symplectic ensembles of random matrices. Comm. Pure Appl. Math. (in press) for orthogonal and symplectic ensembles of random matrices. As a byproduct, this result gives asymptotic information on a certain ratio of the β=1,2,4 partition functions for log gases.

We generalize the recently discovered relationship between JT gravity and double-scaled random matrix theory to the case that the boundary theory may have time-reversal symmetry and may have fermions with or without supersymmetry. The matching between variants of JT gravity and matrix ensembles depends on the assumed symmetries. Time-reversal symmetry in the boundary theory means that unorientable spacetimes must be considered in the bulk. In such a case, the partition function of JT gravity is still related to the volume of the moduli space of conformal structures, but this volume has a quantum correction and has to be computed using Reidemeister-Ray-Singer "torsion." Presence of fermions in the boundary theory (and thus a symmetry $(-1)^F$) means that the bulk has a spin or pin structure. Supersymmetry in the boundary means that the bulk theory is associated to JT supergravity and is related to the volume of the moduli space of super Riemann surfaces rather than of ordinary Riemann surfaces. In all cases we match JT gravity or supergravity with an appropriate random matrix ensemble. All ten standard random matrix ensembles make an appearance -- the three Dyson ensembles and the seven Altland-Zirnbauer ensembles. To facilitate the analysis, we extend to the other ensembles techniques that are most familiar in the case of the original Wigner-Dyson ensemble of hermitian matrices. We also generalize Mirzakhani's recursion for the volumes of ordinary moduli space to the case of super Riemann surfaces.

Our current understanding of quantum chaos in many-body quantum systems hinges on the random matrix theory (RMT) behavior of eigenstates and their energy level statistics. Although RMT has been remarkably successful in describing "coarse" features of many-body quantum Hamiltonians in chaotic regimes, such as the Wigner-Dyson level spacing statistics or the volume-law behavior of eigenstate entanglement entropy, it remains a challenge to describe their "finer" features, particularly those arising from spatial locality. Here, we show that we can accurately describe the statistical behavior of eigenstate ensembles in many-body Hamiltonians by using pure random states with physical constraints that capture the essential features of the Hamiltonian, specifically spatial locality and symmetries. We demonstrate our approach on local spin Hamiltonians with a scalar U(1) charge. By constructing ensembles of constrained random states that account for two commuting scalar charges playing the role of energy and magnetization, we describe the patterns of entanglement of midspectrum eigenstates beyond their average volume-law behavior, including O(1) corrections and fluctuations, analytically and numerically. When defining the correspondence between quantum chaotic eigenstates in many-body Hamiltonians and RMT ensembles, our work highlights the important role played by spatial locality in describing universal features beyond the volume-law behavior.

Invariant ensembles, which are characterised by the joint distribution of eigenvalues P(λ 1, …, λ N ), play a central role in random matrix theory. We consider the truncated linear statistics LK=∑n=1Kf(λn) with 1 ⩽ K ⩽ N, λ 1 > λ 2 > ⋯ > λ N and f a given function. This quantity has been studied recently in the case where the function f is monotonous. Here, we consider the general case, where this function can be non-monotonous. Motivated by the physics of cold atoms, we study the example f(λ) = λ 2 in the Gaussian ensembles of random matrix theory. Using the Coulomb gas method, we obtain the distribution of the truncated linear statistics, in the limit N → ∞ and K → ∞, with κ = K/N fixed. We show that the distribution presents two essential singularities, which arise from two infinite order phase transitions for the underlying Coulomb gas. We further argue that this mechanism is universal, as it depends neither on the choice of the ensemble, nor on the function f.

Parametrized families of distributions for the circular unitary ensemble in random matrix theory are considered; they are connected to Toeplitz determinants and have many applications in mathematics (for example, to the longest increasing subsequences of random permutations) and physics (for example, to nuclear physics and quantum gravity). We develop a theory for the unknown parameter estimated by an asymptotic maximum likelihood estimator, which, in the limit, behavesas the maximum likelihood estimator if the latter is well defined and the family is sufficiently smooth. They are asymptotically unbiased and normally distributed, where the norming constants are unconventional because of long range dependence.

We study the level spacing distribution p(s) in the spectrum of random networks. According to our numerical results, the shape of p(s) in the Erds–Rényi (E–R) random graph is determined by the average degree ⟨k⟩ and p(s) undergoes a dramatic change when ⟨k⟩ is varied around the critical point of the percolation transition, ⟨k⟩ = 1. When ⟨k⟩ ≫ 1, the p(s) is described by the statistics of the Gaussian orthogonal ensemble (GOE), one of the major statistical ensembles in Random Matrix Theory, whereas at ⟨k⟩ = 1 it follows the Poisson level spacing distribution. Closely above the critical point, p(s) can be described in terms of an intermediate distribution between Poisson and the GOE, the Brody-distribution. Furthermore, below the critical point p(s) can be given with the help of the regularized Gamma-function. Motivated by these results, we analyse the behaviour of p(s) in real networks such as the internet, a word association network and a protein–protein interaction network as well. When the giant component of these networks is destroyed in a node deletion process simulating the networks subjected to intentional attack, their level spacing distribution undergoes a similar transition to that of the E–R graph.

We study the distribution of the largest eigenvalue in the "Pfaffian" classical ensembles of random matrix theory, namely in the Gaussian orthogonal (GOE) and Gaussian symplectic (GSE) ensembles, using semi-classical skew-orthogonal polynomials, in analogue to the approach of Nadal and Majumdar (NM) for the Gaussian unitary ensemble (GUE). Generalizing the techniques of Adler, Forrester, Nagao and van Moerbeke, and using "overlapping Pfaffian" identities due to Knuth, we explicitly construct these semi-classical skew-orthogonal polynomials in terms of the semi-classical orthogonal polynomials studied by NM in the case of the GUE. With these polynomials we obtain expressions for the cumulative distribution functions of the largest eigenvalue in the GOE and the GSE. Further, by performing asymptotic analysis of these skew-orthogonal polynomials in the limit of large matrix size, we obtain an alternative derivation of the Tracy-Widom distributions for GOE and GSE. This asymptotic analysis relies on a certain Pfaffian identity, the proof of which employs the characterization of Pfaffians in terms of perfect matchings and link diagrams.

Multifractality attributed to dual central limit-like convergence effects

Fractal structure of random matrices

We investigate the influence of spin-orbit interaction on ballistic transport through chaotic cavities by using semiclassical methods. Our approach is based on the Landauer formalism and the Fisher-Lee relations, appropriately generalized to spin-orbit interaction, and a semiclassical representation of Green functions. We calculate conductance coefficients by exploiting ergodicity and mixing of suitably combined classical spin-orbit dynamics, and making use of the Sieber-Richter method and its most recent extensions. That way we obtain weak anti-localization and confirm previous results obtained in the symplectic ensemble of Random Matrix Theory.

The structure of this survey is the following: at first we repeat in Part I the first 20 years old proof of the strong Elliptic law for random matrices Then in Part II we prove the strong Elliptic law for random matrices Ξ n of the general form, i.e. when their diagonal entries have nonzero expectations, and when we do not require the existence of the probability densities of the entries of random matrices, but instead of Lyapunov condition we require the boundedness of the absolute moments of the entries of the order 4 + δ , δ &gt; 0. In this case the Elliptic law means that the support of the accompanying spectral density of eigenvalues looks like the picture of several galaxies made by telescope. If the distances between the centers of these galaxies are large enough we have several almost elliptical galaxies. We also present the sand clock law density for the sum of diagonal complex matrix and the symmetric random matrix belonging the domain of attraction of the Semicircular law. After this we prove in the Part III the weak Elliptic law, when all entries can have nonzero expectations. At the end of survey we give the proof of the Elliptic law for the Unitary random matrices from the so called Class N 12 of random Unitary matrices and give the over turned stool law density for the sum of diagonal complex matrix A n and where Ξ n belongs to the domain of attraction of the Circular law. We also establish in Part III for Elliptic Law at the first time the convergency rate and the Central Limit Theorem. These statements are based on the VICTORIA -transform of random matrix which is the abbreviation of the following words: Very Important Computational Transformation Of Random Independent Arrays. We follow the main strategy of the theory of limit theorems of the probability theory, i.e. we try to solve the problem of description of all limits of normalized spectral functions where λ k ( A n Ξ n B n + C n ) are eigenvalues of the matrix A n Ξ n B n + C n , A n , B n , and C n are nonrandom matrices, under general (as only possible) conditions on the entries of random matrices Ξ n , χ is the indicator function. We emphasize that the spectral theory of Hermitian random matrices is rather profound. For example, in 1975 in [3] V. Girko proved the general stochastic canonical equation for ACE (Asymptotically Constant Entries)-symmetric matrices: Assume that for any n , the random entries of a symmetric matrix are independent and they are asymptotically constant entries (ACE), i.e., for any ε &gt; 0, and τ &gt; 0 is an arbitrary constant, and that, for every 0 ≤ u ≤ 1 and 0 ≤ v ≤ 1, where the symbol denotes the weak convergence of distribution when n → ∞, is a nondecreasing function with bounded variation in z and continuous in u and v in the domain 0 ≤ u , v ≤ 1. Then, with probability one, for almost all x , where λ k (Ξ n × n ) are eigenvalues, F ( x ) is a distribution function whose Stieltjes transform satisfies the relation G α ( x , y , t ), as a function of x , is a distribution function satisfying the regularized stochastic canonical equation K 3 [3, 23] at the points x of continuity, is a random real functional whose Laplace transform of one-dimensional distribution is equal to The integrand <jats:inli

In this paper, we apply tools from random matrix theory (RMT) to estimates of correlations across the volatility of various assets in the S&P 500. The volatility inputs are estimated by modelling price fluctuations as a GARCH(1,1) process. The corresponding volatility correlation matrix is then constructed. It is found that the distribution of a significant number of eigenvalues of the volatility correlation matrix matches with the analytical result from RMT. Furthermore, the empirical estimates of short- and long-range correlations amongst eigenvalues, which are within RMT bounds, match with the analytical results for the Gaussian Orthogonal ensemble of RMT. To understand the information content of the largest eigenvectors, we estimate the contribution of the Global Industry Classification Standard industry groups to each eigenvector. In comparison with eigenvectors of correlation matrix for price fluctuations, only few of the largest eigenvectors of the volatility correlation matrix are dominated by a single industry group. We also study correlations between ‘volatility returns’ and log-volatility to find similar results.

These lecture notes provide a comprehensive self-contained introduction to the analysis of Wishart matrix moments. This study may act as an introduction to some particular aspects of random matrix theory or as a self-contained exposition of Wishart matrix moments. Random matrix theory plays a central role in statistical physics computational mathematics and engineering sciences including data assimilation signal processing combinatorial optimization compressed sensing econometrics and mathematical finance among numerous others. The mathematical foundations of the theory of random matrices lies at the intersection of combinatorics non-commutative algebra geometry multivariate functional and spectral analysis and of course statistics and probability theory. As a result most of the classical topics in random matrix theory are technical and mathematically difficult to penetrate for non-experts and regular users and practitioners. The technical aim of these notes is to review and extend some important results in random matrix theory in the specificcontext of real random Wishart matrices. This special class of Gaussian-type sample covariance matrix plays an important role in multivariate analysis and in statistical theory. We derive non-asymptotic formulae for the full matrix moments of real valued Wishart random matrices. As a corollary we derive and extend a number of spectral and trace-type results for the case of non-isotropic Wishart random matrices. We also derive the full matrix moment analogues of some classic spectral and trace-type moment results. For example we derive semi-circle and Marchencko-Pastur-type laws in the non-isotropic and full matrix cases. Laplace matrix transforms and matrix moment estimates are also studied along with new spectral and trace concentration-type inequalities.

We study the eigenvalue distribution of random matrices pertinent to the analysis of deep neural networks. The matrices resemble the product of the sample covariance matrices, however, an important difference is that the analog of the population covariance matrix is now a function of random data matrices (synaptic weight matrices in the deep neural network terminology). The problem has been treated in recent work [J. Pennington, S. Schoenholz and S. Ganguli, The emergence of spectral universality in deep networks, Proc. Mach. Learn. Res. 84 (2018) 1924–1932, arXiv:1802.09979] by using the techniques of free probability theory. Since, however, free probability theory deals with population covariance matrices which are independent of the data matrices, its applicability in this case has to be justified. The justification has been given in [L. Pastur, On random matrices arising in deep neural networks: Gaussian case, Pure Appl. Funct. Anal. (2020), in press, arXiv:2001.06188] for Gaussian data matrices with independent entries, a standard analytical model of free probability, by using a version of the techniques of random matrix theory. In this paper, we use another version of the techniques to extend the results of [L. Pastur, On random matrices arising in deep neural networks: Gaussian case, Pure Appl. Funct. Anal. (2020), in press, arXiv:2001.06188] to the case where the entries of the data matrices are just independent identically distributed random variables with zero mean and finite fourth moment. This, in particular, justifies the mean field approximation in the infinite width limit for the deep untrained neural networks and the property of the macroscopic universality of random matrix theory in this case.