Related papers: A limit theorem for Hausdorff approximation by ran…

We establish estimates for the asymptotic best approximation of the Euclidean unit ball by polytopes under a notion of distance induced by the intrinsic volumes. We also introduce a notion of distance between convex bodies that is induced…

We consider density estimators based on the nearest neighbors method applied to discrete point distibutions in spaces of arbitrary dimensionality. If the density is constant, the volume of a hypersphere centered at a random location is…

Determining the minimum density of a covering of $\mathbb{R}^{n}$ by Euclidean unit balls as $n\to\infty$ is a major open problem, with the best known results being the lower bound of $\left(\mathrm{e}^{-3/2}+o(1)\right)n$ by Coxeter, Few…

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…

We study convex sets C of finite (but non-zero volume in Hn and En. We show that the intersection of any such set with the ideal boundary of Hn has Minkowski (and thus Hausdorff) dimension of at most (n-1)/2, and this bound is sharp. In the…

We consider the following geometric optimization problem: find a convex polygon of maximum area contained in a given simple polygon $P$ with $n$ vertices. We give a randomized near-linear-time $(1-\varepsilon)$-approximation algorithm for…

In this note, we use the mass transference principle for rectangles, recently obtained by Wang and Wu (Math. Ann., 2021), to study the Hausdorff dimension of sets of "weighted $\Psi$-well-approximable" points in certain self-similar sets in…

We prove that there exists an absolute constant $\alpha >1$ with the following property: if $K$ is a convex body in ${\mathbb R}^n$ whose center of mass is at the origin, then a random subset $X\subset K$ of cardinality ${\rm…

A limit theorem for the largest interpoint distance of $p$ independent and identically distributed points in $\mathbb{R}^n$ to the Gumbel distribution is proved, where the number of points $p=p_n$ tends to infinity as the dimension of the…

In this paper we introduce a new sequence of quantities for random polytopes. Let $K_N=\conv\{X_1,...,X_N\}$ be a random polytope generated by independent random vectors uniformly distributed in an isotropic convex body $K$ of $\R^n$. We…

In this paper we consider the problem of constructing numerical algorithms for approximating of convex compact bodies in d-dimensional Euclidean space by polytopes with any given accuracy. It is well known that optimal with respect to the…

Given a stationary and isotropic Poisson hyperplane process and a convex body $K$ in ${\mathbb R}^d$, we consider the random polytope defined by the intersection of all closed halfspaces containing $K$ that are bounded by hyperplanes of the…

We establish a new connection between metric Diophantine approximation and the parametric geometry of numbers by proving a variational principle facilitating the computation of the Hausdorff and packing dimensions of many sets of interest…

Given a weight vector $\tau=(\tau_{1}, \dots, \tau_{n}) \in \mathbb{R}^{n}_{+}$ with each $\tau_{i}$ bounded by certain constraints, we obtain a lower bound for the Hausdorff dimension of the set of $\tau$-approximable points points over a…

The approximability of a convex body is a number which measures the difficulty to approximate that body by polytopes. We prove that twice the approximability is equal to the volume entropy for a Hilbert geometry in dimension two end three…

We show that the expected value of the mean width of a random polytope generated by $N$ random vectors ($n\leq N\leq e^{\sqrt n}$) uniformly distributed in an isotropic convex body in $\R^n$ is of the order $\sqrt{\log N} L_K$. This…

We tackle the problem of high-dimensional nonparametric density estimation by taking the class of log-concave densities on $\mathbb{R}^p$ and incorporating within it symmetry assumptions, which facilitate scalable estimation algorithms and…

We prove a local limit theorem for nearest neighbours random walks in stationary random environment of conductances on Z without using any of both classic assumptions of uniform ellipticity and independence on the conductances. Besides the…

Assume that we observe i.i.d.~points lying close to some unknown $d$-dimensional $\mathcal{C}^k$ submanifold $M$ in a possibly high-dimensional space. We study the problem of reconstructing the probability distribution generating the…

Let $D$ be a regular strictly convex bounded domain of $\mathbb{R}^3$, and consider a regular Jordan curve $\Gamma \subset \partial D$. Then, for each $\epsilon>0$, we obtain the existence of a complete proper minimal immersion…