Related papers: The disc random packing problem: a disorder criter…
Random tilings or packings in the plane are characterized by a size distribution of individual elements (domains) and by the statistics of neighbor relations between the domains. Most systems occurring in nature or technology have a…
Among the family of hard convex lens-shaped particles (lenses), the one with aspect ratio equal to 2/3 is `optimal' in the sense that the maximally random jammed (MRJ) packings of such lenses achieve the highest packing fraction $\phi_{\rm…
Circle packings are arrangement of circles satisfying specified tangency requirements. Many problems about packing of circles and spheres occur in nature particularly in material design and protein structure. Surprisingly, little is known…
Cosmological fine-tuning has traditionally been associated with the narrowness of the intervals in which the parameters of the physical models must be located to make life possible. A more thorough approach focuses on the probability of the…
Accretion discs are generally warped. If a warp in a disc is too large, the disc can `break' apart into two or more distinct planes, with only tenuous connections between them. Further if an initially planar disc is subject to a strong…
Positional reasoning is the process of ordering unsorted parts contained in a set into a consistent structure. We present Positional Diffusion, a plug-and-play graph formulation with Diffusion Probabilistic Models to address positional…
A novel multi-resolution cluster detection (MCD) method is proposed to identify irregularly shaped clusters in space. Multi-scale test statistic on a single cell is derived based on likelihood ratio statistic for Bernoulli sequence, Poisson…
In random sequential covering, identical objects are deposited randomly, irreversibly, and sequentially; only attempts increasing the coverage are accepted. A finite system eventually gets congested, and we study the statistics of congested…
Maximum disc decompositions of rotation curves place a dynamical upper limit to the mass attributable to stars in galaxies. The precise definition of this term, however, can be vague and varies in usage. We develop an algorithm to robustly…
Distributionally robust optimization (DRO) has been introduced for solving stochastic programs where the distribution of the random parameters is unknown and must be estimated by samples from that distribution. A key element of DRO is the…
We investigate the problem of best policy identification in discounted linear Markov Decision Processes in the fixed confidence setting under a generative model. We first derive an instance-specific lower bound on the expected number of…
While analyzing mobile systems we often approximate the actual coverage surface and assume an ideal cell shape. In a multi-cellular network, because of its tessellating nature, a hexagon is more preferred than a circular geometry. Despite…
We use computational experiments to find the rectangles of minimum area into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. Most of the packings found have…
We have studied the packing of congruent disks on a spherical cap, for caps of different size and number of disks, $N$. This problem has been considered before only in the limit cases of circle packing inside a circle and on a sphere…
Packing of spheres is a problem with a long history dating back to Kepler's conjecture in 1611. The highest density is realized in face-centred-cubic (FCC) and hexagonal-close-packed (HCP) arrangements. These are only limiting examples of…
The densest local packing (DLP) problem in d-dimensional Euclidean space Rd involves the placement of N nonoverlapping spheres of unit diameter near an additional fixed unit-diameter sphere such that the greatest distance from the center of…
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 the recent paper \cite{BDT10} we introduced a new problem that we call Bin Packing/Covering with Delivery, or BP/CD for short. Mainly we mean under this expression that we look for not only a good, but a "good and fast" packing or…
We consider the problem of sequential decision making on random fields corrupted by noise. In this scenario, the decision maker observes a noisy version of the data, yet judged with respect to the clean data. In particular, we first…
The density classification task is to determine which of the symbols appearing in an array has the majority. A cellular automaton solving this task is required to converge to a uniform configuration with the majority symbol at each site. It…