Related papers: Algorithms to generate saturated random sequential…
Random packing of spheres inside fractal collectors of dimension 2 < d < 3 is studied numerically using Random Sequential Adsorption (RSA) algorithm. The paper focuses mainly on the measurement of random packing saturation limit.…
Synthetic polymeric materials underpin fundamental technologies in the energy, electronics, consumer goods, and medical sectors, yet their development still suffers from prolonged design timelines. Although polymer informatics tools have…
In this work we extend recent study of the properties of the dense packing of "superdisks," by Y. Jiao, F. H. Stillinger and S. Torquato, Phys. Rev. Lett. 100, 245504 (2008), to the jammed state formed by these objects in random sequential…
A collection of spherical particles can be packed tightly together into an amorphous packing known as "random close packing" (RCP). This structure is of interest as a model for the arrangement of molecules in simple liquids and glasses, as…
We investigate both analytically and by numerical simulation the kinetics of a microscopic model of hard rods adsorbing on a linear substrate, a model which is relevant for compaction of granular materials. The computer simulations use an…
Finding the optimal random packing of non-spherical particles is an open problem with great significance in a broad range of scientific and engineering fields. So far, this search has been performed only empirically on a case-by-case basis,…
We present an algorithm for sampling tightly confined random equilateral closed polygons in three-space which has runtime linear in the number of edges. Using symplectic geometry, sampling such polygons reduces to sampling a moment…
In random sequential covering, identical objects are deposited randomly, irreversibly, and sequentially; only attempts increasing the coverage are accepted. A finite system eventually gets congested, and we study the statistics of congested…
We provide a robust and general algorithm for computing distribution functions associated to induced orthogonal polynomial measures. We leverage several tools for orthogonal polynomials to provide a spectrally-accurate method for a broad…
This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are…
The rich variety of densest columnar structures of identical hard spheres inside a cylinder can surprisingly be constructed from a simple and computationally fast sequential deposition of cylinder-touching spheres, if the cylinder-to-sphere…
Dense random packings of hard particles are useful models of granular media and are closely related to the structure of nonequilibrium low-temperature amorphous phases of matter. Most work has been done for random jammed packings of…
We present an algorithm to simulate random sequential adsorption (random "parking") of discs on constant-curvature surfaces: the plane, sphere, hyperboloid, and projective plane, all embedded in three-dimensional space. We simulate complete…
Kernel density estimators with circular data have been studied extensively for decades, as they allow flexible estimations even when the shape of the underlying density is complex. Many recent studies have examined bias correction methods;…
Maximally random jammed (MRJ) particle packings can be viewed as prototypical glasses in that they are maximally disordered while simultaneously being mechanically rigid. The prediction of the MRJ packing density phi, among other packing…
We study the optimal packing of hard spheres in an infinitely long cylinder, using simulated annealing, and compare our results with the analogous problem of packing disks on the unrolled surface of a cylinder. The densest structures are…
Molecular simulations of the self-assembly of cone-shaped particles with specific, attractive interactions are performed. Upon cooling from random initial conditions, we find that the cones self assemble into clusters and that clusters…
Adsorption of dimers is modelled using random sequential adsorption algorithm. The interaction between molecules is given by screened electrostatic potential. The paper focuses on the properties of adsorbed monolayers as well as the…
We use computer simulations and simple theoretical models to analyze the morphologies that result when rod-like particles end-attach onto a curved surface, creating a finite-thickness monolayer aligned with the surface normal. This geometry…
We have formulated the problem of generating periodic dense paritcle packings as an optimization problem called the Adaptive Shrinking Cell (ASC) formulation [S. Torquato and Y. Jiao, Phys. Rev. E {\bf 80}, 041104 (2009)]. Because the…