Related papers: A Linear Programming Algorithm to Test for Jamming…
We study the structural and mechanical properties of jammed ellipse packings, and find that the nature of the jamming transition in these systems is fundamentally different from that for spherical particles. Ellipse packings are generically…
We use numerical simulation to investigate and analyze the way that rigid disks and spheres arrange themselves when compressed next to incommensurate substrates. For disks, a movable set is pressed into a jammed state against an ordered…
In the late 1980s, Sam Edwards proposed a possible statistical-mechanical framework to describe the properties of disordered granular materials. A key assumption underlying the theory was that all jammed packings are equally likely. In the…
As compute power increases with time, more involved and larger simulations become possible. However, it gets increasingly difficult to efficiently use the provided computational resources. Especially in particle-based simulations with a…
Particle-wall interactions play a crucially important role in various applications such as microfluidic devices for cell sorting, particle separation, entire class of hydrodynamic filtration and its derivatives, etc. Yet, accurate…
A voxelization based post-processing algorithm is proposed to analyze the packing of non-spherical particle assemblies simulated using the Discrete Element Method. Voxelization of the particle data allows for isolating the geometric…
Dense packings of hard particles have important applications in many fields, including condensed matter physics, discrete geometry and cell biology. In this paper, we employ a stochastic search implementation of the Torquato-Jiao…
Several mean-field theories predict that Hessian matrices of amorphous solids can be written by using the random matrix in the limit of the large spatial dimensions $d\to\infty$. Motivated by these results, we here propose a way to map a…
We describe an algorithm that allows one to find dense packing configurations of a number of congruent disks in arbitrary domains in two or more dimensions. We have applied it to a large class of two dimensional domains such as rectangles,…
Evaluating the performance of Simultaneous Localization and Mapping (SLAM) algorithms is essential for scientists and users of robotic systems alike. But there are a multitude of different permutations of possible options of hardware setups…
In the first paper of this series, we introduced Voronoi correlation functions to characterize the structure of maximally random jammed (MRJ) sphere packings across length scales. In the present paper, we determine a variety of correlation…
Soft, amorphous solids such as tissues, foams, and emulsions are composed of deformable particles. However, the effect of single-particle deformability on the collective behavior of soft solids is still poorly understood. We perform…
In this paper, we consider the problem of detecting the presence (or absence) of an unknown but structured signal from the space-time outputs of an array under strong, non-white interference. Our motivation is the detection of a…
Weighted Hamming distance, as a similarity measure between binary codes and binary queries, provides superior accuracy in search tasks than Hamming distance. However, how to efficiently and accurately find $K$ binary codes that have the…
The solving of linear systems provides a rich area to investigate the use of nearer-term, noisy, intermediate-scale quantum computers. In this work, we discuss hybrid quantum-classical algorithms for skewed linear systems for…
Over the past two decades, fair resource allocation problems have received considerable attention in a variety of application areas. However, little progress has been made in the design of distributed algorithms with convergence guarantees…
We investigate the structural, vibrational, and mechanical properties of jammed packings of deformable particles with shape degrees of freedom in three dimensions (3D). Each 3D deformable particle is modeled as a surface-triangulated…
Randomized rounding is a standard method, based on the probabilistic method, for designing combinatorial approximation algorithms. In Raghavan's seminal paper introducing the method (1988), he writes: "The time taken to solve the linear…
In this work, we have developed a multiscale computational algorithm to couple finite element method with an open source molecular dynamics code --- the Large scale Atomic/Molecular Massively Parallel Simulator (LAMMPS) --- to perform…
Vibrational spectra and normal modes of mechanically stable particle packings in three dimensions are analyzed over a range of compressions, from near the jamming transition, where the packings lose their rigidity, to far above it. At high…