ID: math/9904166

A Simple Approach to Global Regime of the Random Matrix Theory

April 29, 1999

View on ArXiv
Leonid Pastur
Mathematics
Spectral Theory
Probability

We discuss a method of the asymptotic computation of moments of the normalized eigenvalue counting measure of random matrices of large order. The method is based on the resolvent identity and on some formulas relating expectations of certain matrix functions and the expectations including their derivatives or, equivalently, on some simple formulas of the perturbation theory. In the framework of this unique approach we obtain functional equations for the Stieltjes transforms of the limiting normalized eigenvalue counting measure and the bounds for the rate of convergence for the majority known random matrix ensembles.

Similar papers 1

On Asymptotic Properties of Large Random Matrices with Independent Entries

June 24, 1996

90% Match
Alexei M. Khorunzhy, Boris A. Khoruzhenko, Leonid A. Pastur
Condensed Matter

We study the normalized trace $g_n(z)=n^{-1} \mbox{tr} \, (H-zI)^{-1}$ of the resolvent of $n\times n$ real symmetric matrices $H=\big[(1+\delta_{jk})W_{jk}/\sqrt n\big]_{j,k=1}^n$ assuming that their entries are independent but not necessarily identically distributed random variables. We develop a rigorous method of asymptotic analysis of moments of $g_n(z)$ for $|\Im z| \ge \eta_0$ where $\eta_0$ is determined by the second moment of $W_{jk}$. By using this method we find t...

Find SimilarView on arXiv

The limiting spectral distribution in terms of spectral density

January 17, 2016

89% Match
Costel Peligrad, Magda Peligrad
Probability

For a large class of symmetric random matrices with correlated entries, selected from stationary random fields of centered and square integrable variables, we show that the limiting distribution of eigenvalue counting measure always exists and we describe it via an equation satisfied by its Stieltjes transform. No rate of convergence to zero of correlations is imposed, therefore the process is allowed to have long memory. In particular, if the symmetrized matrices are constru...

Find SimilarView on arXiv

Several applications of the moment method in random matrix theory

June 13, 2014

88% Match
Sasha Sodin
Classical Analysis and ODEs
Mathematical Physics
Probability

Several applications of the moment method in random matrix theory, especially, to local eigenvalue statistics at the spectral edges, are surveyed, with emphasis on a modification of the method involving orthogonal polynomials.

Find SimilarView on arXiv

Sixty Years of Moments for Random Matrices

December 20, 2016

88% Match
Werner Kirsch, Thomas Kriecherbauer
Mathematical Physics
Probability

This is an elementary review, aimed at non-specialists, of results that have been obtained for the limiting distribution of eigenvalues and for the operator norms of real symmetric random matrices via the method of moments. This method goes back to a remarkable argument of Eugen Wigner some sixty years ago which works best for independent matrix entries, as far as symmetry permits, that are all centered and have the same variance. We then discuss variations of this classical ...

Find SimilarView on arXiv

The Eigenvalues of Random Matrices

January 8, 2021

88% Match
Elizabeth Meckes
Probability
Rings and Algebras

This is a brief survey of classical and recent results about the typical behavior of eigenvalues of large random matrices, written for mathematicians and others who study and use matrices but may not be accustomed to thinking about randomness.

Find SimilarView on arXiv

On Universality of Smoothed Eigenvalue Density of Large Random Matrices

May 20, 1999

88% Match
Monvel A. Boutet de, A. Khorunzhy
Probability
Spectral Theory

We describe the resolvent approach for the rigorous study of the mescoscopic regime of Hermitian matrix spectra. We present results reflecting the universal behavior of the smoothed density of eigenvalue distribution of large random matrices

Find SimilarView on arXiv

Spectral Convergence of Large Block-Hankel Gaussian Random Matrices

April 19, 2017

88% Match
Philippe Loubaton, Xavier Mestre
Probability

This paper studies the behaviour of the empirical eigenvalue distribution of large random matrices W_N W_N* where W_N is a ML x N matrix, whose M block lines of dimensions L x N are mutually independent Hankel matrices constructed from complex Gaussian correlated stationary random sequences. In the asymptotic regime where M \rightarrow \infty, N \rightarrow +\infty and ML/N \rightarrow c > 0, it is shown using the Stieltjes transform approach that the empirical eigenvalue dis...

Find SimilarView on arXiv

The largest eigenvalue of small rank perturbations of Hermitian random matrices

November 22, 2004

87% Match
Sandrine Péché
Probability

We compute the limiting eigenvalue statistics at the edge of the spectrum of large Hermitian random matrices perturbed by the addition of small rank deterministic matrices. To be more precise, we consider random Hermitian matrices with independent Gaussian entries $M_{ij}, i\leq j$ with various expectations. We prove that the largest eigenvalue of such random matrices exhibits, in the large $N$ limit, various limiting distributions depending on both the eigenvalues of the mat...

Find SimilarView on arXiv

Asymptotic Spectra of Matrix-Valued Functions of Independent Random Matrices and Free Probability

August 8, 2014

87% Match
F. Götze, H. Kösters, A. Tikhomirov
Probability

We investigate the universality of singular value and eigenvalue distributions of matrix valued functions of independent random matrices and apply these general results in several examples. In particular we determine the limit distribution and prove universality under general conditions for singular value and eigenvalue distributions of products of independent matrices from spherical ensembles.

Find SimilarView on arXiv

On the empirical spectral distribution for matrices with long memory and independent rows

June 4, 2014

87% Match
Florence Merlevede, Magda Peligrad
Probability

In this paper we show that the empirical eigenvalue distribution of any sample covariance matrix generated by independent copies of a stationary regular sequence has a limiting distribution depending only on the spectral density of the sequence. We characterize this limit in terms of Stieltjes transform via a certain simple equation. No rate of convergence to zero of the covariances is imposed. If the entries of the stationary sequence are functions of independent random vari...

Find SimilarView on arXiv