Jamming and percolation of k2-mers on simple cubic lattices
Abstract
Jamming and percolation of square objects of size k × k (k2-mers) isotropically deposited on simple cubic lattices have been studied by numerical simulations complemented with finite-size scaling theory. The k2-mers were irreversibly deposited into the lattice. Jamming coverage θj,k was determined for a wide range of k (2 ≤ k ≤ 200). θj,k exhibits a decreasing behavior with increasing k, being θj,k→∞=0.4285(6) the limit value for large k2-mer sizes. On the other hand, the obtained results shows that percolation threshold, θc,k, has a strong dependence on k. It is a decreasing function in the range 2 ≤ k ≤ 18 with a minimum around k=18 and, for k ≥ 18, it increases smoothly towards a saturation value. Finally, a complete analysis of critical exponents and universality has been done, showing that the percolation phase transition involved in the system has the same universality class as the 3D random percolation, regardless of the size k considered.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.