SearcharxivSearch

arXiv · 1201.5282

The scaling limit of Poisson-driven order statistics with applications in geometric probability

Abstract

Let $η_t$ be a Poisson point process of intensity $t\geq 1$ on some state space $\Y$ and $f$ be a non-negative symmetric function on $\Y^k$ for some $k\geq 1$. Applying $f$ to all $k$-tuples of distinct points of $η_t$ generates a point process $ξ_t$ on the positive real-half axis. The scaling limit of $ξ_t$ as $t$ tends to infinity is shown to be a Poisson point process with explicitly known intensity measure. From this, a limit theorem for the the $m$-th smallest point of $ξ_t$ is concluded. This is strengthened by providing a rate of convergence. The technical background includes Wiener-Itô chaos decompositions and the Malliavin calculus of variations on the Poisson space as well as the Chen-Stein method for Poisson approximation. The general result is accompanied by a number of examples from geometric probability and stochastic geometry, such as Poisson $k$-flats, Poisson random polytopes, random geometric graphs and random simplices. They are obtained by combining the general limit theorem with tools from convex and integral geometry.

Explore related subjects

Keep this discovery

BibTeXRIS

Matthias Schulte, Christoph Thaele. 2012-01-25. The scaling limit of Poisson-driven order statistics with applications in geometric probability. https://arxiv.org/abs/1201.5282

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