Related papers: A note on uniform random covering problems in metr…

Let $(\{1,2,\ldots,n\},d)$ be a metric space. We analyze the expected value and the variance of $\sum_{i=1}^{\lfloor n/2\rfloor}\,d({\boldsymbol{\pi}}(2i-1),{\boldsymbol{\pi}}(2i))$ for a uniformly random permutation ${\boldsymbol{\pi}}$ of…

In geometry, there are several challenging problems studying numbers associated to convex bodies. For example, the packing density problem, the kissing number problem, the covering density problem, the packing-covering constant problem,…

We establish a structure theorem for minimizing sequences for the isoperimetric problem on noncompact $\mathsf{RCD}(K,N)$ spaces $(X,\mathsf{d},\mathcal{H}^N)$. Under the sole (necessary) assumption that the measure of unit balls is…

We construct random metric spaces by gluing together an infinite sequence of pointed metric spaces that we call blocks. At each step, we glue the next block to the structure constructed so far by randomly choosing a point on the structure…

For any $\beta > 1$, let $T_\beta: [0,1)\rightarrow [0,1)$ be the $\beta$-transformation defined by $T_\beta x=\beta x \mod 1$. We study the uniform recurrence properties of the orbit of a point under the $\beta$-transformation to the point…

Let $\{B(\xi_n,r_n)\}_{n\ge1}$ be a sequence of random balls whose centers $\{\xi_n\}_{n\ge1}$ is a stationary process, and $\{r_n\}_{n\ge1}$ is a sequence of positive numbers decreasing to 0. Our object is the random covering set…

The study of finite approximations of probability measures has a long history. In (Xu and Berger, 2017), the authors focus on constrained finite approximations and, in particular, uniform ones in dimension $d=1$. The present paper gives an…

Investigating a model of scale-invariant random spatial network suggested by Aldous, Kendall constructed a random metric $T$ on $\mathbb{R}^d$, for which the distance between points is given by the optimal connection time, when travelling…

It is a longstanding conjecture that given a subset $E$ of a metric space, if $E$ has finite Hausdorff measure in dimension $\alpha\ge 0$ and $\mathscr{H}^\alpha\llcorner E$ has unit density almost everywhere, then $E$ is an…

Verifying uniform conditions over continuous spaces through random sampling is fundamental in machine learning and control theory, yet classical coverage analyses often yield conservative bounds, particularly at small failure probabilities.…

We give conditions on a general family $P_{\lambda}:\R^n\to\R^m, \lambda \in \Lambda,$ of orthogonal projections which guarantee that the Hausdorff dimension formula $\dim A\cap P_{\lambda}^{-1}\{u\}=s-m$ holds generically for measurable…

Let $u$ be a solution to an elliptic equation $\text{div}(A\nabla u)=0$ with Lipschitz coefficients in $\mathbb{R}^n$. Assume $|u|$ is bounded by $1$ in the ball $B=\{|x|\leq 1\}$. We show that if $|u| < \varepsilon$ on a set $ E \subset…

Suppose X is a random vector, that is distributed uniformly in some n-dimensional convex set. It was conjectured that when the dimension n is very large, there exists a non-zero vector u, such that the distribution of the real random…

Using the definition of uniformly perfect sets in terms of convergent sequences, we apply lower bounds for the Hausdorff content of a uniformly perfect subset $E$ of $\mathbb{R}^n$ to prove new explicit lower bounds for the Hausdorff…

Uniform laws of large numbers form a cornerstone of Vapnik--Chervonenkis theory, where they are characterized by the finiteness of the VC dimension. In this work, we study uniform convergence phenomena in cartesian product spaces, under…

In this paper, we study the Dvoretzky covering problem with non-uniformly distributed centers. When the probability law of the centers admits an absolutely continuous density which satisfies a regular condition on the set of essential…

We propose a new probabilistic characterization of the uniform distribution on the hypersphere in terms of the distribution of pairwise inner products, extending the ideas of \citep{cuesta2009projection,cuesta2007sharp} in a data-driven…

We consider the 2-dimensional random matching problem in $\mathbb{R}^2.$ In a challenging paper, Caracciolo et. al. arXiv:1402.6993 on the basis of a subtle linearization of the Monge Ampere equation, conjectured that the expected value of…

Given a $k$-self similar set $X\subset [0,1]^{d}$ we calculate both its Hausdorff dimension and its entropy, and show that these two quantities are in fact equal. This affirmatively resolves a conjecture of Adamczewski and Bell.

This paper has been withdrawn Any real number $x$ in the unit interval can be expressed as a continued fraction $x=[n_1,...,n_{_N},...]$. Subsets of zero measure are obtained by imposing simple conditions on the $n_{_N}$. By imposing…