SearcharxivSearch

arXiv · 1206.4807

Distances between Poisson k-flats

Abstract

The distances between flats of a Poisson $k$-flat process in the $d$-dimensional Euclidean space with $k<d/2$ are discussed. Continuing an approach originally due to Rolf Schneider, the number of pairs of flats having distance less than a given threshold and midpoint in a fixed compact and convex set is considered. For a family of increasing convex subsets, the asymptotic variance is computed and a central limit theorem with an explicit rate of convergence is proven. Moreover, the asymptotic distribution of the $m$-th smallest distance between two flats is investigated and it is shown that the ordered distances form asymptotically after suitable rescaling an inhomogeneous Poisson point process on the positive real axis. A similar result with a homogeneous limiting process is derived for distances around a fixed, strictly positive value. Our proofs rely on recent findings based on the Wiener-Itô chaos decomposition and the Malliavin-Stein method.

Explore related subjects

Keep this discovery

BibTeXRIS

Matthias Schulte, Christoph Thaele. 2012-06-21. Distances between Poisson k-flats. https://arxiv.org/abs/1206.4807

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