Christoph Thäle

Moments and central limit theorems for some multivariate Poisson functionals

This paper deals with Poisson processes on an arbitrary measurable space. Using a direct approach, we derive formulae for moments and cumulants of a vector of multiple Wiener-Itô integrals with respect to the compensated Poisson process. Also, we present a multivariate central limit theorem for a vector whose components admit a finite chaos expansion of the type of a Poisson U-statistic. The approach is based on recent results of Peccati et al. (2010), combining Malliavin calculus and Steins method; it also yields Berry-Esseen-type bounds. As applications, we discuss moment formulae and central limit theorems for general geometric functionals of intersection processes associated with a stationary Poisson process of k-dimensional flats in .

Second-order properties and central limit theory for the vertex process of iteration infinitely divisible and iteration stable random tessellations in the plane

The point process of vertices of an iteration infinitely divisible or, more specifically, of an iteration stable random tessellation in the Euclidean plane is considered. We explicitly determine its covariance measure and its pair-correlation function, as well as the cross-covariance measure and the cross-correlation function of the vertex point process and the random length measure in the general nonstationary regime. We also give special formulae in the stationary and isotropic setting. Exact formulae are given for vertex count variances in compact and convex sampling windows, and asymptotic relations are derived. Our results are then compared with those for a Poisson line tessellation having the same length density parameter. Moreover, a functional central limit theorem for the joint process of suitably rescaled total edge counts and edge lengths is established with the process (ξ, tξ), t > 0, arising in the limit, where ξ is a centered Gaussian variable with explicitly known variance.

Limit theorems for iteration stable tessellations

The intent of this paper is to describe the large scale asymptotic geometry of iteration stable (STIT) tessellations in Rd, which form a rather new, rich and flexible class of random tessellations considered in stochastic geometry. For this purpose, martingale tools are combined with second-order formulas proved earlier to establish limit theorems for STIT tessellations. More precisely, a Gaussian functional central limit theorem for the surface increment process induced a by STIT tessellation relative to an initial time moment is shown. As second main result, a central limit theorem for the total edge length/facet surface is obtained, with a normal limit distribution in the planar case and, most interestingly, with a nonnormal limit showing up in all higher space dimensions.

Limit theory for the Gilbert graph

For a given homogeneous Poisson point process in

Discrete Malliavin–Stein method: Berry–Esseen bounds for random graphs and percolation

\mathbb{R}^d

Functional Poisson approximation in Kantorovich–Rubinstein distance with applications to U-statistics and stochastic geometry

two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random geometric graph, is investigated as the intensity of the Poisson point process is increased and the distance parameter goes to zero. The asymptotic expectation and covariance structure of a class of length-power functionals are computed. Distributional limit theorems are derived that have a Gaussian, a stable or a compound Poisson limiting distribution. Finally, concentration inequalities are provided using a concentration inequality for the convex distance.

Berry–Esseen bounds and multivariate limit theorems for functionals of Rademacher sequences

A new Berry-Esseen bound for non-linear functionals of non-symmetric and non-homogeneous infinite Rademacher sequences is established. It is based on a discrete version of the Malliavin-Stein method and an analysis of the discrete Ornstein-Uhlenbeck semigroup. The result is applied to sub-graph counts and to the number of vertices having a prescribed degree in the Erd\H{o}s-Renyi random graph. A further application deals with a percolation problem on trees.

Geometry of iteration stable tessellations: Connection with Poisson hyperplanes

A Poisson or a binomial process on an abstract state space and a symmetric function

Branching random tessellations with interaction: A thermodynamic view

f

Second-order comparison of three fundamental tessellation models

acting on