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.