Boundary conditions in random sequential adsorption

Cieśla, Michał; Ziff, Robert M.

doi:10.1088/1742-5468/aab685

Cited by 39 publications

(33 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It has been shown for RSA of disks that the measured value of saturated packing fraction for small packings os-cillates with respect to the system size, similar to the oscillations found in the tail of the autocorrelation function [25]. Therefore, it was expected (as a packing side length used in the study is much larger than 5) that the finite-size effects should not affect obtained values of packing fraction.…”

Section: Finite-size Effectssupporting

confidence: 57%

Saturated random packing built of arbitrary polygons under random sequential adsorption protocol

2019

Self Cite

View full text Add to dashboard Cite

Random packings and their properties are a popular and active field of research. Numerical algorithms that can efficiently generate them are useful tools in their study. This paper focuses on random packings produced according to the random sequential adsorption (RSA) protocol. Developing the idea presented in [G. Zhang, Phys. Rev. E 97, 043311 (2018)], where saturated random packings built of regular polygons were studied, we create an algorithm that generates strictly saturated packings built of any polygons. Then, the algorithm was used to determine the packing fractions for arbitrary triangles. The highest mean packing density, 0.552814 ± 0.000063, was observed for triangles of side lengths 0.63 : 1 : 1. Additionally, microstructural properties of such packings, kinetics of their growth as well as distributions of saturated packing fractions and the number of RSA iterations needed to reach saturation were analyzed.

show abstract

Section: Finite-size Effectssupporting

confidence: 57%

Saturated random packing built of arbitrary polygons under random sequential adsorption protocol

2019

Self Cite

View full text Add to dashboard Cite

show abstract

“…Could this indicate a mistake, for example, that leads to the generation of unsaturated configurations? One way to double check is to calculate RSA saturation densities of regular ngons with large n, since as n increases, φ s should approach that for disks, 0.547067 · · · [30]. We thus calculated φ s for 19gons and 29gons, and found 0.546210 ± 0.000080 and 0.546701 ± 0.000067, respectively.…”

Section: Resultsmentioning

confidence: 95%

Precise algorithm to generate random sequential adsorption of hard polygons at saturation

Zhang

2018

Phys. Rev. E

View full text Add to dashboard Cite

Random sequential adsorption (RSA) is a time-dependent packing process, in which particles of certain shapes are randomly and sequentially placed into an empty space without overlap. In the infinite-time limit, the density approaches a "saturation" limit. Although this limit has attracted particular research interest, the majority of past studies could only probe this limit by extrapolation. We have previously found an algorithm to reach this limit using finite computational time for spherical particles and could thus determine the saturation density of spheres with high accuracy. In this paper, we generalize this algorithm to generate saturated RSA packings of two-dimensional polygons. We also calculate the saturation density for regular polygons of three to ten sides and obtain results that are consistent with previous, extrapolation-based studies.

show abstract

“…There are additional maximas for particles with non-equivalent faces, such as truncated tetrahedron. According to [35], G(r) is strictly connected with an error in packing fraction introduced by finite size effects, so, as there are almost no correlations after r = 5, finite size effects should be negligible for a packing size used in this study. In order to measure full orientational order propagation, the order parameters conforming to polyhedral groups of point symmetries were used:…”

Section: B Microstructural Propertiesmentioning

confidence: 94%

Random sequential adsorption of Platonic and Archimedean solids

Kubala

2019

Phys. Rev. E

View full text Add to dashboard Cite

The aim of the study presented here was the analysis of packings generated according to random sequential adsorption protocol consisting of identical Platonic and Archimedean solids. The computer simulations performed showed, that the highest saturated packing fraction θ = 0.402 10(68) is reached by packings build of truncated tetrahedra and the smallest one θ = 0.356 35(67) by packings composed of regular tetrahedra. The propagation of translational and orientational order exhibited microstructural propertied typically seen in RSA packings and the kinetics of 3 dimensional packings growth were again observed not to be strictly connected with the dimenstion of the configuration space. Moreover, a number of optimizations for the RSA algorithm were described allowing generation of significantly larger packings, which translated directly to a lower statistical error of the results obtained. Additionally, the polyhedral order parameters provided can be utilized in other studies regarding particles of polyhedral symmetry.

show abstract

Boundary conditions in random sequential adsorption

Cited by 39 publications

References 26 publications

Saturated random packing built of arbitrary polygons under random sequential adsorption protocol

Saturated random packing built of arbitrary polygons under random sequential adsorption protocol

Precise algorithm to generate random sequential adsorption of hard polygons at saturation

Random sequential adsorption of Platonic and Archimedean solids

Contact Info

Product

Resources

About