Related papers: Random polytopes: central limit theorems for intri…

We consider the convex hull of a finite sample of i.i.d. points uniformly distributed in a convex body in $\R^d$, $d\geq 2$. We prove an exponential deviation inequality, which leads to rate optimal upper bounds on all the moments of the…

For a d-dimensional convex lattice polytope P, a formula for the boundary volume is derived in terms of the number of boundary lattice points on the first $\floor{d/2}$ dilations of P. As an application we give a necessary and sufficient…

We investigate some combinatorial properties of convex polytopes simple in edges. For polytopes whose nonsimple vertices are located sufficiently far one from another, we prove an analog of the Hard Lefschetz theorem. It implies Stanley's…

We prove area bounds for planar convex bodies in terms of their number of interior integral points and their lattice width data. As an application, we obtain sharp area bounds for rational polygons with a fixed number of interior integral…

A Central Limit Theorem is proved for linear random fields when sums are taken over finite disjoint union of rectangles. The approach does not rely upon the use of Beveridge Nelson decomposition and the conditions needed are similar to…

We study the Central Limit Theorem (CLT) in the so-called mixed (anisotropic) Lebesgue-Riesz spaces and tail behavior of normed sums of centered random independent variables (vectors) with values in these spaces.

We study sufficient conditions for the belonging of random process to certain Besov space and for the Central Limit Theorem (CLT) in these spaces. We investigate also the non-asymptotic tail behavior of normed sums of centered random…

In this paper we propose a method to construct probability measures on the space of convex bodies with a given pushforward distribution. Concretely we show that there is a measure on the metric space of centrally symmetric convex bodies,…

For a given convex body K in $R^d$, a random polytope $K^{(n)}$ is defined (essentially) as the intersection of $n$ independent closed halfspaces containing $K$ and having an isotropic and (in a specified sense) uniform distribution. We…

In this note, we study possible extensions of the Central Limit Theorem for non-convex bodies. First, we prove a Berry-Esseen type theorem for a certain class of unconditional bodies that are not necessarily convex. Then, we consider a…

We prove the Central Limit Theorem for finite-dimensional vectors of linear eigenvalue statistics of submatrices of Wigner random matrices under the assumption that test functions are sufficiently smooth. We connect the asymptotic…

We consider a class of random billiards in a tube, where reflection angles at collisions with the boundary of the tube are random variables rather than deterministic (and elastic) quantities. We obtain a (non-standard) Central Limit Theorem…

Suppose we choose $N$ points uniformly randomly from a convex body in $d$ dimensions. How large must $N$ be, asymptotically with respect to $d$, so that the convex hull of the points is nearly as large as the convex body itself? It was…

For two families of random polytopes we compute explicitly the expected sums of the conic intrinsic volumes and the Grassmann angles at all faces of any given dimension of the polytope under consideration. As special cases, we compute the…

We investigate weighted floating bodies of polytopes. We show that the weighted volume depends on the complete flags of the polytope. This connection is obtained by introducing flag simplices, which translate between the metric and…

Let $T$ be the triangle in the plane with vertices $(0, 0)$, $(0,1)$ and $(0, 1)$. The convex hull $T_n$ of points $(0, 1)$, $(1, 0)$ and $n$ independent random points uniformly distributed in $T$ is the random convex chain. In this paper…

We review a novel approach to evaluate the ground-state properties of many-body lattice systems based on an exact probabilistic representation of the dynamics and its long time approximation via a central limit theorem. The choice of the…

We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…

We develop a technique using dual mixed-volumes to study the isotropic constants of some classes of spaces. In particular, we recover, strengthen and generalize results of Ball and Junge concerning the isotropic constants of subspaces and…

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…