English
Related papers

Related papers: Geometry of a Set and its Random covers

200 papers

Let $X_1,X_2, \ldots $ be independent random uniform points in a bounded domain $A \subset \mathbb{R}^d$ with smooth boundary. Define the coverage threshold $R_n$ to be the smallest $r$ such that $A$ is covered by the balls of radius $r$…

Probability · Mathematics 2022-01-12 Mathew D. Penrose

Let $A$ be a compact $d$-dimensional $C^2$ Riemannian manifold with boundary, embedded in ${\bf R}^m$ where $m \geq d \geq 2$, and let $B$ be a nice subset of $A$ (possibly $B=A$). Let $X_1,X_2, \ldots $ be independent random uniform points…

Probability · Mathematics 2025-09-24 Mathew D. Penrose , Xiaochuan Yang

This article presents an algebraic topology perspective on the problem of finding a complete coverage probability of a one dimensional domain $X$ by a random covering, and develops techniques applicable to the problem beyond the one…

Algebraic Topology · Mathematics 2015-09-11 Rafal Komendarczyk , Jeffrey Pullen

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…

Probability · Mathematics 2020-09-10 Zhang-nan Hu , Bing Li

We study the problem of learning a high-density region of an arbitrary distribution over $\mathbb{R}^d$. Given a target coverage parameter $\delta$, and sample access to an arbitrary distribution $D$, we want to output a confidence set $S…

Data Structures and Algorithms · Computer Science 2025-05-14 Chao Gao , Liren Shan , Vaidehi Srinivas , Aravindan Vijayaraghavan

The hypothesis that high dimensional data tend to lie in the vicinity of a low dimensional manifold is the basis of manifold learning. The goal of this paper is to develop an algorithm (with accompanying complexity guarantees) for fitting a…

Statistics Theory · Mathematics 2013-12-23 Charles Fefferman , Sanjoy Mitter , Hariharan Narayanan

We consider the Ekst\''om-Persson conjecture concerning the value of the Hausdorff dimension of random covering sets formed by balls with radii $(k^{-\alpha})_{k=1}^\infty$ and centres chosen independently at random according to an…

Probability · Mathematics 2025-06-13 Esa Järvenpää , Markus Myllyoja , Stéphane Seuret

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…

Combinatorics · Mathematics 2025-10-30 Boris Bukh , Jun Gao , Xizhi Liu , Oleg Pikhurko , Shumin Sun

Let $E=\limsup\limits_{n\to\infty}(g_n+\xi_n)$ be the random covering set on the torus $\mathbb{T}^d$, where $\{g_n\}$ is a sequence of ball-like sets and $\xi_n$ is a sequence of independent random variables uniformly distributed on…

Classical Analysis and ODEs · Mathematics 2013-07-18 Bing Li , Ville Suomala

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.…

Machine Learning · Computer Science 2025-12-15 Lyu Yuhuan

The celebrated Dvoretzky theorem asserts that every $N$-dimensional convex body admits central sections of dimension $d = \Omega(\log N)$, which is nearly spherical. For many instances of convex bodies, typically unit balls with respect to…

Metric Geometry · Mathematics 2026-03-02 Stanislaw Szarek , Pawel Wolff

Given $N$ geodesic caps on the unit sphere in $\mathbb{R}^d$, and whose total normalized surface area sums to one, what is the maximal surface area their union can cover? In this work, we provide an asymptotically sharp upper bound for an…

Metric Geometry · Mathematics 2025-12-25 Steven Hoehner , Gil Kur

We estimate from below the expected Betti numbers of real hypersurfaces taken at random in a smooth real projective n-dimensional manifold. These random hypersurfaces are chosen in the linear system of a large d-th power of a real ample…

Symplectic Geometry · Mathematics 2017-05-17 Damien Gayet , Jean-Yves Welschinger

In this paper we present a new bound obtained with the probabilistic method for the solution of the Set Covering problem with unit costs. The bound is valid for problems of fixed dimension, thus extending previous similar asymptotic…

Combinatorics · Mathematics 2014-07-18 Giovanni Felici , Sokol Ndreca , Aldo Procacci , Benedetto Scoppola

Let X be a real or complex Hilbert space of finite but large dimension d, let S(X) denote the unit sphere of X, and let u denote the normalized uniform measure on S(X). For a finite subset B of S(X), we may test whether it is approximately…

Probability · Mathematics 2019-08-01 Sheldon Goldstein , Joel L. Lebowitz , Roderich Tumulka , Nino Zanghi

Given a collection S of subsets of some set U, and M a subset of U, the set cover problem is to find the smallest subcollection C of S such that M is a subset of the union of the sets in C. While the general problem is NP-hard to solve,…

Computational Geometry · Computer Science 2007-05-23 Kenneth L. Clarkson , Kasturi Varadarajan

Consider a uniformly distributed random linear subspace $L$ and a stochastically independent random affine subspace $E$ in $\mathbb{R}^n$, both of fixed dimension. For a natural class of distributions for $E$ we show that the intersection…

Metric Geometry · Mathematics 2024-04-23 Emil Dare , Markus Kiderlen , Christoph Thaele

We prove that in any finite set of $\mathbb Z^d$ with $d\ge 3$, there is a subset whose capacity and volume are both of the same order as the capacity of the initial set. As an application we obtain estimates on the probability of {\it…

Probability · Mathematics 2020-11-23 Amine Asselah , Bruno Schapira

We study the small ball probability of an order-$\ell$ simple random tensor $X=X^{(1)}\otimes\cdots\otimes X^{(\ell)}$ where $X^{(i)}, 1\leq i\leq\ell$ are independent random vectors in $\mathbb{R}^n$ that are log-concave or have…

Probability · Mathematics 2024-04-01 Xuehan Hu , Grigoris Paouris

Given a weighted graph $G=(V,E,w)$, a partition of $V$ is $\Delta$-bounded if the diameter of each cluster is bounded by $\Delta$. A distribution over $\Delta$-bounded partitions is a $\beta$-padded decomposition if every ball of radius…

Data Structures and Algorithms · Computer Science 2024-01-09 Arnold Filtser
‹ Prev 1 2 3 10 Next ›