Related papers: Covering a compact space by fixed-radius or growin…
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$…
Motivated by the dynamic modeling of relative abundance data in ecology, we introduce a general approach to model stationary Markovian or non Markovian time series on (relatively) compact spaces such as a hypercube, the simplex or a sphere…
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…
We study a random partial covering model on the $(d-1)$-dimensional unit sphere, where $N$ spherical caps are placed independently and uniformly at random, each covering a surface fraction of $1/N$. This model provides a continuous…
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…
We present a general approach to study a class of random growth models in $n$-dimensional Euclidean space. These models are designed to capture basic growth features which are expected to manifest at the mesoscopic level for several…
In this paper, we develop a general theory on the coverage probability of random intervals defined in terms of discrete random variables with continuous parameter spaces. The theory shows that the minimum coverage probabilities of random…
Among observables characterising the random exploration of a graph or lattice, the cover time, namely the time to visit every site, continues to attract widespread interest. Much insight about cover times is gained by mapping to the…
We consider growing spheres seeded by random injection in time and space. Growth stops when two spheres meet leading eventually to a jammed state. We study the statistics of growth limited by packing theoretically in d dimensions and via…
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.…
Cover time, in the context of dynamical systems, quantifies the rate at which orbits cover the system. We prove that for countable full shifts with a Gibbs measure, equipped with a natural metric, the rate of covering of orbits of points…
The cover time is defined as the time needed for a random walker to visit every site of a confined domain. Here, we focus on persistent random walks, which provide a minimal model of random walks with short range memory. We derive the exact…
We study the isoperimetric problem for Euclidean space endowed with a continuous density. In dimension one, we characterize isoperimetric regions for a unimodal density. In higher dimensions, we prove existence results and we derive…
Theoretical background is provided towards the mathematical foundation of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the…
In this article, we consider the following capacitated covering problem. We are given a set $P$ of $n$ points and a set $\mathcal{B}$ of balls from some metric space, and a positive integer $U$ that represents the capacity of each of the…
Methodology is provided towards the solution of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the d-dimensional Euclidean…
We develop a general framework for the probabilistic analysis of random finite point clouds in the context of topological data analysis. We extend the notion of a barcode of a finite point cloud to compact metric spaces. Such a barcode…
In the continuity of a recent paper ([6]), dealing with finite Markov chains, this paper proposes and analyzes a recursive algorithm for the approximation of the quasi-stationary distribution of a general Markov chain living on a compact…
We investigate the problem of growing clusters, which is modeled by two dimensional disks and three dimensional droplets. In this model we place a number of seeds on random locations on a lattice with an initial occupation probability, $p$.…
In this paper, we investigate geometrical properties of the rank metric space and covering properties of rank metric codes. We first establish an analytical expression for the intersection of two balls with rank radii, and then derive an…