Related papers: Jamming coverage in competitive random sequential …
Using experiments and simulations, we investigate the clusters that form when colloidal spheres stick irreversibly to -- or "park" on -- smaller spheres. We use either oppositely charged particles or particles labeled with complementary DNA…
Packet traffic in complex networks undergoes the jamming transition from free-flow to congested state as the number of packets in the system increases. Here we study such jamming transition when queues are operated by the priority queuing…
In this article a multilayer parking system with screening of size n=3 is studied with a focus on the time-dependent particle density. We prove that the asymptotic limit of the particle density increases from an average density of 1/3 on…
Binary jumbled pattern matching asks to preprocess a binary string $S$ in order to answer queries $(i,j)$ which ask for a substring of $S$ that is of length $i$ and has exactly $j$ 1-bits. This problem naturally generalizes to…
In the bin covering problem, the goal is to fill as many bins as possible up to a certain minimal level with a given set of items of different sizes. Online variants, in which the items arrive one after another and have to be packed…
We consider the Generalized Bin Covering (GBC) problem: We are given $m$ bin types, where each bin of type $i$ has profit $p_i$ and demand $d_i$. Furthermore, there are $n$ items, where item $j$ has size $s_j$. A bin of type $i$ is covered…
We study the distributions of waiting times in variations of the $q$-sooner and later waiting time problem. One variation imposes length and frequency quotas on the runs of successes and failures. Another case considers binary trials for…
An asymmetric exclusion process type process, where cars move forward along a closed road that starts and terminates at a parking garage, displays dynamic phase transitions into two types of condensate phases where the garage becomes…
We report calculations of the density of maximally random jamming (aka random close packing) of one-component and binary hard disc fluids. The theoretical structure used provides a common framework for description of the hard disc liquid to…
An important area of combinatorial optimization is the study of packing and covering problems, such as Bin Packing, Multiple Knapsack, and Bin Covering. Those problems have been studied extensively from the viewpoint of approximation…
We numerically examine clogging transitions for bidisperse disks flowing through a two dimensional periodic obstacle array. We show that clogging is a probabilistic event that occurs through a transition from a homogeneous flowing state to…
In this work we extend recent study of the properties of the dense packing of "superdisks," by Y. Jiao, F. H. Stillinger and S. Torquato, Phys. Rev. Lett. 100, 245504 (2008), to the jammed state formed by these objects in random sequential…
It is shown that the fluctuations of the jamming coverage upon Random Sequential Adsorption ($\sigma_{\theta_J}$), decay with the lattice size according to the power-law $\sigma_{\theta_J} \propto L^{-1 / \nu_J}$, with $\nu_{J} = 2 / (2D -…
In this paper, we consider hashing with linear probing for a hashing table with m places, n items (n < m), and l = m<n empty places. For a non computer science-minded reader, we shall use the metaphore of n cars parking on m places: each…
Consider the random sequential packing model with infinite input and in any dimension. When the input consists of non-zero volume convex solids we show that the total number of solids accepted over cubes of volume $\lambda$ is…
The influence of different boundary conditions on the density of random packings of disks is studied. Packings are generated using the random sequential adsorption algorithm with three different types of boundary conditions: periodic, open,…
We apply the equal load-sharing fiber bundle model of fracture failure in composite materials to model the traffic failure in a system of parallel road network in a city. For some special distributions of traffic handling capacities…
We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a…
Cumulative probability models (CPMs) are a robust alternative to linear models for continuous outcomes. However, they are not feasible for very large datasets due to elevated running time and memory usage, which depend on the sample size,…
The lasing and coherent perfect absorption (CPA) properties of $\mathcal{PT}$-symmetric microrings with mixed index and gain gratings, externally coupled to a bus waveguide, are theoretically investigated. For a complex grating at the…