Answers are grounded in this paper and cite their sources.
Series expansions for the time-dependent coverage in random sequential adsorption on a lattice are reviewed. A transformation is carried out, resulting in combinatorial expressions in which only nonrepeating lattice walks are required. Convergence is greatly accelerated, and application is made to the asymptotic coverage of previously solved lattices as well as Bethe lattices and cactuses, or Bethe lattices with the bonds replaced by triangles. The method is extended to multisite correlations as well.
No takes yet. Share an insight, caveat, or question.
Fan et al. (1991) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: