This is the authors' abstract. We don't add key points for this paper.
The dynamics of a random sequential adsorption process on a quasi-one-dimensional lattice with three rows is solved exactly. The long-time behaviour of the coverage density is rho (t)= 1 / 3 -2 exp(-( 2 / 3 +t))/9. It is shown that the number of connected lattice animals increases like n! 2 3/, indicating that most two-dimensional lattice animals are non-compact.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Baram et al. (1994) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: