Percolation and jamming of random sequential adsorption samples of large linear $k$-mers on a square lattice

M. G. Slutskii, L. Yu. Barash, Yu. Yu. Tarasevich

Published 2018-10-16Version 1

We study the behavior of the percolation threshold and the jamming coverage for isotropic random sequential adsorption samples by means of numerical simulations. A model involving large linear $k$-mers on a square lattice with periodic boundary conditions is considered. We present a parallel algorithm that is very efficient in terms of its speed and memory usage. We investigate the structure of the percolating and jamming states. We generalize the results of G. Kondrat, Z. Koza, and P. Brzeski [Phys. Rev. E 96, 022154 (2017)] for the case of periodic boundary conditions and obtain the percolation thresholds and jamming concentrations for lengths of $k$-mers up to $2^{17}$.