SearcharxivSearch

arXiv · 1709.06522

Geometric inequalities, stability results and Kendall's problem in spherical space

Abstract

In Euclidean space, the asymptotic shape of large cells in various types of Poisson driven random tessellations has been the subject of a famous conjecture due to David Kendall. Since shape is a geometric concept and large cells are identified by means of geometric size functionals, the resolution of the conjecture is inevitably connected with geometric inequalities of isoperimetric type and their improvements in the form of geometric stability results, relating geometric size functionals and hitting functionals. The latter are deterministic characteristics of the underlying random tessellation. The current work explores specific and typical cells of random tessellations in spherical space. A key ingredient of our approach are new geometric inequalities and quantitative strengthenings in terms of stability results for quite general and some specific size and hitting functionals of spherically convex bodies. As a consequence we obtain probabilistic deviation inequalities and asymptotic distributions of quite general size functionals. In contrast to the Euclidean setting, where the asymptotic regime concerns large size, in the spherical framework the asymptotic analysis is concerned with high intensities.

Explore related subjects

Keep this discovery

BibTeXRIS

Daniel Hug, Andreas Reichenbacher. 2017-09-19. Geometric inequalities, stability results and Kendall's problem in spherical space. https://arxiv.org/abs/1709.06522

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