SearcharxivSearch

arXiv · 1304.3757

Limit operators for circular ensembles

Abstract

It is known that a unitary matrix can be decomposed into a product of reflections, one for each dimension, and the Haar measure on the unitary group pushes forward to independent uniform measures on the reflections. We consider the sequence of unitary matrices given by successive products of random reflections. In this coupling, we show that powers of the sequence of matrices converge in a suitable sense to a flow of operators which acts on a random vector space. The vector space has an explicit description as a subspace of the space of sequences of complex numbers. The eigenvalues of the matrices converge almost surely to the eigenvalues of the flow, which are distributed in law according to a sine-kernel point process. The eigenvectors of the matrices converge almost surely to vectors which are distributed in law as Gaussian random fields on a countable set. This flow gives the first example of a random operator with a spectrum distributed according to a sine-kernel point process which is naturally constructed from finite dimensional random matrix theory.

Explore related subjects

Keep this discovery

BibTeXRIS

Kenneth Maples, Joseph Najnudel, Ashkan Nikeghbali. 2013-04-13. Limit operators for circular ensembles. https://arxiv.org/abs/1304.3757

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