SearcharxivSearch

arXiv · 2609.06583

A Functional Central Limit Theorem for Window Counts of Hardy--Szeg\H{o} Zeros

Abstract

The Hardy--Szeg\H{o} zero process, investigated in the disk by Peres and Vir\'ag through the independent identically distributed Gaussian analytic function, is a canonical conformally invariant determinantal point process. This paper studies its upper half-plane realization. Although conformally equivalent to the disk model, this realization has its own natural geometry: real-translation invariance turns the process into a stationary object along the boundary and makes long horizontal windows the natural observables. For every admissible height window, we prove a Donsker-type functional central limit theorem for the centered zero counts in expanding horizontal windows, with an explicit intensity and variance depending on the height window. The proof is based on factorial cumulants and Brillinger mixing. The main technical input is a family of all-order integrability estimates for reduced cumulant densities, obtained by exploiting the determinantal cycle structure before integrating over the height variables. As further consequences, we derive an explicit covariance density, an asymptotic variance formula, and a macroscopic Gaussian white-noise limit for linear statistics.

Explore related subjects

Keep this discovery

BibTeXRIS

Qian Ai, Feng Guo, Qi Zhou. 2026-09-06. A Functional Central Limit Theorem for Window Counts of Hardy--Szeg\H{o} Zeros. https://arxiv.org/abs/2609.06583

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