SearcharxivSearch

arXiv · 1209.2366

The limiting distributions of large heavy Wigner and arbitrary random matrices

Abstract

The model of heavy Wigner matrices generalizes the classical ensemble of Wigner matrices: the sub-diagonal entries are independent, identically distributed along to and out of the diagonal, and the moments its entries are of order 1/N, where N is the size of the matrices. Adjacency matrices of Erdös-Renyi sparse graphs and matrices with properly truncated heavy tailed entries are examples of heavy Wigner matrices. We consider a family X_N of independent heavy Wigner matrices and a family Y_N of arbitrary random matrices, independent of X_N, with a technical condition (e.g. the matrices of Y_N are deterministic and uniformly bounded in operator norm, or are deterministic diagonal). We characterize the possible limiting joint *-distributions of (X_N,Y_N) in the sense of free probability. We find that they depend on more than the *-distribution of Y_N. We use the notion of distributions of traffics and their free product to quantify the information needed on Y_N and to infer the limiting distribution of (X_N,Y_N). We give an explicit combinatorial formula for joint moments of heavy Wigner and independent random matrices. When the matrices of Y_N are diagonal, we give recursion formulas for these moments. We deduce a new characterization of the limiting eigenvalues distribution of a single heavy Wigner.

Explore related subjects

Keep this discovery

BibTeXRIS

Camille Male. 2012-09-11. The limiting distributions of large heavy Wigner and arbitrary random matrices. https://arxiv.org/abs/1209.2366

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