SearcharxivSearch

arXiv · 1710.00240

Spectral distributions of periodic random matrix ensembles

Abstract

Kolo\u{g}lu, Kopp and Miller compute the limiting spectral distribution of a certain class of real random matrix ensembles, known as $k$-block circulant ensembles, and discover that it is exactly equal to the eigenvalue distribution of an $k \times k$ Gaussian unitary ensemble. We give a simpler proof that under very general conditions which subsume the cases studied by Kolo\u{g}lu-Kopp-Miller, real-symmetric ensembles with periodic diagonals always have limiting spectral distribution equal to the eigenvalue distribution of a finite Hermitian ensemble with Gaussian entries which is a `complex version' of a $k \times k$ submatrix of the ensemble. We also prove an essentially algebraic relation between certain periodic finite Hermitian ensembles with Gaussian entries, and the previous result may be seen as an asymptotic version of this for real-symmetric ensembles. The proofs show that this general correspondence between periodic random matrix ensembles and finite complex Hermitian ensembles is elementary and combinatorial in nature.

Explore related subjects

Keep this discovery

BibTeXRIS

Roger Van Peski. 2017-09-30. Spectral distributions of periodic random matrix ensembles. https://arxiv.org/abs/1710.00240

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