2019
DOI: 10.1088/1742-5468/ab054d
|View full text |Cite
|
Sign up to set email alerts
|

Inverse percolation by removing straight rigid rods from square lattices in the presence of impurities

Abstract: Numerical simulations and finite-size scaling analysis have been carried out to study the problem of inverse percolation by removing straight rigid rods from square lattices contaminated with non-conducting impurities. The presence of impurities provides a more realistic approach to the deposited monolayer, which usually presents inhomogeneities due to the irregular arrangement of surface and bulk atoms, the presence of various chemical species, etc. The process starts with an initial configuration, where all … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
18
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 14 publications
(21 citation statements)
references
References 73 publications
3
18
0
Order By: Relevance
“…To conclude with the analysis of jamming properties, the critical exponent ν j was measured for different values of the size k. In all cases, the values obtained for ν j (1) remain close to 3/2, (2) coincide, within numerical errors, with the same value of the critical exponent obtained by us for other three dimensional systems [22,26], and (3) differs clearly from the value ν j ≈ 1 reported by Vandewalle et al [12] for the case of linear k-mers on square lattices, and from other 2D systems [25,42].…”
Section: Discussionsupporting
confidence: 87%
“…To conclude with the analysis of jamming properties, the critical exponent ν j was measured for different values of the size k. In all cases, the values obtained for ν j (1) remain close to 3/2, (2) coincide, within numerical errors, with the same value of the critical exponent obtained by us for other three dimensional systems [22,26], and (3) differs clearly from the value ν j ≈ 1 reported by Vandewalle et al [12] for the case of linear k-mers on square lattices, and from other 2D systems [25,42].…”
Section: Discussionsupporting
confidence: 87%
“…The mean packing fraction at the limit of infinite packing can be estimated by finding the crossing of the CDF's for different packing sizes. This method is especially useful for studying RSA on lattices [30][31][32][33][34][35]. However, in our case, the precision given by 2 is enough due to quite large size of packings used in this study.…”
Section: A Mean Saturated Packing Fractionmentioning
confidence: 94%
“…Following the scheme given in Eqs. (1)(2)(3)(4)(5), different systems were characterized in previous work from our group: (1) linear k-mers on 1D lattices [45]; (2) linear k-mers on 2D square lattices with and without the presence of impurities [48,49]; (3) linear k-mers on 2D triangular lattices [50]; (4) k × k square tiles (k 2 -mers) on 2D square lattices [27]; (5) linear k-mers on 3D simple cubic lattices [45]; (6) k 2 -mers on 3D simple cubic lattices [51] and (7) k × k × k cubic objects k 3 -mers on 3D simple cubic lattices [52]. In all cases, ν j was determined from Eqs.…”
Section: Model and Basic Definitionsmentioning
confidence: 99%
“…More recently, the exponent ν j was measured for different systems in 1D, 2D and 3D Euclidean lattices [27,[49][50][51][52]. The obtained results reveal a simple dependence of ν j with the dimensionality of the lattice.…”
Section: Introductionmentioning
confidence: 99%