Search arXivSearch

arXiv · 2103.09443

Random matrices with independent entries: beyond non-crossing partitions

Abstract

The scaled standard Wigner matrix (symmetric with mean zero, variance one i.i.d. entries), and its limiting eigenvalue distribution, namely the semi-circular distribution, has attracted much attention. The $2k$th moment of the limit equals the number of non-crossing pair-partitions of the set $\{1, 2, \ldots, 2k\}$. There are several extensions of this result in the literature. In this paper we consider a unifying extension which also yields additional results. Suppose $W_n$ is an $n\times n$ symmetric matrix where the entries are independently distributed. We show that under suitable assumptions on the entries, the limiting spectral distribution exists in probability or almost surely. The moments of the limit can be described through a set of partitions which in general is larger than the set of non-crossing pair-partitions. This set gives rise to interesting enumerative combinatorial problems. Several existing limiting spectral distribution results follow from our results. These include results on the standard Wigner matrix, the adjacency matrix of a sparse homogeneous Erd\H{o}s-R\'{e}nyi graph, heavy tailed Wigner matrix, some banded Wigner matrices, and Wigner matrices with variance profile. Some new results on these models and their extensions also follow from our main results.

Explore related subjects

Keep this discovery

BibTeXRIS

Arup Bose, Koushik Saha, Arusharka Sen, Priyanka Sen. 2021-03-17. Random matrices with independent entries: beyond non-crossing partitions. https://arxiv.org/abs/2103.09443

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