Related papers: Jamming coverage in competitive random sequential …
We investigate the existence of random close and random loose packing limits in two-dimensional packings of monodisperse hard disks. A statistical mechanics approach-- based on several approximations to predict the probability distribution…
We characterize the jammed state structure of the random sequential adsorption of segments of two different sizes on a line. To this end, we define the size ratio as a dimensionless quantity measuring the length of the large segments in…
We study random sequential adsorption of particles from pool onto a one dimensional substrate following ballistic deposition rules, with separate nucleation and growth processes occurring simultaneously. Nucleation describes the formation…
We consider two variations of the discrete car parking problem where at every vertex of the integers a car arrives with rate one, now allowing for parking in two lines. a) The car parks in the first line whenever the vertex and all of its…
In this work, we present a variant of the multilayer random sequential adsorption (RSA) process that is inspired by orthogonal resource sharing in wireless communication networks. In the one-dimensional (1D) version of this variant, the…
We consider the security-by-design of a signal-free intersection for connected and autonomous vehicles in the face of strategic jamming attacks. We use a fluid model to characterize macroscopic traffic flow through the intersection, where…
in this article a multilayer parking system of size n=3 is studied. We prove that the asymptotic limit of the particle density in the center approaches a maximum of 1/2 in higher layers. This means a significant increase of capacity…
The random sequential adsorption (RSA) model is modified to describe damage and crack accumulation. The exclusion for object deposition (for damaged region formation) is not for the whole object, as in the standard RSA, but only for the…
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…
We consider a one-dimensional traffic model with a slow-to-start rule. The initial position of the cars in $\mathbb R$ is a Poisson process of parameter $\lambda$. Cars have speed 0 or 1 and travel in the same direction. At time zero the…
We apply the random-matrix theory to the car-parking problem. For this purpose, we adopt a Coulomb gas model that associates the coordinates of the gas particles with the eigenvalues of a random matrix. The nature of interaction between the…
We perform a systematic numerical study of the effects of the particle-size ratio $R \ge 1$ on the properties of jammed binary mixtures. We find that changing $R$ does not qualitatively affect the critical scaling of the pressure and…
We study the jamming transition of two-dimensional point-to-point traffic through cooperative mechanisms using computer simulation. We propose two decentralized cooperative mechanisms which are incorporated into the point-to-point traffic…
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…
The behavior of the percolation threshold and the jamming coverage for isotropic random sequential adsorption samples has been studied by means of numerical simulations. A parallel algorithm that is very efficient in terms of its speed and…
We introduce a general random model of a combinatorial optimization problem with geometric structure that encapsulates both linear programming and integer linear programming. Let $Q$ be a bounded set called the feasible set, $E$ be an…
Hyperuniformity characterizes a state of matter that is poised at a critical point at which density or volume-fraction fluctuations are anomalously suppressed at infinite wavelengths. Recently, much attention has been given to the link…
Given strings $P$ and $Q$ the (exact) string matching problem is to find all positions of substrings in $Q$ matching $P$. The classical Knuth-Morris-Pratt algorithm [SIAM J. Comput., 1977] solves the string matching problem in linear time…
In this paper, we present a unified study of the limiting density in one-dimensional random sequential adsorption (RSA) processes where segment lengths are drawn from a given distribution. In addition to generic bounds, we are also able to…
We consider several variants of a car-sharing problem. Given are a number of requests each consisting of a pick-up location and a drop-off location, a number of cars, and nonnegative, symmetric travel times that satisfy the triangle…