Asymptotic expected -functionals of random polytopes
with applications to surface areas
Abstract.
An asymptotic formula is proved for the expected -functional of the convex hull of independent and identically distributed random points sampled from the Euclidean unit sphere in according to an arbitrary positive continuous density. As an application, the approximation of the sphere by random polytopes in terms of surface area differences is discussed.
Key words and phrases:
surface area, random polytope, stochastic geometry, -functional2020 Mathematics Subject Classification:
Primary: 52A22, 52A27, 60D05; Secondary: 52A20, 52B111. Introduction and main results
1.1. Introduction
Random polytopes are a cornerstone of stochastic and integral geometry. They connect convex geometry and probability, and have a number of applications in computer science, statistics and machine learning theory. There is a vast literature on the subject of random polytopes, and we refer the reader to the survey articles [2, 11, 22] and the references therein.
Random polytopes generated as the convex hull of independent and identically distributed (i.i.d.) points sampled from the Euclidean unit ball or the Euclidean unit sphere in according to the respective uniform distribution are important models that have been studied extensively in stochastic geometry. For the Euclidean ball, Wieacker [27] extended the results of Rényi and Sulanke [23] to . He obtained asymptotic formulas for the expected volume and expected surface area of a random polytope inscribed in a ball, and introduced what is known today as the -functional of a polytope in . It is defined as
where are parameters, stands for the set of -faces of for , stands for the origin of and is the Euclidean distance from to the affine hull of . In particular, we notice that is the number of -dimensional faces of and is the -content of the union of all -faces of , whereas coincides with the volume of as long as contains the origin in its interior. Later on, Affentranger [1] described for and general parameters , the asymptotic behavior, as , of the expected -functional of the convex hull of i.i.d. random points distributed according to a so-called beta distribution in the -dimensional unit ball (so-called beta polytopes). We recall that the beta distribution with parameter in the -dimensional Euclidean unit ball has Lebesgue density
For example, choosing we obtain the uniform distribution on , while the weak limit as corresponds to the uniform distribution on , the -dimensional unit sphere. An exact formula for the expected -functional of a beta polytope , defined as the convex hull of i.i.d. random points distributed with respect to the density , was provided by Kabluchko, Temesvari and Thäle [15]:
where
and is the moment of order of the volume of the -dimensional random beta simplex , whose value can be expressed in terms of gamma functions (see [15, Proposition 2.8]). Formally putting , this formula also covers the case of the convex hull of i.i.d. uniform random points on the boundary of . The expected -functional has further been determined explicitly for beta’ polytopes [15] and Gaussian polytopes [13], as well as for beta-star polytopes [7] and convex hulls of Poisson point processes [14]. The corresponding results have also found applications to stochastic geometry models in spherical and hyperbolic spaces.
In this article, we determine precise asymptotic formulas for the expected -functional of an inscribed random polytope generated by i.i.d. points selected according to a general continuous positive density function on the Euclidean unit sphere or unit ball in . We focus on the case of the -functional, in which case the summation in the definition ranges over the set of facets of . For a polytope in , we thus denote . As already pointed out above, the case gives rise to a number of important functionals of polytopes. For example:
-
•
is the number of facets of ;
-
•
is the surface area (i.e., -dimensional Hausdorff measure) of ;
-
•
is the volume of , if contains the origin in its interior.
To this list we can also add what is known as the surface area of a polytope containing the origin in its interior, which for is defined as
(1) |
For , Lutwak [18] defined the surface area measure of a general convex body in which contains the origin in its interior, and formulated and studied the famous Minkowski problem. This problem asks for necessary and sufficient conditions on a finite Borel measure on the sphere so that is the surface area of some convex body in . The important special case when is a polytope is called the discrete Minkowski problem, and for more background we refer the reader to [12, 25, 26, 29] and the references therein.
The remaining parts of this paper are structured as follows. In Section 1.2, we present our general result on the expected -functional. In Section 1.3, we discuss the special case of the surface area, followed by an application to best approximation in Section 1.4. Section 2 collects some preliminary geometric lemmas, and in Section 3 we present the proof of our main result.
1.2. Main results for the expected -functional
Our main result is an asymptotic description of the expected -functional of the convex hull of i.i.d. random points distributed according to an arbitrary positive and continuous density function on the sphere, as , for arbitrary parameter values . We would like to highlight that such a result is distinguished from those in [1, 15, 20] as we consider densities which are not necessarily rotationally invariant. In fact, choosing the uniform density, and , our result reduces to that of [20, Theorem 2] or [1, Theorem 5] (choosing there), while the exact formula for the expected -functional of a random beta polytope with general parameters can be found in [15, Theorem 2.13].
In what follows, for we shall use the notation to denote the -dimensional spherical Lebesgue measure on the -dimensional unit sphere , and we indicate the -dimensional Lebesgue measure by .
Theorem 1.1.
Let denote the convex hull of random points chosen independently according to a probability distribution, which has a positive continuous density function with respect to on . Then for any fixed ,
as , where
and is the st moment of the -dimensional volume of the random simplex spanned by i.i.d. uniform random points on the -dimensional unit sphere .
Remark 1.2.
It is interesting to observe that the rate in only depends on and does not involve the parameter . The latter only appears in the second-order term.
Remark 1.3.
One can also derive an asymptotic formula for the expected -functional of a random polytope generated as the convex hull of random points chosen independently according to a probability distribution which has a positive continuous density function with respect to the Lebesgue measure on . Since the proof is a straightforward adaptation of that of Theorem 1.1, we refrain from presenting the details.
1.3. The surface area difference
In this section, we specialize Theorem 1.1 to discuss the surface area difference of the ball and a random inscribed polytope that contains the origin in its interior. It is defined as
where we recall the definition of the surface area from (1). In fact, choosing with and , we arrive at the following result.
Corollary 1.4.
Let denote the convex hull of random points chosen independently according to a probability distribution, which has a positive continuous density function with respect to on . Then for every fixed ,
Remark 1.5.
Let denote the uniform density on . Following [24], we show that the uniform density minimizes the constant in the right-hand side of Corollary 1.4, which we denote by . Since , we can write
Applying Hölder’s inequality to the functions , , and with the exponents and , we derive that
Therefore,
It follows that for any density on the unit sphere and any ,
(2) |
which means that the minimizing density is the uniform one, independently of . Hence for every and any positive continuous density on , we have
(3) |
as . In an asymptotic sense, this is a necessary condition for the random variable to second-order stochastically dominate .
Remark 1.6.
We can rephrase the last inequality in terms of the expected -functional with and arbitrary parameter , namely, as .
1.4. Relation to best approximation
For , let denote the set of all polytopes inscribed in with at most vertices and which contain the origin in their interiors. It follows from a compactness argument that for any fixed , there exists a best-approximating polytope which achieves the minimum surface area difference
Moreover, if and , then by the cone-volume formula we have
where denotes the -dimensional Hausdorff measure of . Hence,
(4) |
where denotes the symmetric difference of and .
Interestingly, in high dimensions the random approximation of smooth convex bodies is asymptotically as good as the best approximation as , up to absolute constants; see [1, 3, 4, 5, 6, 9, 10, 16, 17, 20, 21, 24]. Choosing the minimizing density in Corollary 1.4, by Stirling’s inequality we derive
An interesting open question is to determine the optimal lower constant (up to some factor ) in the asymptotic lower bound
2. Preliminary geometric lemmas
2.1. Spherical Blaschke-Petkantschin formula
In this section, we collect a number of geometric lemmas which will be used in the proof of Theorem 1.1 below. The first ingredient we need is the spherical Blaschke-Petkantschin formula from [19, Theorem 4], which has later found a far-reaching extension in [28].
Lemma 2.1.
For , let be a nonnegative measurable function. Then
where is the hyperplane orthogonal to at distance from the origin.
2.2. Geometry of spherical caps
The next result is a useful estimate of Schütt and Werner from [24, Lemma 3.12] involving the surface area and radius of a cap of the Euclidean ball.
Lemma 2.2.
Let and denote the surface area and radius, respectively, of a cap of the Euclidean unit ball in . There exists an absolute constant such that
Each pair of and determines two caps of the sphere, one for each halfspace determined by the hyperplane . We select the halfspace that does not contain the polytope and focus on the cap . Then we let
denote the weighted surface area of the cap. Note that . We use [21, Equation (71)] to merge [21, Lemma 6] with Lemma 2.2 in the following result.
Lemma 2.3.
Fix , , and let and denote the weighted surface area and radius, respectively, of the cap . Let be chosen sufficiently small so that [21, Lemma 6] holds. Then for any , there exists a spherical cap centered at and an absolute constant such that for all ,
Proof.
Lemma 2.4.
Let be the point on with fixed outer unit normal vector , and let be the distance from to the supporting hyperplane of at , so that . Then for all sufficiently small , it holds that
(6) |
and
2.3. Random simplices
The next result is due to Miles [19, Equation (72)] for integer moments, which was extended to moments of arbitrary nonnegative real order by Kabluchko, Temesvari and Thäle [15, Proposition 2.8] for general beta (and beta’) distributions in . The following formulation is the special case .
Lemma 2.5.
Let denote the -dimensional volume of the -dimensional simplex with vertices chosen independently and uniformly from , that is, . For all real , the th moment of , denoted , is given by
The next result gives estimates for moments of an -dimensional random simplex with vertices distributed according to the restriction of the density to a great hypersphere of . For the second moment, a more general result for all sufficiently smooth convex bodies in is due to Grote and Werner [8, Lemma 3.3]. Our proof is tailored towards the case of the sphere and, as a result, is much simpler.
Lemma 2.6.
Fix . Let be the point on with fixed outer unit normal vector , and let be the distance from to the supporting hyperplane of at . Then for all sufficiently small and any ,
Proof.
We start by recalling from [21, Lemma 6] that for all sufficiently small , there exists some such that
for all points in a spherical cap of radius around an arbitrary boundary point . Thus,
with
Next, we observe that is an -dimensional sphere of radius . So, substituting for , we obtain
where the equality in the last line follows from the definition of . Since we have assumed to be small, is close to , which implies that is asymptotically equivalent to . The result thus follows. ∎
3. Proof of Theorem 1.1
3.1. Step 1: Integral representation
Choose i.i.d. random points on according to the density , and for define the random polytope as the convex hull of . Since is simplicial with probability one, we have
where
and for . Let denote the event that the origin lies in the interior of . As in [24, Lemma 4.3 (ii)] (see also the proof of Corollary 1 in [1]), we find that
for some positive constant . Furthermore, every simplicial polytope satisfies since each facet of has vertices. Since , we have . Using this and the elementary estimate , for any simplicial polytope we have . Hence, by the law of total expectation,
(7) |
Inequality (7) follows from the fact that is simplicial with probability 1 and since for , the inequality
holds with probability 1. Therefore, the second term in (7) is exponentially decreasing in , while, as we shall see, the first term is essentially of the order . Thus, the second term is negligible and we will ignore it in the subsequent computations.
Next, set
For points , we can decompose into the following union of cones with pairwise disjoint interiors:
where denotes the cone spanned by a set of vectors . For points whose affine hull is an -dimensional hyperplane , let denote the halfspace bounded by which contains the origin.
For points and a subset of indices , we define a functional by
if and , and set otherwise. Hence, we obtain
Applying Lemma 2.1, we get
(8) |
By definition, if spans a hyperplane and and . In this case, the value of only depends on . Since
(9) | ||||
we obtain
(10) |
Hence,
By Lemma 2.6 and the substitution where , we have
For and , set
where . Then by Lemma 2.4 we get
where we have used for any .
To simplify our estimates, we express the cap height in terms of its radius . Then , so , and applying the inequality for with we get
Thus, with these substitutions we obtain
By the inequalities for and , and for , we have
Now we split the previous upper bound for the expectation into two parts as
where and are defined by
and | ||||
We will see later that is of negligible order, so for now we will focus on .
3.2. Step 2: Breaking into further terms
Next, we use Lemma 2.3 to estimate the terms in the integrand of which directly involve the radius . As we shall see from the proof that follows, the term involving is of a smaller order in than , so we will focus only on the first term involving . We have
Writing
we see that the previous expression is equal to
This can be estimated from above by
for some new absolute constants . Hence, with a new absolute constant we obtain
Set and . Expanding the integrals and using the fact that the function with is nonnegative for , we derive that
This can be estimated from above by
3.3. Step 3: Dealing with the third integral
Since is continuous and positive on the compact set , it attains a positive minimum value which may depend on but not on . This implies that for any ,
Hence, the integral in the third summand can be estimated from above by
Necessarily, , for otherwise
a contradiction. Therefore,
Since the function is decreasing for , this implies that
3.4. Step 4: Putting the bounds together
Setting
and using the definition of the beta function, we obtain
From the fact that and by using the asymptotics of the ratio of gamma functions, we find that
Applying this to and in the first line of the previous estimate, in the second line and in the last line, we derive that the previous estimate is asymptotically equal to
where we also used that is asymptotically equivalent to . Now, observe that the last two summands are of negligible order compared to . Finally, we send to 0, which establishes the upper bound for . The upper bound for is handled in the very same way, and it turns out that is of the order . This proves one direction of Theorem 1.1.
The lower bound for is provided by almost exactly the same method. The main difference is that we must obtain an inclusion in the opposite direction of that in (3.1). Using the same notation as there, we note that
Therefore, using the general inequality , which holds for any probability measure and any events and , we obtain
for some positive constant . The rest of the proof of the lower bound now proceeds in the same fashion as before, but this time using the opposite inequalities provided in the preliminary geometric lemmas. ∎
Acknowledgments
BL was supported in part by National Natural Science Foundation of China (51202480). MR was supported in part by the Zuckerman STEM Leadership Program. Part of this work was completed while third named author was in residence at the Institute for Computational and Experimental Research in Mathematics in Providence, RI, during the Harmonic Analysis and Convexity program; this residency was supported by the National Science Foundation under Grant DMS-1929284. CT was supported by the DFG priority program SPP 2265 Random Geometric Systems.
We would like to thank the referee for valuable comments that helped to improve the quality of the article.
References
- [1] F. Affentranger. The convex hull of random points with spherically symmetric distributions. Rendiconti del Seminario Matematico - Politecnico di Torino, 49:359–383, 1991.
- [2] I. Bárány. Random polytopes, convex bodies, and approximation. In Stochastic geometry, volume 1892 of Lecture Notes in Mathematics, pages 77–118. Springer, Berlin, 2007.
- [3] F. Besau and S. Hoehner. An intrinsic volume metric for the class of convex bodies in . Communications in Contemporary Mathematics (to appear), 2023.
- [4] F. Besau, S. Hoehner, and G. Kur. Intrinsic and Dual Volume Deviations of Convex Bodies and Polytopes. International Mathematics Research Notices, 2021(22):17456–17513, 2021.
- [5] K. J. Böröczky and B. Csikós. Approximation of smooth convex bodies by circumscribed polytopes with respect to the surface area. Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 79:229–264, 2009.
- [6] K. J. Böröczky and M. Reitzner. Approximation of smooth convex bodies by random polytopes. The Annals of Applied Probability, 14:239–273, 2004.
- [7] T. Godland, Z. Kabluchko, and C. Thäle. Beta-star polytopes and hyperbolic stochastic geometry. Advances in Mathematics, 404(part A):Paper No. 108382, 69, 2022.
- [8] J. Grote and E. Werner. Approximation of smooth convex bodies by random polytopes. Electronic Journal of Probability, 23:1–21, 2018.
- [9] S. Hoehner and G. Kur. A Concentration Inequality for Random Polytopes, Dirichlet-Voronoi Tiling Numbers and the Geometric Balls and Bins Problem. Discrete & Computational Geometry, 65(3):730–763, 2021.
- [10] S. Hoehner, C. Schütt, and E. Werner. The Surface Area Deviation of the Euclidean Ball and a Polytope. Journal of Theoretical Probability, 31:244–267, 2018.
- [11] D. Hug. Random polytopes. In Stochastic geometry, spatial statistics and random fields, volume 2068 of Lecture Notes in Mathematics, pages 205–238. Springer, Heidelberg, 2013.
- [12] D. Hug, E. Lutwak, D. Yang, and G. Zhang. On the Minkowski Problem for Polytopes. Discrete & Computational Geometry, 33(4):699–715, 2005.
- [13] D. Hug, G. O. Munsonius, and M. Reitzner. Asymptotic mean values of Gaussian polytopes. Beiträge zur Algebra und Geometrie, 45(2):531–548, 2004.
- [14] Z. Kabluchko, A. Marynych, D. Temesvari, and C. Thäle. Cones generated by random points on half-spheres and convex hulls of poisson point processes. Probability Theory and Related Fields, 175:1021–1061, 2019.
- [15] Z. Kabluchko, D. Temesvari, and C. Thäle. Expected intrinsic volumes and facet numbers of random beta-polytopes. Mathematische Nachrichten, 292(1):79–105, 2019.
- [16] G. Kur. Approximation of the Euclidean ball by polytopes with a restricted number of facets. Studia Mathematica, 251(2):111–133, 2020.
- [17] M. Ludwig, C. Schütt, and E. M. Werner. Approximation of the Euclidean ball by polytopes. Studia Mathematica, 173:1–18, 2006.
- [18] E. Lutwak. The Brunn-Minkowski-Firey theory. I. Mixed volumes and the Minkowski problem. Journal of Differential Geometry, 38(1):131 – 150, 1993.
- [19] R. E. Miles. Isotropic random simplices. Advances in Applied Probability, 3:353–382, 1971.
- [20] J. S. Müller. Approximation of a Ball by Random Polytopes. Journal of Approximation Theory, 63:198–209, 1990.
- [21] M. Reitzner. Random points on the boundary of smooth convex bodies. Transactions of the American Mathematical Society, 354:2243–2278, 2002.
- [22] M. Reitzner. Random polytopes. In New perspectives in stochastic geometry, pages 45–76. Oxford University Press, Oxford, 2010.
- [23] A. Rényi and R. Sulanke. Über die konvexe Hülle von zufällig gewählten Punkten. Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete, 2:75–84 (1963), 1963.
- [24] C. Schütt and E. Werner. Polytopes with Vertices Chosen Randomly from the Boundary of a Convex Body, volume 1807 of Lecture Notes in Mathematics, pages 241–422. Springer, Berlin, Heidelberg, 2003.
- [25] A. Stancu. On the discrete planar -Minkowski problem. Advances in Mathematics, 167:160–174, 2002.
- [26] A. Stancu. On the number of solutions to the discrete two-dimensional -Minkowski problem. Advances in Mathematics, 180(1):290–323, 2003.
- [27] J. A. Wieacker. Einige Probleme der polyedrischen Approximation. PhD thesis, Albert-Ludwigs-Universität, Freiburg im Breisgau, 1978.
- [28] M. Zähle. A kinematic formula and moment measures of random sets. Mathematische Nachrichten, 149:325–340, 1990.
- [29] G. Zhu. The Minkowski Problem for Polytopes for . Indiana University Mathematics Journal, 66(4):1333–1350, 2017.