Related papers: Random Sequential Covering
Random sequential adsorption (RSA) of polymer, modeled as a chain of identical spheres, is systematically studied. In order to control precisely anisotropy and number of degrees of freedom, two different kinds of polymers are used. In the…
Random sequential adsorption (RSA) models have been studied due to their relevance to deposition processes on surfaces. The depositing particles are represented by hard-core extended objects; they are not allowed to overlap. Numerical Monte…
We introduce a concept for random tilings which, comprising the conventional one, is also applicable to tiling ensembles without height representation. In particular, we focus on the random tiling entropy as a function of the tile…
This article proves that, in terms of local times, the rescaled and recentered cover times of finite subsets of the discrete cylinder by simple random walk converge in law to the Gumbel distribution, as the cardinality of the set goes to…
We consider diffusion-limited annihilating systems with mobile $A$-particles and stationary $B$-particles placed throughout a graph. Mutual annihilation occurs whenever an $A$-particle meets a $B$-particle. Such systems, when ran in…
Packing is a complex phenomenon of prominence in many natural and industrial processes (liquid crystals, granular materials, infiltration, melting, flow, sintering, segregation, sedimentation, compaction, etc.). A variety of computational…
The main goal of this note is to prove the following theorem. If $A_n$ is a sequence of measurable sets in a $\sigma$-finite measure space $(X, \mathcal{A}, \mu)$ that covers $\mu$-a.e. $x \in X$ infinitely many times, then there exists a…
We consider the {following} coverage model on $\mathbb{N}$. For each site $i\in \mathbb{N}$ we associate a pair $(\xi_i, R_i)$ where $\{\xi_0, \xi_1, \ldots \}$ is a 1-dimensional {undelayed} discrete renewal point process and…
We study the discrete bin covering problem where a multiset of items from a fixed set $S \subseteq (0,1]$ must be split into disjoint subsets while maximizing the number of subsets whose contents sum to at least $1$. We study the online…
A causal set is a partially ordered set on a countably infinite ground-set such that each element is above finitely many others. A natural extension of a causal set is an enumeration of its elements which respects the order. We bring…
We consider the problem of sequential sampling from a finite number of independent statistical populations to maximize the expected infinite horizon average outcome per period, under a constraint that the expected average sampling cost does…
This paper studies the counting problem in random dynamical systems. We noticed that the nature of counting in the random setting is completely different than that of the deterministic systems in the sense that non-exponential growth is…
Sequential sampling occurs when the entire population is not known in advance and data are obtained one at a time or in groups of units. This manuscript proposes a new algorithm to sequentially select a balanced sample. The algorithm…
We use the martingale-theoretic approach of game-theoretic probability to incorporate imprecision into the study of randomness. In particular, we define several notions of randomness associated with interval, rather than precise,…
The main goal of this article is to understand how the length spectrum of a random surface depends on its genus. Here a random surface means a surface obtained by randomly gluing together an even number of triangles carrying a fixed metric.…
The random sequential adsorption of various particle shapes is studied in order to determine the influence of particle anisotropy on the saturated random packing. For all tested particles there is an optimal level of anisotropy which…
We obtain the distribution of the maximal average in a sequence of independent identically distributed exponential random variables. Surprisingly enough, it turns out that the inverse distribution admits a simple closed form. An application…
We investigate the occurrence of additive and multiplicative structures in random subsets of the natural numbers. Specifically, for a Bernoulli random subset of $\mathbb{N}$ where each integer is included independently with probability…
We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along…
We develop a diffusion approximation for systems subject to fast random resetting by small amplitudes. Equivalently, this describes systems with frequent but small catastrophes. We demonstrate the validity of the approximation by computing…