相关论文: Central limit theorems for Gaussian polytopes

For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…

We show that the linear statistics of eigenvalues of circulant matrix obey the Gaussian central limit theorem for a large class of input sequences.

We prove a central limit theorem for non-commutative random variables in a von Neumann algebra with a tracial state: Any non-commutative polynomial of averages of i.i.d. samples converges to a classical limit. The proof is based on a…

For natural numbers $n$ and $l > d \geq 2$, let $ES_d(l,n)$ be the minimum $N$ such that any set of at least $N$ points in $\mathbb{R}^d$ contains either $l$ points contained in a common $(d-1)$-dimensional hyperplane or $n$ points in…

We establish a central limit theorem for the eigenvalue counting function of a matrix of real Gaussian random variables.

Let $U_1,U_2,\ldots$ be random points sampled uniformly and independently from the $d$-dimensional upper half-sphere. We show that, as $n\to\infty$, the $f$-vector of the $(d+1)$-dimensional convex cone $C_n$ generated by $U_1,\ldots,U_n$…

The purpose of this note is to recall one remarkable theorem of Khinchin about the special role of the Gaussian distribution. This theorem allows us to give a new interpretation of the Lindeberg condition: it guarantees the uniform…

We uncover geometric aspects that underlie the sum of two independent stochastic variables when both are governed by q-Gaussian probability distributions. The pertinent discussion is given in terms of random vectors uniformly distributed on…

A strengthened version of the central limit theorem for discrete random variables is established, relying only on information-theoretic tools and elementary arguments. It is shown that the relative entropy between the standardised sum of…

Consider $d+2$ i.i.d. random points $X_1,\ldots, X_{d+2}$ in $\mathbb R^d$. In this note, we compute the probability that their convex hull is a simplex focusing on three specific distributional settings: (i) the distribution of $X_1$ is…

We derive lower estimates for the approximation of the $d$-dimensional Euclidean ball by polytopes with a fixed number of $k$-dimensional faces, $k\in\{0,1,\ldots,d-1\}$. The metrics considered include the intrinsic volume difference and…

Let $K$ be a convex body in $\Bbb R^{d}$ and $K_{t}$ its floating bodies. There is a polytope with at most $n$ vertices that satisfies $$ K_{t} \subset P_{n} \subset K $$ where $$ n \leq e^{16d} \frac{vol_{d}(K \setminus K_{t})}{t\…

Let $(\tau_n)$ be a sequence of toral automorphisms $\tau_n : x \rightarrow A_n x \hbox{mod}\ZZ^d$ with $A_n \in {\cal A}$, where ${\cal A}$ is a finite set of matrices in $SL(d, \mathbb{Z})$. Under some conditions the method of…

We give a general local central limit theorem for the sum of two independent random variables, one of which satisfies a central limit theorem while the other satisfies a local central limit theorem with the same order variance. We apply…

We give a central limit theorem, which has applications to Bayesian statistics and urn problems. The latter are investigated, by paying special attention to multicolor randomly reinforced generalized Polya urns.

For a smooth stationary Gaussian field on $\mathbb{R}^d$ and level $\ell \in \mathbb{R}$, we consider the number of connected components of the excursion set $\{f \ge \ell\}$ (or level set $\{f = \ell\}$) contained in large domains. The…

In theory of one complex variable, Gauss-Lucas Theorem states that the critical points of a non constant polynomial belong to the convex hull of the set of zeros of the polynomial. The exact analogue of this result cannot hold, in general,…

Consider a Gaussian stationary sequence with unit variance $X=\{X_k;k\in {\mathbb{N}}\cup\{0\}\}$. Assume that the central limit theorem holds for a weighted sum of the form $V_n=n^{-1/2}\sum^{n-1}_{k=0}f(X_k)$, where $f$ designates a…

The classical Steinitz theorem asserts that if the origin lies within the interior of the convex hull of a set $S \subset \mathbb{R}^d$, then there are at most $2d$ points in $S$ whose convex hull contains the origin within its interior.…

We introduce the ratio-cut polytope defined as the convex hull of ratio-cut vectors corresponding to all partitions of $n$ points in $\mathbb R^m$ into at most $K$ clusters. This polytope is closely related to the convex hull of the…