1979
DOI: 10.1007/bf01011170
|View full text |Cite
|
Sign up to set email alerts
|

Percolation and cluster distribution. III. Algorithms for the site-bond problem

Abstract: Algorithms for estimating the percolation probabilities and cluster size distribution are given in the framework of a Monte Carlo simulation for disordered lattices for the generalized site-bond problem. The site-bond approach is useful when a percolation process cannot be exclusively described in the context of pure site or pure bond percolation. An extended multiple labeling technique (ECMLT) is introduced for the generalized problem. The ECMLT is applied to the site-bond percolation problem for square and t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
25
0

Year Published

1981
1981
2017
2017

Publication Types

Select...
9
1

Relationship

1
9

Authors

Journals

citations
Cited by 55 publications
(28 citation statements)
references
References 41 publications
1
25
0
Order By: Relevance
“…On the other hand, Si atoms are newly allocated to the cells neighboring the outermost surface cells, together with the neutrals accompanied, when the redeposition and/or deposition of etch/sputter products occur. In addition, Sicontaining cells floating in vacuum often occur during simulation, which are removed by percolation according to the Hoshen-Kopelman algorithm; [63][64][65] this is a second one of the key procedures in the cell-based simulations such as ASCeM, because unphysically roughened surface features tend to occur without percolation.…”
Section: Surface Advancementmentioning
confidence: 99%
“…On the other hand, Si atoms are newly allocated to the cells neighboring the outermost surface cells, together with the neutrals accompanied, when the redeposition and/or deposition of etch/sputter products occur. In addition, Sicontaining cells floating in vacuum often occur during simulation, which are removed by percolation according to the Hoshen-Kopelman algorithm; [63][64][65] this is a second one of the key procedures in the cell-based simulations such as ASCeM, because unphysically roughened surface features tend to occur without percolation.…”
Section: Surface Advancementmentioning
confidence: 99%
“…A serial Monte Carlo program for a general crystal structure was developed using the Metropolis et al (1953), Swendsen and Wang (1987) and Wolff (1989) methods for the spin models of Ising (1925) and Heisenberg (1928). In contrast to the Metropolis method the latter algorithms do not flip single spins but a cluster of spins, which were calculated with the Hoshen-Kopelman algorithm (Hoshen et al 1979). The Curie temperature was determined as the intersection of the fourth-order cumulant of magnetization-temperature curves for different sized systems (Shan-Ho and Salinas 1998).…”
Section: Estimate Of the Curie Temperature (T C )mentioning
confidence: 99%
“…Although the algorithm was initially applied in statistical physics, nowadays it is used in many diverse fields [ Zhang and Seaton , 1996; Moreira and Barrufetb , 1996; Eddi et al , 1996; Kinney et al , 1994; Hamimov et al , 1989]. The algorithm has been used in ordered lattices with only links, only nodes, or both links and nodes [ Hoshen et al , 1979; Campos et al , 1997; Hoshen , 1980]. The HK algorithm is well‐developed for lattice environments, and less developed for nonlattice environments, such as the disordered networks considered here.…”
Section: Napl Clustersmentioning
confidence: 99%