pith. sign in

arxiv: 1008.3692 · v1 · pith:LUFLECKBnew · submitted 2010-08-22 · 🧮 math.PR · math-ph· math.MP

Asymptotic Analysis of a Drop-Push Model For Percolation

classification 🧮 math.PR math-phmath.MP
keywords emptyparticlesparticlesitesitesasymptoticdimensionaldisplacement
0
0 comments X
read the original abstract

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, Phys. Rev. Ltt. A 11, 89 (2002)]). Consider an empty one dimensional lattice with n empty sites and periodic boundary conditions (as a necklace with n rings). Imagine then the particles which drop sequentially on this lattice, uniformly at random on one of the n sites. Letting a site can settles at most one particle, if a particle drops on an empty site, it stick there and otherwise the particle moves according to a symmetric random walk until it takes place in the first empty site it meet. We study here, the asymptotic behavior of the arrangement of empty sites and of the total displacement of all particles as well as the partial displacement of some particles.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.