Search arXiv⌕ Search

arXiv · 2610.23697

Higher-order sum rules for zeros of the planar Gaussian entire function

Abstract

We establish marginal sum rules for the truncated correlation functions of zeros of the planar Gaussian entire function (GEF). For each fixed integer $k\ge2$, the integral in one coordinate converges absolutely and equals $-(k-1)$ times the truncated correlation of order $k-1$. This answers the marginal-identity question posed by Krishnapur and Yogeshwaran for the planar GEF. We also prove a criterion for simple point processes under local moment and absolute integrability assumptions. Suppose there is a sequence of compactly supported cutoffs between zero and one that are eventually equal to one on each compact set. If the variances of their linear statistics tend to zero, the marginal identities hold almost everywhere. Strong clustering and variance bounds for smooth linear statistics verify these assumptions for GEF zeros. The proof uses mixed cumulants and the partition formula relating ordinary and factorial cumulants.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiaolin Zhu, Feng Guo. 2026-10-16. Higher-order sum rules for zeros of the planar Gaussian entire function. https://arxiv.org/abs/2610.23697

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Improved Mixing Rates of Directed Cycles with Additional Sparse Interconnections

We analyze the absolute spectral gap of Markov chains on graphs obtained from a cycle of $n$ vertices and perturbed only at approximately $n^{1/ρ}$ random locations with an appropriate, possibly sparse, interconnection structure. Together with a strong asymmetry along the cycle, the gap of the resulting chain can be bounded inversely proportionally by the longest arc length (up to logarithmic factors) with high probability, providing a significant mixing speedup compared to the reversible version.

math.PR↗

Strongly vertex-reinforced jump process on graphs with bounded degree

We study asymptotic behaviours of a non-linear vertex-reinforced jump process defined on an arbitrary infinite graph with bounded degree. We prove that if the reinforcement function $w$ is reciprocally integrable and non-decreasing, then the process visits only a finite number of vertices. In the case where $w$ is regularly varying with index $α>1$, we show that the process eventually gets stuck on a star-shaped subgraph and there is exactly one vertex with unbounded local time.

math.PR↗

A Note on the Stability of Monotone Markov Chains

This note studies monotone Markov chains, a subclass of Markov chains with extensive applications in operations research and economics. While the properties that ensure the global stability of these chains are well studied, their establishment often relies on the fulfillment of a certain splitting condition. We address the challenges of verifying the splitting condition by introducing simple, applicable conditions that ensure global stability. The simplicity of these conditions is demonstrated through various examples including autoregressive processes, portfolio allocation problems and resource allocation dynamics.

math.PR↗