SearcharxivSearch

arXiv · 1205.5355

Universality for zeros of random analytic functions

Abstract

Let $ξ_0,ξ_1,...$ be independent identically distributed (i.i.d.) random variables such that $\E \log (1+|ξ_0|)<\infty$. We consider random analytic functions of the form $$ G_n(z)=\sum_{k=0}^{\infty} ξ_k f_{k,n} z^k, $$ where $f_{k,n}$ are deterministic complex coefficients. Let $ν_n$ be the random measure assigning the same weight $1/n$ to each complex zero of $G_n$. Assuming essentially that $-\frac 1n \log f_{[tn], n}\to u(t)$ as $n\to\infty$, where $u(t)$ is some function, we show that the measure $ν_n$ converges weakly to some deterministic measure which is characterized in terms of the Legendre--Fenchel transform of $u$. The limiting measure is universal, that is it does not depend on the distribution of the $ξ_k$'s. This result is applied to several ensembles of random analytic functions including the ensembles corresponding to the three two-dimensional geometries of constant curvature. As another application, we prove a random polynomial analogue of the circular law for random matrices.

Explore related subjects

Keep this discovery

BibTeXRIS

Zakhar Kabluchko, Dmitry Zaporozhets. 2012-05-24. Universality for zeros of random analytic functions. https://arxiv.org/abs/1205.5355

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