2022
DOI: 10.1088/1751-8121/ac6241
|View full text |Cite
|
Sign up to set email alerts
|

Jamming and percolation in the random sequential adsorption of a binary mixture on the square lattice

Abstract: We study the competitive irreversible adsorption of a binary mixture of monomers and square-shaped particles of linear size R on the square lattice. With the random sequential adsorption model, we investigate how the jamming coverage and percolation properties depend on the size ratio R and relative flux F. We find that the onset of percolation of monomers is always lower for the binary mixture than in the case with only monomers (R = 1). Moreover, for values F below a critical value, the higher is the flux or si… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 61 publications
0
2
0
Order By: Relevance
“…A list of near-neighbor particles was constructed [39] and calculations were performed using the Hoshen-Kopelman algorithm [40]. Note that some similar problems related with jamming and percolation in RSA packing of extended objects were recently discussed [41,42].…”
Section: Computation Detailsmentioning
confidence: 99%
“…A list of near-neighbor particles was constructed [39] and calculations were performed using the Hoshen-Kopelman algorithm [40]. Note that some similar problems related with jamming and percolation in RSA packing of extended objects were recently discussed [41,42].…”
Section: Computation Detailsmentioning
confidence: 99%
“…The different variant of RSA model with deposition of binary mixtures or particles with size distributions were also analyzed [17][18][19][20][21][22]. For multicomponent mixtures the competitive and multistep RSA models were investigated.…”
Section: Introductionmentioning
confidence: 99%
“…Percolation of the objects deposited in RSA has also received much attention [11][12][13]. We note that, different from usual Bernoulli percolation, which involves a set of mutually independent random variables, percolation in RSA is an intrinsically nonequilibrium, historydependent process.…”
Section: Introductionmentioning
confidence: 99%