Related papers: Precise Algorithm to Generate Random Sequential Ad…
Using computed x-ray tomography we determine the three dimensional (3d) structure of binary hard sphere mixtures as a function of composition and size ratio of the particles, q. Using a recently introduced four-point correlation function we…
We extend the results from the first part of this series of two papers by examining hyperuniformity in heterogeneous media composed of impenetrable anisotropic inclusions. Specifically, we consider maximally random jammed packings of hard…
Connectedness percolation phenomena in two-dimensional packings of elongated particles (discorectangles) were studied numerically. The packings were produced using random sequential adsorption (RSA) off-lattice model with preferential…
We propose a new class of space-filling designs called rotated sphere packing designs for computer experiments. The approach starts from the asymptotically optimal positioning of identical balls that covers the unit cube. Properly scaled,…
We model a dense wireless local area network where the access points (APs) employ carrier sense multiple access (CSMA)-type medium access control protocol. In our model, the spatial locations of the set of active APs are modeled using the…
A random packing of hard particles represents a fundamental model for granular matter. Despite its importance, analytical modeling of random packings remains difficult due to the existence of strong correlations which preclude the…
Packing problems, which ask how to arrange a collection of objects in space to meet certain criteria, are important in a great many physical and biological systems, where geometrical arrangements at small scales control behaviour at larger…
We present an autodifferentiable rejection sampling algorithm termed Rejection Sampling with Autodifferentiation (RSA). In conjunction with reweighting, we show that RSA can be used for efficient parameter estimation and model exploration.…
In a previous work, a simple approach to derive the jamming packing fraction of a hard-sphere mixture from the knowledge of the random close-packing fraction of the monocomponent system was proposed. Now, an extension of that approach is…
The method, proposed in \cite{Za22} to derive the densest packing fraction of random disc and sphere packings, is shown to yield in two dimensions too high a value that (i) violates the very assumption underlying the method and (ii)…
The newly developed "void expansion method" allows for an efficient generation of porous packings of spherical particles over a wide range of volume fractions using the discrete element method. Particles are randomly placed under addition…
Unraveling the complexities of random packing in three dimensions has long puzzled physicists. While both experiments and simulations consistently show a maximum density of 64 percent for tightly packed random spheres, we still lack an…
The densest local packings of N identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained using a nonlinear programming method operating in conjunction with a stochastic search of…
The soft SVD is a robust matrix decomposition algorithm and a key component of matrix completion methods. However, computing the soft SVD for large sparse matrices is often impractical using conventional numerical methods for the SVD due to…
Randomly packing spheres of equal size into a container consistently results in a static configuration with a density of ~64%. The ubiquity of random close packing (RCP) rather than the optimal crystalline array at 74% begs the question of…
This review describes the diversity of jammed configurations attainable by frictionless convex nonoverlapping (hard) particles in Euclidean spaces and for that purpose it stresses individual-packing geometric analysis. A fundamental feature…
Building an accurate surrogate model for the spatio-temporal outputs of a computer simulation is a challenging task. A simple approach to improve the accuracy of the surrogate is to cluster the outputs based on similarity and build a…
In this letter, we used a combination of DEM and the multi-sphere method to investigate the random packing dynamics of $\Sigma_{2v}(2\pi/3)$-triplets. These triplets consist of three overlapping primary spheres, forming a bent structure…
This paper provides a non-asymptotic analysis of linear stochastic approximation (LSA) algorithms with fixed stepsize. This family of methods arises in many machine learning tasks and is used to obtain approximate solutions of a linear…
We revisit the densest binary sphere packings (DBSP) under the periodic boundary conditions and present an updated phase diagram, including newly found 12 putative densest structures over the $x - \alpha$ plane, where $x$ is the relative…