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

From MaRDI portal
Publication:2396567




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 11/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.









This page was built for publication: Scaling properties of the number of random sequential adsorption iterations needed to generate saturated random packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2396567)