Related papers: Comment on "Explicit Analytical Solution for Rando…
The problem of finding the most efficient way to pack spheres has an illustrious history, dating back to the crystalline arrays conjectured by Kepler and the random geometries explored by Bernal in the 60's. This problem finds applications…
A new approach to solving a large class of factorable nonlinear programming (NLP) problems to global optimality is presented in this paper. Unlike the traditional strategy of partitioning the decision-variable space employed in many…
A cloud scheduler packs tasks onto machines with contradictory goals of (1) using the machines as efficiently as possible while (2) avoiding overloading that might result in CPU throttling or out-of-memory errors. We take a stochastic…
Floating-point round-off errors are ubiquitous in numerically intensive programs arising in fields such as scientific computing and optimization. As floating-point errors potentially lead to unexpected and catastrophic program failures, one…
The random phase approximation (RPA) for the correlation energy functional of density functional theory has recently attracted renewed interest. Formulated in terms of the Kohn-Sham (KS) orbitals and eigenvalues, it promises to resolve some…
Range closest-pair (RCP) search is a range-search variant of the classical closest-pair problem, which aims to store a given set $S$ of points into some space-efficient data structure such that when a query range $Q$ is specified, the…
Given a dataset $S$ of points in $\mathbb{R}^2$, the range closest-pair (RCP) problem aims to preprocess $S$ into a data structure such that when a query range $X$ is specified, the closest-pair in $S \cap X$ can be reported efficiently.…
We measure the number Omega(phi) of mechanically stable states of volume fraction phi of a granular assembly under gravity. The granular entropy S(phi) = log Omega(phi) vanishes both at high density, at phi = phi_rcp, and a low density, at…
An error occurs in a part of the statement and proof of Proposition 2.2 in Jour. Math. Anal. and Appl., 476, (2019), 53-85 that is corrected in this erratum. The revised result reveals a new and unexpected critical phenomenon, having…
We investigate equal spheres packings generated from several experiments and from a large number of different numerical simulations. The structural organization of these disordered packings is studied in terms of the network of common…
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…
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…
Rigidity percolation (RP) is the emergence of mechanical stability in networks. Motivated by the experimentally observed fractal nature of materials like colloidal gels and disordered fiber networks, we study RP in a fractal network.…
Based on our \bl{\textbf{Random Duality Theory (RDT)}}, in a sequence of our recent papers \cite{Stojnicclupint19,Stojnicclupcmpl19,Stojnicclupplt19}, we introduced a powerful algorithmic mechanism (called \bl{\textbf{CLuP}}) that can be…
We provide an exact expression of the moment of the partition function for random energy models of finite system size, generalizing an earlier expression for a grand canonical version of the discrete random energy model presented by the…
The Container Relocation Problem (CRP) is concerned with finding a sequence of moves of containers that minimizes the number of relocations needed to retrieve all containers, while respecting a given order of retrieval. However, the…
Adaptive randomized pivoting (ARP) is a recently proposed and highly effective algorithm for column subset selection. This paper reinterprets the ARP algorithm by drawing connections to the volume sampling distribution and active learning…
In this article, we report on an exact closed-form solution for the displacement at the surface of an elastic half-space elicited by a buried point source that acts at some point underneath that surface. This is commonly referred to as the…
In the article "Stochastic evolution equations for large portfolios of Stochastic Volatility models" (Arxiv:1701.05640) there is a mistake in the proof of Theorem 3.1. In this erratum we establish a weaker version of this Theorem and then…
Predicting the densest random disc packing fraction is an unsolved paradigm problem relevant to a number of disciplines and technologies. One difficulty is that it is ill-defined without setting a criterion for the disorder. Another is that…