Shape universality classes in the random sequential addition of non-spherical particles
arXiv:1611.03034 · doi:10.1103/PhysRevLett.119.028003
Abstract
Random sequential addition (RSA) models are used in a large variety of contexts to model particle aggregation and jamming. A key feature of these models is the algebraic time dependence of the asymptotic jamming coverage as . For the RSA of monodisperse non-spherical particles the scaling is generally believed to be , where for a particle with degrees of freedom. While the result of spheres (Renyi's classical car parking problem) can be derived analytically, evidence for the scaling for arbitrary particle shapes has so far only been provided from empirical studies on a case-by-case basis. Here, we show that the RSA of arbitrary non-spherical particles, whose centres of mass are constrained to fall on a line, can be solved analytically for moderate aspect ratios. The asymptotic jamming coverage is determined by a Laplace-type integral, whose asymptotics is fully specified by the contact distance between two particles of given orientations. The analysis of the contact function shows that the scaling exponent depends on particle shape and falls into two universality classes for generic shapes with orientational degrees of freedom: (i) when is a smooth function of the orientations as for smooth convex shapes, e.g., ellipsoids; (ii) when contains singularities due to flat sides as for, e.g., spherocylinders and polyhedra. The exact solution explains in particular why many empirically observed scalings in and fall in between these two limiting values.
5 pages, 1 figure
References in corpus (4)
- Fundamental challenges in packing problems: from spherical to non-spherical particles
- In a search for a shape maximizing packing fraction for two-dimensional random sequential adsorption
- Universality in the jamming limit for elongated hard particles in one dimension
- Kinetics of random sequential adsorption of nearly spherically symmetric particles
Cited by in corpus (17)
- Random sequential adsorption of Platonic and Archimedean solids
- Saturated random packing built of arbitrary polygons under random sequential adsorption protocol
- Random sequential adsorption of partially ordered discorectangles onto a continuous plane
- Two-dimensional systems of elongated particles: From diluted to dense
- Morphology and Kinetics of Random Sequential Adsorption of Superballs: From Hexapods to Cubes
- Algorithms to generate saturated random sequential adsorption packings built of rounded polygons
- Connectedness percolation in the random sequential adsorption packings of elongated particles
- Kinetics of random sequential adsorption of two-dimensional shapes on a one-dimensional line
- Random sequential adsorption of spheres on a cylinder
- "Paris car parking problem" for partially ordered discorectangles on a line
- Optimal random deposition of interacting particles
- Examination of saturation coverage of polygons using random sequential adsorption algorithm
- Relaxation of saturated random sequential adsorption packings of discorectangles aligned on a line
- Mixing properties of bi-disperse ellipsoid assemblies: Mean-field behaviour in a granular matter experiment
- Random sequential adsorption of aligned regular polygons and rounded squares: Transition in the kinetics of packing growth
- On ballistic deposition process on a strip
- The effects of competition between random sequential nucleation of point-sized seeds and island growth by adsorption of finite-sized grains