SearcharxivSearch

arXiv · 0707.3898

Multivariate normal approximation in geometric probability

Abstract

Consider a measure $μ_λ= \sum_x ξ_x δ_x$ where the sum is over points $x$ of a Poisson point process of intensity $λ$ on a bounded region in $d$-space, and $ξ_x$ is a functional determined by the Poisson points near to $x$, i.e. satisfying an exponential stabilization condition, along with a moments condition (examples include statistics for proximity graphs, germ-grain models and random sequential deposition models). A known general result says the $μ_λ$-measures (suitably scaled and centred) of disjoint sets in $R^d$ are asymptotically independent normals as $λ\to \infty$; here we give an $O(λ^{-1/(2d + ε)})$ bound on the rate of convergence. We illustrate our result with an explicit multivariate central limit theorem for the nearest-neighbour graph on Poisson points on a finite collection of disjoint intervals.

Explore related subjects

Keep this discovery

BibTeXRIS

Mathew D. Penrose, Andrew R. Wade. 2007-07-26. Multivariate normal approximation in geometric probability. https://doi.org/10.1080/15598608.2008.10411876

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