Abstract
If particles are dropped randomly on a lattice, with a placement being cancelled if the site in question or a nearest neighbor is already occupied, an ensemble of restricted random walks is created. We seek the time dependence of the expected occupation of a given site. It is shown that this problem reduces to one of enumerating walks from the given site in which a move can only be made to a previously occupied site or one of its nearest neighbors.
Original language | English (US) |
---|---|
Pages (from-to) | 219-222 |
Number of pages | 4 |
Journal | Combinatorics, Probability and Computing |
Volume | 1 |
Issue number | 3 |
DOIs | |
State | Published - Sep 1992 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Statistics and Probability
- Computational Theory and Mathematics
- Applied Mathematics