SearcharxivSearch

arXiv · 1408.2218

Spectral Distribution of Non-independent Random Matrix Ensembles induced by Lacunary Systems

Abstract

For two lacunary sequences $(M_{n,1})_{n\geq 2},(M_{n,2})_{n\geq 0}$ and suitable functions $f$ we introduce random matrix ensembles with \begin{equation*} X_{n,n'}=f(M_{n+n',1}x_1,M_{|n-n'|,2}x_2). \end{equation*} We prove weak convergence of the mean empirical eigenvalue distribution towards the semicircle law under some further number theoretic properties of the sequence $(M_{n,1})_{n\geq 1}$. Furthermore we give examples to show that even in this particular class of random matrix ensembles the asymptotic behaviour of the spectrum becomes delicate. We prove that the empirical spectral distribution does not converge to the semicircle law in general even if the correlation of two entries decays exponentially in the distance. For $f(x_1,x_2)=1/\sqrt{2}\cdot(\cos(2\pi(x_1+x_2))+\cos(4\pi(x_1+x_2)))$ and $M_{n,1}=2^n$ we show that the mean empirical spectral distribution does not converge to semicircle law while for any sequence $(M_{n,1})_{n\geq 1}$ with $M_{n+1,1}/M_{n,1}\to\infty$ for $n\to\infty$ and any periodic function $f$ of finite total variation in the sense of Hardy and Krause with mean zero and unit variance the mean spectral distribution converges to the semicircle law.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas Löbbe. 2014-08-10. Spectral Distribution of Non-independent Random Matrix Ensembles induced by Lacunary Systems. https://arxiv.org/abs/1408.2218

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