Related papers: Random Sequential Covering
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…
We study analytically and numerically a model of random sequential adsorption (RSA) of segments on a line, subject to some constraints suggested by two kinds of physical situations: - deposition of dimers on a lattice where the sites have a…
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…
We present the algorithm for generating strictly saturated random sequential adsorption packings built of rounded polygons. It can be used to study various properties of such packings built of a wide variety of different shapes and in…
In this paper, we study a distribution of labeled particles on a continuous ring. It arises in three different ways, all related to the multi-type TASEP on a ring. We prove formulas for the probability density function for some permutations…
The influence of different boundary conditions on the density of random packings of disks is studied. Packings are generated using the random sequential adsorption algorithm with three different types of boundary conditions: periodic, open,…
Granular convergence is a property of a granular pack as it is repeatedly sheared in a cyclic, quasistatic fashion, as the packing configuration changes via discrete events. Under suitable conditions the set of microscopic configurations…
We compute the time-dependent coverage in the random sequential adsorption of aligned d-dimensional cubes in $R^d$ using time-series expansions. The seventh-order series in 2, 3 and 4 dimensions is resummed in order to predict the coverage…
Random metastability occurs when an externally forced or noisy system possesses more than one state of apparent equilibrium. This work investigates a class of random dynamical systems, arising from perturbing a one-dimensional piecewise…
The effect of diffusional relaxation on the random sequential deposition process is studied in the limit of fast deposition. Expression for the coverage as a function of time are analytically derived for both the short-time and long-time…
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…
Consider the random sequential packing model with infinite input and in any dimension. When the input consists of non-zero volume convex solids we show that the total number of solids accepted over cubes of volume $\lambda$ is…
We describe a very simple method for `consistent sampling' that allows for sampling with replacement. The method extends previous approaches to consistent sampling, which assign a pseudorandom real number to each element, and sample those…
We study the systole of a random surface, where by a random surface we mean a surface constructed by randomly gluing together an even number of triangles. We study two types of metrics on these surfaces, the first one coming from using…
We have performed extensive simulations of random sequential adsorption and diffusion of $k$-mers, up to $k=5$ in two dimensions with particular attention to the case $k=2$. We focus on the behavior of the coverage and of vacancy dynamics…
In this work we extend recent study of the properties of the dense packing of "superdisks," by Y. Jiao, F. H. Stillinger and S. Torquato, Phys. Rev. Lett. 100, 245504 (2008), to the jammed state formed by these objects in random sequential…
A $d$-dimensional random array on a nonempty set $I$ is a stochastic process $\boldsymbol{X}=\langle X_s:s\in \binom{I}{d}\rangle$ indexed by the set $\binom{I}{d}$ of all $d$-element subsets of $I$. We obtain structural decompositions of…
We study approach to the large-time jammed state of the deposited particles in the model of random sequential adsorption. The convergence laws are usually derived from the argument of Pomeau which includes the assumption of the dominance,…
Current discrete randomness and information conservation inequalities are over total recursive functions, i.e. restricted to deterministic processing. This restriction implies that an algorithm can break algorithmic randomness conservation…
Random packings and their properties are a popular and active field of research. Numerical algorithms that can efficiently generate them are useful tools in their study. This paper focuses on random packings produced according to the random…