Related papers: Competitive random sequential adsorption of point …
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…
Irreversible adsorption of objects of different shapes and sizes on Euclidean, fractal and random lattices is studied. The adsorption process is modeled by using random sequential adsorption (RSA) algorithm. Objects are adsorbed on one-,…
The zero range process is of particular importance as a generic model for domain wall dynamics of one-dimensional systems far from equilibrium. We study this process in one dimension with rates which induce an effective attraction between…
Consider sequential packing of unit balls in a large cube, as in the Renyi car-parking model, but in any dimension and with Poisson input. We show after suitable rescaling that the spatial distribution of packed balls tends to that of a…
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…
We present a model of one-dimensional irreversible adsorption in which particles once adsorbed immediately shrink to a smaller size or expand to a larger size. Exact solutions for the fill factor and the particle number variance as a…
We present a molecular dynamics and kinetic theory study of granular material, modeled by inelastic hard disks, fluidized by a random driving force. The focus is on collisional averages and short distance correlations in the non-equilibrium…
A reversible adsorption-desorption parking process in one dimension is studied. An exact solution for the equilibrium properties is obtained. The coverage near saturation depends logarithmically on the ratio between the adsorption rate,…
We study the fixed points of outer-totalistic cellular automata on sparse random regular graphs. These can be seen as constraint satisfaction problems, where each variable must adhere to the same local constraint, which depends solely on…
We study a single server FIFO queue that offers general service. Each of n customers enter the queue at random time epochs that are inde- pendent and identically distributed. We call this the random scattering traffic model, and the…
Soft random sampling (SRS) is a simple yet effective approach for efficient training of large-scale deep neural networks when dealing with massive data. SRS selects a subset uniformly at random with replacement from the full data set in…
We study a general stochastic ranking problem where an algorithm needs to adaptively select a sequence of elements so as to "cover" a random scenario (drawn from a known distribution) at minimum expected cost. The coverage of each scenario…
Probabilistic principal component analysis (PPCA) seeks a low dimensional representation of a data set in the presence of independent spherical Gaussian noise, Sigma = (sigma^2)*I. The maximum likelihood solution for the model is an…
This paper investigates the supervised learning problem with observations drawn from certain general stationary stochastic processes. Here by \emph{general}, we mean that many stationary stochastic processes can be included. We show that…
Understanding the dynamic adsorption of colloidal particles at fluid interfaces is essential for applications ranging from emulsion stabilization to interfacial assembly of functional materials. Adsorption dynamics is often described…
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…
This paper examines the traffic flows on a two-dimensional stochastic lattice model that comprises a junction of two traveling routes: the domestic route and the international route each of which has parking sites. In our model, the system…
The memory capacity in edge devices is often limited due to constraints on cost, size, and power. Consequently, memory competition leads to inevitable page swapping in memory-constrained mixed-criticality edge devices, causing slow storage…
We further study the stochastic model discussed in Ref.[2] in which positive and negative particles diffuse in an asymmetric, CP invariant way on a ring. The positive particles hop clockwise, the negative counter-clockwise and…
This work discusses numerical studies of the barrier properties of k-mer packings by Monte Carlo method. The studied variants of regular and non-regular arrangements on a square lattice included models of random sequential adsorption (RSA)…