English
Related papers

Related papers: Uniform random covering problems

200 papers

In this paper, we study the uniform random covering problem in general metric space $(X,d)$. Let $\omega=(\omega_n)_{n\in\mathbb N}$ be a sequence of independent identically distributed random variables on $(X,\mu)$, and…

Probability · Mathematics 2026-03-03 Zhang-nan Hu , Bing Li , YiJing Wang

The classical Dvoretzky covering problem asks for conditions on the sequence of lengths $\{\ell_n\}_{n\in \mathbb{N}}$ so that the random intervals $I_n : = (\omega_n -(\ell_n/2), \omega_n +(\ell_n/2))$ where $\omega_n$ is a sequence of…

Probability · Mathematics 2021-12-07 Michihiro Hirayama , Davit Karagulyan

Let $\{x\_n\}\_{n\geq 0}$ be a sequence of $[0,1]^d$, $\{\lambda\_n\} \_{n\geq 0}$ a sequence of positive real numbers converging to 0, and $\delta>1$. Let $\mu$ be a positive Borel measure on $[0,1]^d$, $\rho\in (0,1]$ and $\alpha>0$.…

General Mathematics · Mathematics 2007-05-23 Julien Barral , Stephane Seuret

Universal cover in $\mathbb{E}^{n}$ is a measurable set that contains a congruent copy of any set of diameter 1. Lebesgue's universal covering problem, posed in 1914, asks for the convex set of smallest area that serves as a universal cover…

Metric Geometry · Mathematics 2025-12-04 Andrii Arman , Andriy Bondarenko , Andriy Prymak , Danylo Radchenko

Let ${\pmb M}$, ${\pmb N}$ and ${\pmb K}$ be $d$-dimensional Riemann manifolds. Assume that ${\bf A}:=(A_n)_{n\in{\Bbb N}}$ is a sequence of Lebesgue measurable subsets of ${\pmb M}$ satisfying a necessary density condition and ${\bf…

Classical Analysis and ODEs · Mathematics 2015-09-01 De-Jun Feng , Esa Järvenpää , Maarit Järvenpää , Ville Suomala

We study the Dvoretzky covering problem for random covering sets driven by general Borel probability measures. As our main result, we solve the problem of covering analytic sets by random covering sets generated by arbitrary Borel…

Probability · Mathematics 2026-01-19 Roope Anttila , Markus Myllyoja

We study problems on covering $[0,1)$ by shrinking intervals centered at the points $\{q_n x\}$, where $(q_n)_{n\in \mathbb{N}}$ is a given real-valued sequence and $x \in [0,1)$ is random. For real-valued lacunary sequences…

Number Theory · Mathematics 2026-04-03 Manuel Hauke , Andrei Shubin , Eduard Stefanescu , Agamemnon Zafeiropoulos

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

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…

Probability · Mathematics 2021-11-02 Aihua Fan , Davit Karagulyan

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

We study the distribution of sequences of the form $(q_ny)_{n=1}^\infty$, where $(q_n)_{n=1}^\infty$ is some increasing sequence of integers. In particular, we study the Lebesgue measure and find bounds on the Hausdorff dimension of the set…

Number Theory · Mathematics 2024-11-20 S. Kristensen , T. Persson

Fix an irrational number $\theta$. For a real number $\tau >0$, consider the numbers $y$ satisfying that for all large number $Q$, there exists an integer $1\leq n\leq Q$, such that $\|n\theta-y\|<Q^{-\tau}$, where $\|\cdot\|$ is the…

Number Theory · Mathematics 2017-08-22 Dong Han Kim , Lingmin Liao

We calculate the almost sure Hausdorff dimension of uniformly random self-similar fractals. These random fractals are generated from a finite family of similarities, where the linear parts of the mappings are independent uniformly…

Dynamical Systems · Mathematics 2015-05-11 Henna Koivusalo

Lebesgue's universal covering problem is re-examined using computational methods. This leads to conjectures about the nature of the solution which if correct could provide a blueprint for a complete solution. Empirical lower bounds for the…

Metric Geometry · Mathematics 2014-02-20 Philip Gibbs

We show that if $\mathfrak{c} = \aleph_2$ then all covering numbers of Hausdorff measures $\operatorname{cov}(\mathcal{N}^s(\mathbb{R}^d))$ ($0 < s < d, d \in \omega$) are equal and all uniformity numbers…

Classical Analysis and ODEs · Mathematics 2025-07-18 Tatsuya Goto

We study the distributions of the random Dirichlet series with parameters $(s, \beta)$ defined by $$ S=\sum_{n=1}^{\infty}\frac{I_n}{n^s}, $$ where $(I_n)$ is a sequence of independent Bernoulli random variables, $I_n$ taking value $1$ with…

Probability · Mathematics 2016-01-01 Ron Peled , Yuval Peres , Jim Pitman , Ryokichi Tanaka

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

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

Many real phenomena may be modelled as random closed sets in $\mathbb{R}^d$, of different Hausdorff dimensions. In many real applications, such as fiber processes and $n$-facets of random tessellations of dimension $n\leq d$ in spaces of…

Statistics Theory · Mathematics 2010-01-14 Luigi Ambrosio , Vincenzo Capasso , Elena Villa

We study coverage processes in which each draw reveals a subset of $[n]$, and the goal is to determine the expected number of draws until all items are seen at least once. A classical example is the Coupon Collector's Problem, where each…

Information Theory · Computer Science 2025-10-30 Yitzchak Grunbaum , Eitan Yaakobi
‹ Prev 1 2 3 10 Next ›