The expected duration of random sequential adsorption
Aidan Sudbury

TL;DR
This paper derives a universal asymptotic formula for the expected duration of random sequential adsorption processes on finite graphs, where particles irreversibly occupy sites and inhibit further adsorption.
Contribution
It introduces a universal asymptotic formula for the mean duration of random sequential adsorption on finite graphs, accounting for multiple particle types and inhibition effects.
Findings
Derived a universal asymptotic formula for mean duration
Applicable to various types of particles and graphs
Provides insights into the kinetics of surface adsorption processes
Abstract
When gas molecules bind to a surface they may do so in such a way that the adsorption of one molecule inhibits the arrival of others. We consider random sequential adsorption in which the empty sites of a graph are irreversibly occupied in random order by a variety of types of ``particles.'' In a finite region the process terminates when no more particles can arrive. A universal asymptotic formula for the mean duration is given.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
