Random sequential addition of hard atoms to the one-dimensional integer lattice

Abstract
This paper considers the random sequential addition of atoms of different sizes and distinguishable types to the one-dimensional integer lattice (linear chain sites). In such a situation the different processes are competing for space on the lattice, and after a sufficiently long time has elapsed the chain will consist of a linear array of different atoms, in which configuration it will remain forever, since none of the processes is reversible. We present results which enable the proportion of sites occupied by each type of atom to be calculated: (a) numerically from a set of difference equations as a function of the chain length and (b) analytically, for a simplified model and infinite chain length.

This publication has 8 references indexed in Scilit: