Related papers: Comment on "Explicit Analytical Solution for Rando…
Network management protocols often require timely and meaningful insight about per flow network traffic. This paper introduces Randomized Admission Policy (RAP) - a novel algorithm for the frequency and top-k estimation problems, which are…
Consider the classical Bin Packing problem with $d$ different item sizes $s_i$ and amounts of items $a_i.$ The support of a Bin Packing solution is the number of differently filled bins. In this work, we show that the lower bound on the…
We consider dense random packing of disks with a power-law distribution of radii and investigate their correlation properties. We study the corresponding structure factor, mass-radius relation and pair distribution function of the disk…
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…
We present a first exact study on higher-dimensional packing problems with order constraints. Problems of this type occur naturally in applications such as logistics or computer architecture and can be interpreted as higher-dimensional…
We study the structural properties of two-dimensional granular packings prepared by random deposition from a source line. We consider a class of random ballistic deposition models based on single-particle relaxation rules controlled by a…
We derive the exact nonequilibrium steady state of a run-and-tumble particle (RTP) in $d$ dimensions confined in an isotropic harmonic trap $V(\mathbf r)=\mu r^{2}/2$, with $r=\|\mathbf r\|$. Rotational invariance reduces the problem to the…
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,…
The Joint Replenishment Problem (JRP) is a fundamental optimization problem in supply-chain management, concerned with optimizing the flow of goods from a supplier to retailers. Over time, in response to demands at the retailers, the…
The range closest-pair (RCP) problem is the range-search version of the classical closest-pair problem, which aims to store a given dataset of points in some data structure such that when a query range $X$ is specified, the closest pair of…
Circles of a single size can pack together densely in a hexagonal lattice, but adding in size variety disrupts the order of those packings. We conduct simulations which generate dense random packings of circles with specified size…
We introduce a 2-dimensional lattice model of granular matter. We use a combination of proof and simulation to demonstrate an order/disorder phase transition in the model, to which we associate the granular phenomenon of random close…
In this paper we attack one of the most fundamental signal processing/informaton theory problems, widely known as the MIMO ML-detection. We introduce a powerful Random Duality Theory (RDT) mechanism that we refer to as the Controlled…
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.…
Packing spheres efficiently in large dimension $d$ is a particularly difficult optimization problem. In this paper we add an isotropic interaction potential to the pure hard-core repulsion, and show that one can tune it in order to maximize…
Sphere packings in high dimensions interest mathematicians and physicists and have direct applications in communications theory. Remarkably, no one has been able to provide exponential improvement on a 100-year-old lower bound on the…
The densest local packings of N identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained using a nonlinear programming method operating in conjunction with a stochastic search of…
For a finite set of integers such that the first few gaps between its consecutive elements equal $a$, while the remaining gaps equal $b$, we study dense packings of its translates on the line. We obtain an explicit lower bound on the…
We study the entanglement entropy of random partitions in one- and two-dimensional critical fermionic systems. In an infinite system we consider a finite, connected (hypercubic) domain of linear extent $L$, the points of which with…
Mean density of lower dimensional random closed sets, as well as the mean boundary density of full dimensional random sets, and their estimation are of great interest in many real applications. Only partial results are available so far in…