A fast algorithm for random sequential adsorption of discs
Jian-Sheng WANG
TL;DR
This paper presents an efficient algorithm for the random sequential adsorption of discs in two dimensions, accurately determining the coverage and analyzing the pair correlation function.
Contribution
The paper introduces a fast algorithm for 2D disc adsorption and provides precise measurements of coverage and correlation functions, advancing simulation accuracy.
Findings
Coverage value theta(infty) = 0.547069
Asymptotic law verified to high accuracy
Pair correlation function analyzed
Abstract
An efficient algorithm for random sequential adsorption of hard discs in two dimensions is implemented. A precise value for the coverage is obtained: theta(infty) = 0.547069. The asymptotic law theta(t) = theta(infty) - ct^{-1/2} is verified to a high accuracy. Pair correlation function is analyzed.
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.