Related papers: A Linear Programming Algorithm to Test for Jamming…
Accurate quantification of local packing density and mixing in simulations of particulate systems is essential for many industrial applications. Traditional methods which simply count the number of particle centres within a given volume of…
Mixed packing and covering problems are problems that can be formulated as linear programs using only non-negative coefficients. Examples include multicommodity network flow, the Held-Karp lower bound on TSP, fractional relaxations of set…
We analyze the large scale structure and fluctuations of jammed packings of size disperse spheres, produced in a granular experiment as well as numerically. While the structure factor of the packings reveals no unusual behavior for small…
The local structure of disordered jammed packings of monodisperse spheres without friction, generated by the Lubachevsky-Stillinger algorithm, is studied for packing fractions above and below 64%. The structural similarity of the particle…
There are two main classes of physics-based models for two-dimensional cellular materials: packings of repulsive disks and the vertex model. These models have several disadvantages. For example, disk interactions are typically a function of…
In the first part of a series of two papers, we present in considerable detail a collision-driven molecular dynamics algorithm for a system of nonspherical particles, within a parallelepiped simulation domain, under both periodic or…
We computationally study jammed disordered hard-sphere packings as large as a million particles. We show that the packings are saturated and hyperuniform, i.e., that local density fluctuations grow only as a logarithmically-augmented…
The parallel alternating direction method of multipliers (ADMM) algorithms have gained popularity in statistics and machine learning due to their efficient handling of large sample data problems. However, the parallel structure of these…
The graph partitioning problem has many applications in scientific computing such as computer aided design, data mining, image compression and other applications with sparse-matrix vector multiplications as a kernel operation. In many cases…
The packing of hard spheres (HS) of diameter $\sigma$ in a cylinder has been used to model experimental systems, such as fullerenes in nanotubes and colloidal wire assembly. Finding the densest packings of HS under this type of confinement,…
In a series of recent works, we have generalised the consistency results in the stochastic block model literature to the case of uniform and non-uniform hypergraphs. The present paper continues the same line of study, where we focus on…
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…
Despite its long history, there are many fundamental issues concerning random packings of spheres that remain elusive, including a precise definition of random close packing (RCP). We argue that the current picture of RCP cannot be made…
In this study, a versatile methodology for initiating polymerization from monomers in highly cross-linked materials is investigated. As polymerization progresses, force-field parameters undergo continuous modification due to the formation…
We study broadcasting in multiple access channels with dynamic packet arrivals and jamming. Communication environments are represented by adversarial models that specify constraints on packet arrivals and jamming. We consider deterministic…
We present an algorithm for approximating linear categories of partitions (of sets). We report on concrete computer experiments based on this algorithm which we used to obtain first examples of so-called non-easy linear categories of…
Assemblies of purely repulsive and frictionless particles, such as emulsions or hard spheres, display very curious properties near their jamming transition, which occurs at the random close packing for mono-disperse spheres. Although such…
Inspired by the linear programming method developed by Cohn and Elkies (Ann. Math. 157(2): 689-714, 2003), we introduce a new linear programming method to solve the sphere packing problem. More concretely, we consider sequences of auxiliary…
Random packing of unoriented regular polygons and star polygons on a two-dimensional flat, continuous surface is studied numerically using random sequential adsorption algorithm. Obtained results are analyzed to determine saturated random…
We present a new numerical scheme to study systems of non-convex, irregular, and punctured particles in an efficient manner. We employ this method to analyze regular packings of odd-shaped bodies, not only from a nanoparticle but also both…