Related papers: Precise Algorithm to Generate Random Sequential Ad…
Disordered hyperuniform packings are unusual amorphous states of two-phase materials that are endowed with exotic physical properties. Such hyperuniform systems are characterized by an anomalous suppression of volume-fraction fluctuations…
We present an analytical derivation of the volume fractions for random close packing (RCP) in both $d=3$ and $d=2$, based on the same methodology. Using suitably modified nearest neigbhour statistics for hard spheres, we obtain…
We consider the integrable family of symmetric boundary-driven interacting particle systems that arise from the non-compact XXX Heisenberg model in one dimension with open boundaries. In contrast to the well-known symmetric exclusion…
We formulate a statistical-mechanical description of a recently introduced random planting model in which plants are represented by growing hard disks. Seedlings of negligible size are introduced at random positions in a field, grow at a…
Elementary smooth functions (beyond contact) are employed to construct pair correlation functions that mimic jammed disordered sphere packings. Using the g2-invariant optimization method of Torquato and Stillinger [J. Phys. Chem. B 106,…
Recently, random feature attentions (RFAs) are proposed to approximate the softmax attention in linear time and space complexity by linearizing the exponential kernel. In this paper, we first propose a novel perspective to understand the…
Packing optimization is a prevalent problem that necessitates robust and efficient algorithms that are also simple to implement. One group of approaches is the raster methods, which rely on approximating the objects with pixelated…
A particularly challenging problem in AI safety is providing guarantees on the behavior of high-dimensional autonomous systems. Verification approaches centered around reachability analysis fail to scale, and purely statistical approaches…
We consider a random diffusion dynamics for an infinite system of hard spheres of two different sizes evolving in $\mathbb{R}^d$, its reversible probability measure, and its projection on the subset of the large spheres. The main feature is…
Random arrangements of points in the plane, interacting only through a simple hard core exclusion, are considered. An intensity parameter controls the average density of arrangements, in analogy with the Poisson point process. It is proved…
Column-sparse packing problems arise in several contexts in both deterministic and stochastic discrete optimization. We present two unifying ideas, (non-uniform) attenuation and multiple-chance algorithms, to obtain improved approximation…
An approach to obtain the structural properties of additive binary hard-sphere mixtures is presented. Such an approach, which is a nontrivial generalization of the one recently used for monocomponent hard-sphere fluids [S. Pieprzyk, A. C.…
Sphere packing, Hilbert's eighteenth problem, asks for the densest arrangement of congruent spheres in n-dimensional Euclidean space. Although relevant to areas such as cryptography, crystallography, and medical imaging, the problem remains…
We create collectively jammed (CJ) packings of 50-50 bidisperse mixtures of smooth disks in 2d using an algorithm in which we successively compress or expand soft particles and minimize the total energy at each step until the particles are…
We present fastrerandomize, an R package for fast, scalable rerandomization in experimental design. Rerandomization improves precision by discarding treatment assignments that fail a prespecified covariate-balance criterion, but existing…
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 consider an incremental approximation method for solving variational problems in infinite-dimensional Hilbert spaces, where in each step a randomly and independently selected subproblem from an infinite collection of subproblems is…
In panel data subject to nonignorable attrition, auxiliary (refreshment) sampling may restore full identification under weak assumptions on the attrition process. Despite their generality, these identification strategies have seen limited…
Defect-free single atom array in optical tweezers is a promising platform for scalable quantum computing, quantum simulation, and quantum metrology. Extending single-species array to mixed-species one promise to offer new possibilities. In…
This article is the updated version of the paper: "Combined 3D thinning and greedy algorithm to approximate realistic particles with corrected mechanical properties, Granular Matter (2019)" by the first author [58]. The main changes here…