Related papers: Random coverage from within with variable radii, a…
In this paper we deal with the classical problem of random cover times. We investigate the distribution of the time it takes for a Poisson process of cylinders to cover a set $A \subset \mathbb{R}^d.$ This Poisson process of cylinders is…
Consider a spherical Poisson Boolean model $Z$ in Euclidean $d$-space with $d \geq 2$, with Poisson intensity $t$ and radii distributed like $rY$ with $r \geq 0$ a scaling parameter and $Y$ a fixed nonnegative random variable with finite…
We consider Gaussian approximation in a variant of the classical Johnson--Mehl birth-growth model with random growth speed. Seeds appear randomly in $\mathbb{R}^d$ at random times and start growing instantaneously in all directions with a…
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…
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$…
Plant differently colored points in the plane, then let random points ("Poisson rain") fall, and give each new point the color of the nearest existing point. Previous investigation and simulations strongly suggest that the colored regions…
The high-pressure compaction of three dimensional granular packings is simulated using a bonded particle model (BPM) to capture linear elastic deformation. In the model, grains are represented by a collection of point particles connected by…
A random planar quadrangulation process is introduced as an approximation for certain cellular automata in terms of random growth of rays from a given set of points. This model turns out to be a particular (rectangular) case of the…
Simple random coverage models, well studied in Euclidean space, can also be defined on a general compact metric space. By analogy with the geometric models, and with the discrete coupon collector's problem and with cover times for finite…
The goal of random sequential adsorption (RSA), a time-dependent packing method, is to create a regular or asymmetric covering of an empty space that can fit in the allocated space without overlapping. The density of coverage tends to reach…
The genealogical structure of self-similar growth-fragmentations can be described in terms of a branching random walk. The so-called intrinsic area $\mathrm{A}$ arises in this setting as the terminal value of a remarkable additive…
In this paper, we derive an integral representation for the density of the reciprocal of the first hitting time of the boundary of a wedge of angle $\pi/4$ by a radial Dunkl process with equal multiplicity values. Not only this…
We observe stationary random tessellations $X=\{\Xi_n\}_{n\ge1}$ in $\mathbb{R}^d$ through a convex sampling window $W$ that expands unboundedly and we determine the total $(k-1)$-volume of those $(k-1)$-dimensional manifold processes which…
Let $Z$ be the typical cell of a stationary Poisson hyperplane tessellation in $\mathbb{R}^d$. The distribution of the number of facets $f(Z)$ of the typical cell is investigated. It is shown, that under a well-spread condition on the…
We formulate a statistical-mechanical description of a recently introduced random planting model in which plants are represented by growing hard disks. Seedlings of negligible size are introduced at random positions in a field, grow at a…
We study kinetic and jamming properties of a space covering process in one dimension. The stochastic process is defined as follows: Seeds are nucleated randomly in space and produce rays which grow with a constant velocity. The growth stops…
Many real phenomena may be modelled as locally finite unions of $d$-dimensional time dependent random closed sets in $\mathbb{R}^d$, described by birth-and-growth stochastic processes, so that their mean volume and surface densities, as…
We filled a void with a regular or asymmetric pattern without overlap using a time-dependent packing method termed random sequential adsorption (RSA). In the infinite-time limit, the density of coverage frequently hits a limit. This study…
Random sequential adsorption of linear and square particles with excluded volume interaction is studied numerically on planar lattices considering Gaussian distributions of lateral sizes of the incident particles, with several values of the…
The convex hull peeling of a point set is obtained by taking the convex hull of the set and repeating iteratively the operation on the interior points until no point remains. The boundary of each hull is called a layer. We study the number…