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

From MaRDI portal
Publication:2396567

DOI10.1007/S10955-016-1673-YzbMATH Open1367.52016arXiv1607.06668OpenAlexW2505741633WikidataQ59609844 ScholiaQ59609844MaRDI QIDQ2396567FDOQ2396567

Michaล‚ Cieล›la

Publication date: 8 June 2017

Published in: Journal of Statistical Physics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1607.06668





Cites Work


Cited In (6)


   Recommendations





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)