SearcharxivSearch

arXiv · 2603.23053

Chaos and Superconcentration for Poisson Functionals with Applications in Stochastic Geometry

Abstract

We consider square-integrable functionals of Poisson point processes for which the variance upper bound provided by the classical Poincar\'{e} inequality is suboptimal, a phenomenon known as superconcentration. In this paper, we establish a rigorous mathematical equivalence between superconcentration and the chaotic behaviour of the functional, and certain associated random sets, under perturbations driven by the Ornstein-Uhlenbeck semigroup on the Poisson space. Leveraging the Malliavin-Stein method, we develop general variance identities and bounds for Poisson functionals, providing a unified framework to prove superconcentration, particularly for geometric functionals that can be expressed as a sum of local score functions. We apply our results to rigorously establish superconcentration and the chaotic behaviour in some models of stochastic geometry. Specifically, we analyse horizontal box-crossing indicators in certain critical continuum percolations, as well as the number of vertices with small degrees and the number of isolated $\Gamma$-components in random geometric graphs in the dense regime.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chinmoy Bhattacharjee, Rowan O'Clarey. 2026-03-24. Chaos and Superconcentration for Poisson Functionals with Applications in Stochastic Geometry. https://arxiv.org/abs/2603.23053

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