Related papers: Comment on "Explicit Analytical Solution for Rando…
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 numerically study structural properties of mechanically stable packings of hard spheres (HS), in a wide range of packing fractions $0.53 \le \phi \le 0.72$. Detailed structural information is obtained from the analysis of orientational…
In a paper entitled singularities of invariant densities for random switching between two linear odes in 2D, Bakhtin et al [5], consider a Markov process obtained by random switching between two stable linear vector fields in the plane and…
We present and analyze a simple, two-step algorithm to approximate the optimal solution of the sparse PCA problem. Our approach first solves a L1 penalized version of the NP-hard sparse PCA optimization problem and then uses a randomized…
Identifying ordered structures hidden in the packings of particles is a common scientific question in multiple fields. In this work, we investigate the dynamical organizations of a large number of initially randomly packed repulsive…
In this article, we determine the complexity function (configurational entropy) of jammed configurations of Rydberg atoms on a one-dimensional lattice. Our method consists of providing asymptotics for the number of jammed configurations…
Let $G=(V,E)$ be a simple graph with $|V|=n$ nodes and $|E|=m$ links, a subset $K \subseteq V$ of \emph{terminals}, a vector $p=(p_1,\ldots,p_m) \in [0,1]^m$ and a positive integer $d$, called \emph{diameter}. We assume nodes are perfect…
Dimension reduction plays an essential role when decreasing the complexity of solving large-scale problems. The well-known Johnson-Lindenstrauss (JL) Lemma and Restricted Isometry Property (RIP) admit the use of random projection to reduce…
The rankable and compressible sets have been studied for more than a quarter of a century, ever since Allender [1] and Goldberg and Sipser [6] introduced the formal study of polynomial-time ranking. Yet even after all that time, whether the…
We study the optimal packing of short, hard spherocylinders confined to lie tangential to a spherical surface, using simulated annealing and molecular dynamics simulations. For clusters of up to twelve particles, we map out the changes in…
In this paper we propose an improved approximation scheme for the Vector Bin Packing problem (VBP), based on the combination of (near-)optimal solution of the Linear Programming (LP) relaxation and a greedy (modified first-fit) heuristic.…
Formulating a statistical mechanics for granular matter remains a significant challenge, in part, due to the difficulty associated with a complete characterization of the systems under study. We present a fully characterized model of a…
We study the d-dimensional hypercube knapsack problem where we are given a set of d-dimensional hypercubes with associated profits, and a knapsack which is a unit d-dimensional hypercube. The goal is to find an axis-aligned non-overlapping…
We introduce a generalization of the well-known random sequential addition (RSA) process for hard spheres in $d$-dimensional Euclidean space $\mathbb{R}^d$. We show that all of the $n$-particle correlation functions of this nonequilibrium…
The triangle distribution function f^(3) for three mutual nearest neighbors in the plane describes basic aspects of short-range order and statistical thermodynamics in two-dimensional many-particle systems. This paper examines prospects for…
An exact description of the complete jamming landscape is developed for a system of hard discs of diameter $\sigma$, confined between two lines separated by a distance $1+\sqrt{3/4} < H/\sigma < 2$. By considering all possible local packing…
The goal of random sequential adsorption (RSA), a time-dependent packing method, is to create a regular or asymmetric covering of an empty space that can fit in the allocated space without overlapping. The density of coverage tends to reach…
Simple random coverage models, well studied in Euclidean space, can also be defined on a general compact metric space. By analogy with the geometric models, and with the discrete coupon collector's problem and with cover times for finite…
We study three fundamental three-dimensional (3D) geometric packing problems: 3D (Geometric) Bin Packing (3D-BP), 3D Strip Packing (3D-SP), and Minimum Volume Bounding Box (3D-MVBB), where given a set of 3D (rectangular) cuboids, the goal…
Understanding rare events is critical across domains ranging from signal processing to reliability and structural safety, extreme-weather forecasting, and insurance. The analysis of rare events is a computationally challenging problem,…