Related papers: Density and correlation in a random sequential ads…
By means of contact-density chain-growth simulations, we investigate a simple lattice model of a flexible polymer interacting with an attractive substrate. The contact density is a function of the numbers of monomer-substrate and…
We describe in detail a new and highly efficient algorithm for studying site or bond percolation on any lattice. The algorithm can measure an observable quantity in a percolation system for all values of the site or bond occupation…
In many areas of research it is interesting how lattices can be filled with particles that have no nearest neighbors, or they are in limited quantities. Examples may be found in statistical physics, chemistry, materials science, discrete…
We consider the correlations and the hydrodynamic description of random walkers with a general finite memory moving on a $d$ dimensional hypercubic lattice. We derive a drift-diffusion equation and identify a memory-dependent critical…
We consider two-species random sequential adsorption (RSA) in which species A and B adsorb randomly on a lattice with the restriction that opposite species cannot occupy nearest-neighbor sites. When the probability $x_A$ of choosing an A…
We consider the percolation problem of sites on an $L\times L$ square lattice with periodic boundary conditions which were unvisited by a random walk of $N=uL^2$ steps, i.e. are vacant. Most of the results are obtained from numerical…
In this article, we study a type of a one dimensional percolation model whose basic features include a sequential dropping of particles on a substrate followed by their transport via a pushing mechanism (see [S. N. Majumdar and D. S. Dean,…
In this paper we discuss the continuity properties of the integrated density of states for random models based on that of the single site distribution. Our results are valid for models with independent randomness with arbitrary free parts.…
A traffic model on an open one-dimensional lattice is considered. At any discrete time moment, with prescribed probability, a particle arrives to the leftmost cell of the lattice, and, with prescribed probability, the arriving particle…
We determine how long a diffusing particle spends in a given spatial range before it dies at an absorbing boundary. In one dimension, for a particle that starts at $x_0$ and is absorbed at $x=0$, the average residence time in the range…
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…
In random sequential adsorption (RSA), objects are deposited on a substrate randomly, irreversibly, and sequentially. Attempts of deposition that lead to an overlap with previously deposited objects are discarded. The process continues…
A model for the adsorption of a binary mixture on a one-dimensional infinite lattice with nearest neighbour cooperative effects is considered. The particles of the two species are both monomers but differ in the repulsive interaction…
Consider random sequential adsorption on a chequerboard lattice with arrivals at rate $1$ on light squares and at rate $\lambda$ on dark squares. Ultimately, each square is either occupied, or blocked by an occupied neighbour. Colour the…
The one-dimensional contact process is analyzed by a cluster approximation. In this approach, the hierarchy of rate equations for the densities of finite length empty intervals are truncated under the assumption that adjacent intervals are…
We study dynamical behaviors of one-dimensional stochastic lattice gases with repulsive interactions whose span can be arbitrary large. We endow the system with a zero-temperature dynamics, so that the hops to empty sites which would have…
We investigate both analytically and by numerical simulation the kinetics of a microscopic model of hard rods adsorbing on a linear substrate, a model which is relevant for compaction of granular materials. The computer simulations use an…
We report a surprising result, established by numerical simulations and analytical arguments for a one-dimensional lattice model of random sequential adsorption, that even an arbitrarily small imprecision in the lattice-site localization…
The probability distribution of the number $s$ of distinct sites visited up to time $t$ by a random walk on the fully-connected lattice with $N$ sites is first obtained by solving the eigenvalue problem associated with the discrete master…
This paper presents a numerical study of flow through static random assemblies of monodisperse, spherical particles. A lattice Boltzmann approach based on a two relaxation time collision operator is used to obtain reliable predictions of…