English
Related papers

Related papers: Intrinsic Volumes of the Maximal Polytope Process …

200 papers

The lower-dimensional maximal polytopes associated with an iteration stable (STIT) tessellation in $\RR^d$ are considered. They arise in the spatio-temporal construction process of such a tessellation as intersections of $(d-1)$-dimensional…

Probability · Mathematics 2012-09-04 Nguyen Ngoc Linh , Christoph Thaele

We observe stationary random tessellations $X=\{\Xi_n\}_{n\ge1}$ in $\mathbb{R}^d$ through a convex sampling window $W$ that expands unboundedly and we determine the total $(k-1)$-volume of those $(k-1)$-dimensional manifold processes which…

Probability · Mathematics 2007-09-14 Lothar Heinrich , Hendrik Schmidt , Volker Schmidt

The intent of this paper is to describe the large scale asymptotic geometry of iteration stable (STIT) tessellations in $\mathbb{R}^d$, which form a rather new, rich and flexible class of random tessellations considered in stochastic…

Probability · Mathematics 2014-12-25 Tomasz Schreiber , Christoph Thaele

A planar stationary and isotropic STIT tessellation at time $t>0$ is observed in the window $W_\rho={t^{-1}}\sqrt{\pi \ \rho}\cdot [-\frac{1}{2},\frac{1}{2}]^2$, for $\rho>0$. With each cell of the tessellation, we associate the inradius,…

Probability · Mathematics 2018-12-31 Nicolas Chenavier , Werner Nagel

The convex hull of several i.i.d. beta distributed random vectors in $\mathbb R^d$ is called the random beta polytope. Recently, the expected values of their intrinsic volumes, number of faces, normal and tangent angles and other quantities…

Probability · Mathematics 2021-11-16 Ekaterina Simarova

This paper deals with iteration stable (STIT) tessellations, and, more generally, with a certain class of tessellations that are infinitely divisible with respect to iteration. They form a new, rich and flexible class of spatio-temporal…

Probability · Mathematics 2013-03-04 Tomasz Schreiber , Christoph Thaele

The intrinsic volumes induced by a stationary Poisson k-flat process inside a compact and convex sampling window are considered. Using techniques from stochastic analysis, more precisely calculus with multiple stochastic integrals and a…

Probability · Mathematics 2011-04-13 Matthias Schulte , Christoph Thaele

Consider the random polytope, that is given by the convex hull of a Poisson point process on a smooth convex body in $\mathbb{R}^d$. We prove central limit theorems for continuous motion invariant valuations including the Will's functional…

Probability · Mathematics 2019-04-02 Jens Grygierek

Short and transparent proofs of central limit theorems for intrinsic volumes of random polytopes in smooth convex bodies are presented. They combine different tools such as estimates for floating bodies with Stein's method from probability…

Metric Geometry · Mathematics 2017-11-06 Christoph Thaele , Nicola Turchi , Florian Wespi

Let $X_1,\ldots,X_N$, $N>n$, be independent random points in $\mathbb{R}^n$, distributed according to the so-called beta or beta-prime distribution, respectively. We establish threshold phenomena for the volume, intrinsic volumes, or more…

Metric Geometry · Mathematics 2018-06-15 Gilles Bonnet , Giorgos Chasapis , Julian Grote , Daniel Temesvari , Nicola Turchi

Intrinsic volumes, which generalize both Euler characteristic and Lebesgue volume, are important properties of $d$-dimensional sets. A random cubical complex is a union of unit cubes, each with vertices on a regular cubic lattice,…

Probability · Mathematics 2021-08-24 Michael Werman , Matthew L. Wright

We establish central limit theorems for natural volumes of random inscribed polytopes in projective Riemannian or Finsler geometries. In addition, normal approximation of dual volumes and the mean width of random polyhedral sets are…

Metric Geometry · Mathematics 2020-05-22 Florian Besau , Daniel Rosen , Christoph Thäle

We prove matching asymptotic lower and upper bounds on the variances of the intrinsic volumes and the number of $k$-faces of $d$-dimensional random beta-polytopes. Using Stein's methods, we establish central limit theorems for the intrinsic…

Metric Geometry · Mathematics 2025-12-04 Ferenc Fodor , Balázs Grünfelder

The intrinsic volumes of Gaussian polytopes are considered. A lower variance bound for these quantities is proved, showing that, under suitable normalization, the variances converge to strictly positive limits. The implications of this…

Probability · Mathematics 2017-11-06 Imre Bárány , Christoph Thaele

The intrinsic volumes of a convex cone are geometric functionals that return basic structural information about the cone. Recent research has demonstrated that conic intrinsic volumes are valuable for understanding the behavior of random…

Metric Geometry · Mathematics 2015-07-14 Michael B. McCoy , Joel A. Tropp

Let $K$ be a $d$ dimensional convex body with a twice continuously differentiable boundary and everywhere positive Gauss-Kronecker curvature. Denote by $K_n$ the convex hull of $n$ points chosen randomly and independently from $K$ according…

Metric Geometry · Mathematics 2015-02-25 Imre Bárány , Ferenc Fodor , Viktor Vígh

Processes of random tessellations of the Euclidean space $\mathbb{R}^d$, $d\geq 1$, are considered which are generated by subsequent division of their cells. Such processes are characterized by the laws of the life times of the cells until…

Probability · Mathematics 2024-05-08 Servet Martínez , Werner Nagel

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…

Probability · Mathematics 2011-04-05 Tomasz Schreiber , Christoph Thaele

We describe a maximum entropy approach for computing volumes and counting integer points in polyhedra. To estimate the number of points from a particular set X in R^n in a polyhedron P in R^n, by solving a certain entropy maximization…

Combinatorics · Mathematics 2009-07-15 Alexander Barvinok , John Hartigan

We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…

Data Structures and Algorithms · Computer Science 2023-12-08 David Gamarnik , Devin Smedira
‹ Prev 1 2 3 10 Next ›