SearcharxivSearch

arXiv · math/0607120

Central limit theorems for Poisson hyperplane tessellations

Abstract

We derive a central limit theorem for the number of vertices of convex polytopes induced by stationary Poisson hyperplane processes in $\mathbb{R}^d$. This result generalizes an earlier one proved by Paroux [Adv. in Appl. Probab. 30 (1998) 640--656] for intersection points of motion-invariant Poisson line processes in $\mathbb{R}^2$. Our proof is based on Hoeffding's decomposition of $U$-statistics which seems to be more efficient and adequate to tackle the higher-dimensional case than the ``method of moments'' used in [Adv. in Appl. Probab. 30 (1998) 640--656] to treat the case $d=2$. Moreover, we extend our central limit theorem in several directions. First we consider $k$-flat processes induced by Poisson hyperplane processes in $\mathbb{R}^d$ for $0\le k\le d-1$. Second we derive (asymptotic) confidence intervals for the intensities of these $k$-flat processes and, third, we prove multivariate central limit theorems for the $d$-dimensional joint vectors of numbers of $k$-flats and their $k$-volumes, respectively, in an increasing spherical region.

Explore related subjects

Keep this discovery

BibTeXRIS

Lothar Heinrich, Hendrik Schmidt, Volker Schmidt. 2006-07-05. Central limit theorems for Poisson hyperplane tessellations. https://doi.org/10.1214/105051606000000033

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