Scaling properties of the number of random sequential adsorption iterations needed to generate saturated random packing

Abstract

The properties of the number of iterations in random sequential adsorption protocol needed to generate finite saturated random packing of spherically symmetric shapes were studied. Numerical results obtained for one, two, and three dimensional packings were supported by analytical calculations valid for any dimension $d$. It has been shown that the number of iterations needed to generate finite saturated packing is subject to Pareto distribution with exponent $-1-1/d$ and the median of this distribution scales with packing size according to the power-law characterized by exponent $d$. Obtained resultscan be used in designing effective RSA simulations.

7 pages, 3 figures

References in corpus (3)

• In a search for a shape maximizing packing fraction for two-dimensional random sequential adsorption
• Random Sequential Adsorption on Fractals
• A Mathematical Theory for Random Solid Packings

Cited by in corpus (4)

• Saturated random packing built of arbitrary polygons under random sequential adsorption protocol
• Algorithms to generate saturated random sequential adsorption packings built of rounded polygons
• Random sequential adsorption of aligned regular polygons and rounded squares: Transition in the kinetics of packing growth
• The effect of substrate waviness on random sequential adsorption packing properties