Random sequential adsorption on Euclidean, fractal and random lattices

Abstract

Irreversible adsorption of objects of different shapes and sizes on Euclidean, fractal and random lattices is studied. The adsorption process is modeled by using random sequential adsorption (RSA) algorithm. Objects are adsorbed on one-, two-, and three-dimensional Euclidean lattices, on Sierpinski carpets having dimension $d$ between 1 and 2, and on Erdos-Renyi random graphs. The number of sites is $M=L^d$ for Euclidean and fractal lattices, where $L$ is a characteristic length of the system. In the case of random graphs it does not exist such characteristic length, and the substrate can be characterized by a fixed set of $M$ vertices (sites) and an average connectivity (or degree) $g$. The paper concentrates on measuring (1) the probability $W_{L(M)}(\theta )$ that a lattice composed of $L^d(M)$ elements reaches a coverage $\theta$, and (2) the exponent ${\nu }_j$ characterizing the so-called "jamming transition". The results obtained for Euclidean, fractal and random lattices indicate that the main quantities derived from the jamming probability $W_{L(M)}(\theta )$ behave asymptotically as $M^{1/2}$. In the case of Euclidean and fractal lattices, where $L$ and $d$ can be defined, the asymptotic behavior can be written as $M^{1/2}=L^{d/2}=L^{1/{\nu }_j}$, and ${\nu }_j=2/d$.

References in corpus (20)

• A fast Monte Carlo algorithm for site or bond percolation
• Random Sequential Adsorption: From Continuum to Lattice and Pre-Patterned Substrates
• Percolation and jamming in random sequential adsorption of linear segments on square lattice
• A New Universality for Random Sequential Deposition of Needles
• Adsorption of Line Segments on a Square Lattice
• Percolation of linear $k$-mers on square lattice: from isotropic through partially ordered to completely aligned state
• Dynamics of Nonequilibrium Deposition
• Random sequential adsorption of partially oriented linear $k$-mers on square lattice
• Continuum random sequential adsorption of polymer on a flat and homogeneous surface
• In a search for a shape maximizing packing fraction for two-dimensional random sequential adsorption
• Random packing of regular polygons and star polygons on a flat two-dimensional surface
• Percolation and jamming of random sequential adsorption samples of large linear $k$-mers on a square lattice
• Shapes for maximal coverage for two-dimensional random sequential adsorption
• Jamming and percolation in random sequential adsorption of straight rigid rods on a two-dimensional triangular lattice
• Random Sequential Adsorption on Fractals
• Jammed systems of oriented needles always percolate on square lattices
• Properties of random sequential adsorption of generalized dimers
• Jamming and percolation of $k^3$-mers on simple cubic lattices
• Jamming and percolation of $k^2$-mers on simple cubic lattices
• Jamming and percolation of parallel squares in single-cluster growth model

Cited by in corpus (3)

• Two-dimensional systems of elongated particles: From diluted to dense
• Breaking universality in random sequential adsorption on a square lattice with long-range correlated defects
• Jamming and percolation in the random sequential adsorption of a binary mixture on the square lattice