Search arXivSearch

arXiv · 2207.11142

Central limit theorems and asymptotic independence for local $U$-statistics on diverging halfspaces

Abstract

We consider the stochastic behavior of a class of local $U$-statistics of Poisson processes$-$which include subgraph and simplex counts as special cases, and amounts to quantifying clustering behavior$-$for point clouds lying in diverging halfspaces. We provide limit theorems for distributions with light and heavy tails. In particular, we prove finite-dimensional central limit theorems. In the light tail case we investigate tails that decay at least as slow as exponential and at least as fast as Gaussian. These results also furnish as a corollary that $U$-statistics for halfspaces diverging at different angles are asymptotically independent, and that there is no asymptotic independence for heavy-tailed densities. Using state-of-the-art bounds derived from recent breakthroughs combining Stein's method and Malliavin calculus, we quantify the rate of this convergence in terms of Kolmogorov distance. We also investigate the behavior of local $U$-statistics of a Poisson Process conditioned to lie in diverging halfspace and show how the rate of convergence in the Kolmogorov distance is faster the lighter the tail of the density is.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrew M. Thomas. 2022-07-22. Central limit theorems and asymptotic independence for local $U$-statistics on diverging halfspaces. https://arxiv.org/abs/2207.11142

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