Asymptotic normality for random simplices and convex bodies in high dimensions
David Alonso-Guti\'errez, Florian Besau, Julian Grote, Zakhar, Kabluchko, Matthias Reitzner, Christoph Th\"ale, Beatrice-Helen Vritsiou,, Elisabeth M. Werner

TL;DR
This paper proves central limit theorems for the log-volume of high-dimensional random convex bodies, including simplices and bodies generated from radially symmetric measures, showing asymptotic normality as dimension grows.
Contribution
It establishes the asymptotic normality of log-volumes for a broad class of high-dimensional random convex bodies, extending previous results to new distributions and settings.
Findings
Asymptotic normality for log-volumes of random simplices with i.i.d. vertices.
Normal approximation for convex bodies with vertices from radially symmetric measures.
Results hold as dimension tends to infinity, covering various distributions.
Abstract
Central limit theorems for the log-volume of a class of random convex bodies in are obtained in the high-dimensional regime, that is, as . In particular, the case of random simplices pinned at the origin and simplices where all vertices are generated at random is investigated. The coordinates of the generating vectors are assumed to be independent and identically distributed with subexponential tails. In addition, asymptotic normality is established also for random convex bodies (including random simplices pinned at the origin) when the spanning vectors are distributed according to a radially symmetric probability measure on the -dimensional -ball. In particular, this includes the cone and the uniform probability measure.
| central limit theorem | ||
|---|---|---|
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Asymptotic normality for random simplices and convex bodies in high dimensions
D. Alonso-Gutiérrez
University of Zaragoza, Spain
,
F. Besau
Vienna University of Technology, Austria
,
J. Grote
University of Ulm, Germany
,
Z. Kabluchko
University of Münster, Germany
,
M. Reitzner
University of Osnabrück, Germany
,
C. Thäle
Ruhr University Bochum, Germany
,
B.-H. Vritsiou
University of Alberta in Edmonton, Canada
and
E. Werner
Case Western Reserve University, USA
Abstract.
Central limit theorems for the log-volume of a class of random convex bodies in are obtained in the high-dimensional regime, that is, as . In particular, the case of random simplices pinned at the origin and simplices where all vertices are generated at random is investigated. The coordinates of the generating vectors are assumed to be independent and identically distributed with subexponential tails. In addition, asymptotic normality is established also for random convex bodies (including random simplices pinned at the origin) when the spanning vectors are distributed according to a radially symmetric probability measure on the -dimensional -ball. In particular, this includes the cone and the uniform probability measure.
Key words and phrases:
central limit theorem, high dimensions, -ball, random convex body, random determinant, random parallelotope, random polytope, random simplex, stochastic geometry
2010 Mathematics Subject Classification:
52A22, 52A23, 60D05, 60F05
1. Introduction and main results
1.1. Motivation
Central limit theorems for random polytopes in are widely known if the space dimension is kept fixed, while the number of generating points tends to infinity. We refer, for example, to the survey articles of Bárány [3], Hug [8] and Reitzner [17] for results in this direction and for further references. In the present paper we investigate the case where the number of generating points is essentially equal to the space dimension and both tend to infinity simultaneously. To be more precise, we consider the case of random -dimensional simplices in , where we distinguish between the case of generating points chosen at random, or the case where we only have random points and the st vertex is fixed at the origin. The latter construction is called a pinned simplex in the following. Asymptotic normality for the log-volume of random simplices in high dimensions has previously been considered by Ruben [18], Maehara [11] and Mathai [10]. Note however, that in their results the dimension of the random (pinned) simplices is kept fixed, while the space dimension tends to infinity. For Gaussian and so-called beta simplices Eichelsbacher and Knichel [6] and Grote, Kabluchko and Thäle [7] recently also studied a number of probabilistic limit theorems where the simplex dimension tends to infinity as well.
Our main result is a central limit theorem for the log-volume of a random -dimensional simplix in , see Theorem 1.1 below. For an -dimensional random simplex that is pinned, it is known that its volume is determined by the absolute value of the determinant of the matrix whose columns are given by the generating vectors from the origin. As a consequence, if these columns are filled by independent and identically distributed (i.i.d.) random variables, a central limit theorem for the log-volume of random pinned simplex follows from the central limit theorem for random determinants with i.i.d. entries established by Nguyen and Vu [13].
The same arguments cannot directly be applied if the coordinates of the generating points are not independent, that is, for example if the points are chosen with respect to a probability measure in the -ball with . However, we still succeed in establishing a central limit theorem for random pinned simplices in the -ball for certain radially symmetric probability measures, which include in particular the uniform probability measure and the cone-volume measure, see Theorem 1.3 below. In our proof we employ different tools, most notably a Schechtman-Zinn-type probabilistic representation of Barthe, Guédon, Mendelson and Naor [4], which allow us to relate the log-volume of the random pinned simplex to the determinant of a matrix with independent entries. Hence, although the coordinates of the generating vectors are now no longer independent, at the core of our argument we can still rely on the central limit theorem for the determinant of random matrices with i.i.d. entries.
1.2. Main results: the case of independent coordinates
Let be a probability measure on () and let be independent random vectors distributed according to . We define the random simplex
[TABLE]
as well as the random pinned simplex
[TABLE]
In what follows, we shall focus on the case where the coordinates , , of the random vectors are independent copies of a random variable . Furthermore, we assume that the random variable is symmetric, has variance one and subexponential tails with exponent . By the latter we mean that there are constants such that
[TABLE]
Examples are the uniform distribution on the cube , the uniform distribution on the discrete cube , the two-sided exponential distribution, standard Gaussian distribution on or, more generally, the -generalized Gaussian distribution with density proportional to (for an appropriate choice of ) for any .
In our first result we establish a central limit theorem for the log-volume of the high-dimensional random simplices and , as . In the following always denotes a standard Gaussian random variable and indicates convergence in distribution.
Theorem 1.1** (CLT for random simplices).**
Let be a symmetric random variable with variance one and subexponential tails with exponent .
- i)
Assume \Sigma_{n}:=\operatorname{conv}\bigl{(}\{X_{0},X_{1},\dotsc,X_{n}\}\bigr{)} is a random simplex in with having i.i.d. coordinates . Then
[TABLE] 2. ii)
Assume \Sigma_{n}^{0}:=\operatorname{conv}\bigl{(}\{0,X_{1},\dotsc,X_{n}\}\bigr{)} is a random simplex in with having i.i.d. coordinates . Then
[TABLE]
Part ii) of Theorem 1.1 can be reformulated for the parallelotope spanned by the vertices of the pinned simplex from the origin. Even more generally, for a convex body , that is a compact convex subset with non-empty interior, and random points we define the random convex body
[TABLE]
We note that for each and each convex body , is a random closed set in the usual sense of stochastic geometry, cf. [9, Chapter 16]. In particular, this implies that that the volume of is an ordinary random variable. As observed by Paouris and Pivovarov [15, 16], this concept generalizes a number of common constructions. Namely,
- a)
if is the standard simplex
[TABLE]
then coincides with the pinned simplex . 2. b)
if is the unit cube , then is the parallelotope spanned by from the origin. 3. c)
if is the symmetric cube, then is the zonotope generated by the segments , i.e.,
[TABLE] 4. d)
if is the cross-polytope, then is the symmetric convex hull of the points . 5. e)
if is the unit ball, then is an ellipsoid, that is, it is the image of the unit ball under the linear map whose matrix is generated by the random points .
As a generalization of part ii) of Theorem 1.1 we obtain the following central limit theorem for the log-volume of the random convex bodies . In the following we denote by the Kolmogorov distance between random variables, that is, for two random variables we have
[TABLE]
Note that convergence in the Kolmogorov distance implies convergence in distribution. Also, by we denote some sequence with , as .
Theorem 1.2**.**
Let be a symmetric random variable with variance one and subexponential tails with exponent . Let be a sequence of convex bodies such that . If are random points in with i.i.d. coordinates , and is the random convex body as defined by (2), then
[TABLE]
More precisely, we have that
[TABLE]
As an application of Theorem 1.2 we may revisit the special cases a) – d) of the random convex bodies mentioned above. The resulting central limit theorems are summarized in Table 1. In particular, taking for each , we also obtain part ii) of Theorem 1.1.
1.3. Main results: the case of -balls
For the -dimensional -ball is defined as
[TABLE]
where the -norm (or quasi-norm if ) of is
[TABLE]
In our next result we consider pinned simplices, denoted by , which are spanned by the origin and points chosen at random with respect to a radially symmetric probability measure on the -dimensional -ball . More specifically, belongs to a family of measures including the cone probability measure and the uniform probability measure on which is driven by a parameter . This model contains a number of special cases that are of particular interest (see Theorem 1, Theorem 3, Corollary 3 and Corollary 4 in [4] as well as the discussion before Theorem 1.1 in [2]). Namely, if , then the random points are distributed according to the cone probability measure on the boundary of , i.e., the -sphere in . It is well known that this measure coincides with the normalized surface measure precisely if . Next, if , then are selected according to the uniform distribution on . Finally, if for some , then the distribution corresponds to the image of the cone probability measure on under the orthogonal projection onto the first coordinates. Similarly, if , then the points are sampled according to the image of the uniform distribution on under the same projection. We refer to Section 3 for the precise construction of .
Theorem 1.3** (CLT for random convex bodies in the -ball).**
Let be independent random points in the -ball with respect to a probability measure as defined in Section 3.1. Let be a sequence of convex bodies such that and be the random convex body generated by -distributed random points as defined by (2). Then
[TABLE]
as , where . More precisely, we have that
[TABLE]
By choosing for each , as the standard simplex we obtain the following central limit theorem as a direct corollary to Theorem 1.3.
Corollary 1.4** (CLT for random pinned simplices in the -ball).**
Let be the random pinned simplex that is spanned by the origin and independent random points in the -ball which are distributed according to a probability measure as defined in Section 3.1. Then
[TABLE]
where .
1.4. Plan of the paper
In the next Section we outline the proof of Theorem 1.1 and of Theorem 1.2. We will collect the relevant tools along the way. As mentioned in the introduction, the proof of Theorem 1.1 essentially relies on the central limit theorem for determinants of random matrices of Nguyen and Vu [13] with additional arguments for the non-pinned case. In Section 3 we present the details of the proof of Theorem 1.3 and recall the definition of the special measure . For the proof of Theorem 1.3 we especially need the Schechtman-Zinn-type probabilistic representation from [4].
Acknowledgment
The authors started this project within a working group that formed during the Mini-Workshop Perspectives in High-dimensional Probability and Convexity at the Mathematisches Forschungsinstitut Oberwolfach (MFO). All support is gratefully acknowledged.
D.A.-G. is partially supported by DGA grant E26_17R and MINECO grant MTM2016-77710-P and IUMA. F.B. was partially supported by the Deutsche For-schungsgemeinschaft (DFG) grant BE 2484/5-2. J.G. was supported by DFG via RTG 2131 “High-dimensional Phenomena in Probability – Fluctuations and Discontinuity”. E.W. was partially supported by NSF grant DMS-1811146.
2. Proof of Theorem 1.1 and Theorem 1.2
2.1. Proof of Theorem 1.2 and part ii) of Theorem 1.1
Let us first recall the central limit theorem of Nguyen and Vu for the log-determinant of random matrices with independent entries.
Theorem 2.1** ([13, Theorem 1.1]).**
Let be an random matrix whose entries are independent random variables with zero mean, variance one and subexponential tails with exponent . Further, let be a standard Gaussian random variable. Then,
[TABLE]
More precisely, the rate of convergence is
[TABLE]
for all large enough.
Next, we recall the definition (2) of the random convex bodies and observe that
[TABLE]
see, for example, [16, Proposition 2.1]. This implies that
[TABLE]
and hence Theorem 1.2 is a direct consequence of Theorem 2.1. Moreover, taking for each and recalling that , we may derive part ii) in Theorem 1.1 by Stirling’s formula,
[TABLE]
2.2. Proof of part i) in Theorem 1.1
We now prove the central limit theorem for the log-volume of random simplices . First, notice that the volume of can be identified with the volume of a pinned simplex in by the classical projective construction (see also Figure 1). Given points in we consider the points for . We set and find that
[TABLE]
Now let be the vector whose entries are given by the th row of the matrix for . Then is a random vector in with independent coordinates distributed like . Notice that the last row in the matrix is just the constant vector . Let be another random vector with independent entries distributed like . We compare the random matrix with the random matrix . Notice that the latter now has independent and identically distributed entries. We have
[TABLE]
where is the -dimensional linear subspace spanned by in and denotes the distance of a vector to . Collecting all of the above we conclude that
[TABLE]
We will show that
[TABLE]
as . Then we may conclude by Slutsky’s theorem (see, for example, [5, Proposition A.42 (b)]) and the central limit theorem for the log-determinant, Theorem 2.1, that
[TABLE]
converges in distribution to a standard Gaussian random variable , as .
To prove (5) we need the following two auxiliary results.
Lemma 2.2** (Berry-Esseen inequality [13, Lemma 8.1]).**
Let be a random vector whose coordinates are independent copies of a random variable with mean zero, variance one and subexponential tails with exponent and let be a fixed unit vector in . Then there exists a constant such that
[TABLE]
Lemma 2.3** ([14, Theorem 1.4] for subexponential tails, see Remark 2.4 below).**
Suppose is a linear subspace spanned by independent random vectors in each of whose coordinates are independent copies of a random variable with zero mean, variance one and subexponential tails with exponent . Let be a unit normal vector to .
- •
Then there are constants such that
[TABLE]
for every . As a consequence, with probability , say, we have that
[TABLE]
for some constant .
- •
If is a fixed sequence of unit random vectors , then
[TABLE]
Remark 2.4**.**
Note that [14, Theorem 1.4] is stated for subgaussian random variables. By [14, Remark 2.3] the theorem holds true also for random variables with subexponential tails with exponent , but one has to be more generous with the estimates.
With probability one the vectors span a random -dimensional linear subspace in and we denote by a unit normal vector to . Then
[TABLE]
where is the standard scalar product in .
For the first estimate we set
[TABLE]
use (8), and conclude by the continuous mapping theorem [9, Lemma 4.3], applied to the absolute-value function, that
[TABLE]
as . This settles the first case of (5).
The second statement of (5) also follows by Slutsky’s theorem once we show that
[TABLE]
To prove this we use Lemma 2.2 and the first part of Lemma 2.3. We condition on to fix and combine (7) with (6). To be more precise, we have
[TABLE]
Here denotes the conditional probability given , where is the linear space spanned by and denotes expectation with respect to . If we condition on , then is a fixed unit vector in and we may apply the Berry-Esseen inequality (6) with there to deduce that
[TABLE]
Moreover, from (7) we conclude that there exist constants such that
[TABLE]
holds true with probability for sufficiently large . Hence we have
[TABLE]
Finally, we notice that the last expression tends to zero, as . This yields (10) and completes the proof.
3. Proof of Theorem 1.3
3.1. The probability measures on the -ball
Denote for each by random variables with density
[TABLE]
Note that has zero mean and variance one and subexponential tails with exponent . In addition, let and, for each , be random variables which are gamma distributed with shape and rate . More specifically this means that has density for , provided that , and we use the convention that with probability one in case that . We shall assume that all the random variables we are considering are independent.
Next, we define the random vectors by putting
[TABLE]
for . By we denote the distribution of the random variables on the -ball . Finally, we let be the random convex body that is generated by a fixed convex body and the independent random points for a distribution , which we consider to be fixed in this section.
3.2. Proof of Theorem 1.3
Recall that by (4) we have
[TABLE]
which yields
[TABLE]
Now we may apply the central limit theorem for the log-determinant Theorem 2.1 and obtain
[TABLE]
and moreover . To complete the proof of Theorem 1.3 we need to show that
[TABLE]
and then apply Slutsky’s theorem. Indeed, putting together (12) with (13) and (14) implies that
[TABLE]
as desired. For all we have that
[TABLE]
see for example [2, Lemma 4.1]. Hence, once we show that
[TABLE]
we may conclude, by setting and applying Theorem 2.1, that
[TABLE]
This will finish the proof of Theorem 1.3.
3.3. Proof of (15)
We observe that the representation
[TABLE]
and the semigroup property of the gamma distributions imply that is gamma distributed with shape and rate , i.e., the Lebesgue density of on is given by
[TABLE]
Recalling that by assumption is gamma distributed with shape and rate we find that is also gamma distributed with parameter shape and rate . Hence, is log-gamma distributed with Lebesgue density on given by
[TABLE]
In particular, by direct computation, we find that
[TABLE]
where is the digamma function (see e.g. [1, page 259]). Similarly, for the variance, one has that
[TABLE]
with being the trigamma function (see e.g. [1, page 260]).
This implies that the auxiliary random variables
[TABLE]
satisfy
[TABLE]
The asymptotic expansions of the digamma and trigamma functions are
[TABLE]
for (see [1, page 260]). Hence
[TABLE]
for , and
[TABLE]
In particular, for all choices of we find that . By the triangle inequality we have
[TABLE]
and therefore there exists such that
[TABLE]
for all large enough. By the Chebyshev inequality this yields
[TABLE]
for all large enough. Thus, (15) holds true and the proof is complete.
Remark 3.1**.**
More general distributions for the random variables are possible. For example, our proof shows that, as long as is a non-negative random variable and {\rm Var}\ln(\|G_{i}\|_{p}^{p}+Q_{i})=O\bigl{(}{\rm Var}\ln(\|G_{i}\|_{p}^{p})\bigr{)}=O(p/n), we have a CLT as above with the same scaling factor and a suitably modified final centering term.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Abramowitz I.A. Stegun, Handbook of Mathematical Functions , Dover Publications (1965).
- 2[2] D. Alonso-Gutiérrez, J. Prochno, C. Thäle, Gaussian fluctuations for high-dimensional random projections of ℓ p n superscript subscript ℓ 𝑝 𝑛 \ell_{p}^{n} -balls , accepted for publication in Bernoulli (2018 + ).
- 3[3] I. Bárány, Random polytopes, convex bodies, and approximation , in Weil, W. (Ed.) Stochastic Geometry , Lecture Notes in Mathematics 1892 , Springer (2007).
- 4[4] F. Barthe, O. Guédon, S. Mendelson, A. Naor, A probabilistic approach to the geometry of the ℓ p n subscript superscript ℓ 𝑛 𝑝 \ell^{n}_{p} -ball , Ann. Probab. 33 (2005), 480–513.
- 5[5] R.F. Bass, Stochastic Processes , Cambridge University Press (2011).
- 6[6] P. Eichelsbacher and L. Knichel, Fine asymptotics for models with Gamma type moments , ar Xiv: 1710.06484 .
- 7[7] J. Grote, Z. Kabluchko C. Thäle, Limit theorems for random simplices in high dimensions , ALEA Lat. Am. J. Probab. Math. Stat. 16 (2019), 141–177.
- 8[8] D. Hug, Random polytopes , in: Spodarev, E. (Ed.), Stochastic Geometry, Spatial Statistics and Random Fields. Asymptotic Methods , Lecture Notes in Mathematics 2068 , Springer (2013).
