SearcharxivSearch

arXiv · math/0307330

Spectral measure of large random Hankel, Markov and Toeplitz matrices

Abstract

We study the limiting spectral measure of large symmetric random matrices of linear algebraic structure. For Hankel and Toeplitz matrices generated by i.i.d. random variables $\{X_k\}$ of unit variance, and for symmetric Markov matrices generated by i.i.d. random variables $\{X_{ij}\}_{j>i}$ of zero mean and unit variance, scaling the eigenvalues by $\sqrt{n}$ we prove the almost sure, weak convergence of the spectral measures to universal, nonrandom, symmetric distributions $γ_H$, $γ_M$ and $γ_T$ of unbounded support. The moments of $γ_H$ and $γ_T$ are the sum of volumes of solids related to Eulerian numbers, whereas $γ_M$ has a bounded smooth density given by the free convolution of the semicircle and normal densities. For symmetric Markov matrices generated by i.i.d. random variables $\{X_{ij}\}_{j>i}$ of mean $m$ and finite variance, scaling the eigenvalues by ${n}$ we prove the almost sure, weak convergence of the spectral measures to the atomic measure at $-m$. If $m=0$, and the fourth moment is finite, we prove that the spectral norm of $\mathbf {M}_n$ scaled by $\sqrt{2n\log n}$ converges almost surely to 1.

Explore related subjects

Keep this discovery

BibTeXRIS

Włodzimierz Bryc, Amir Dembo, Tiefeng Jiang. 2006-02-27. Spectral measure of large random Hankel, Markov and Toeplitz matrices. https://doi.org/10.1214/009117905000000495

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR