SearcharxivSearch

arXiv · 0804.4512

Circular Jacobi Ensembles and deformed Verblunsky coefficients

Abstract

Using the spectral theory of unitary operators and the theory of orthogonal polynomials on the unit circle, we propose a simple matrix model for the following circular analogue of the Jacobi ensemble: $$c_{δ,β}^{(n)} \prod_{1\leq k -1/2$. If $e$ is a cyclic vector for a unitary $n\times n$ matrix $U$, the spectral measure of the pair $(U,e)$ is well parameterized by its Verblunsky coefficients $(α_0, ..., α_{n-1})$. We introduce here a deformation $(γ_0, >..., γ_{n-1})$ of these coefficients so that the associated Hessenberg matrix (called GGT) can be decomposed into a product $r(γ_0)... r(γ_{n-1})$ of elementary reflections parameterized by these coefficients. If $γ_0, ..., γ_{n-1}$ are independent random variables with some remarkable distributions, then the eigenvalues of the GGT matrix follow the circular Jacobi distribution above. These deformed Verblunsky coefficients also allow to prove that, in the regime $δ= δ(n)$ with $δ(n)/n \to \dd$, the spectral measure and the empirical spectral distribution weakly converge to an explicit nontrivial probability measure supported by an arc of the unit circle. We also prove the large deviations for the empirical spectral distribution.

Explore related subjects

Keep this discovery

BibTeXRIS

Paul Bourgade, Ashkan Nikeghbali, Alain Rouault. 2010-01-11. Circular Jacobi Ensembles and deformed Verblunsky coefficients. https://arxiv.org/abs/0804.4512

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