Critical Percolation Probabilities for the Next-Nearest-Neighboring Site Problems on Sierpinski Carpets
From MaRDI portal
Publication:6468951
arXivmath-ph/0306013MaRDI QIDQ6468951FDOQ6468951
Authors: H. B. Nie, B. M. Yu, Kai-Lun Yao 
Publication date: 3 June 2003
Abstract: In this paper, we compute the next-nearest-neighboring site percolation (Connections exist not only between nearest-neighboring sites, but also between next-nearest-neighboring sites.) probabilities Pc on the two-dimensional Sierpinski carpets, using the translational-dilation method and Monte Carlo technique. We obtain a relation among Pc, fractal dimensionality D and connectivity Q. For the family of carpets with central cutouts,, where, the critical percolation probability for the next-nearest-neighboring site problem on square lattice. As D reaches 2, which is in agreement with the critical percolation probability on 2-d square lattices with next-nearest-neighboring interactions.
Fractals (28A80) Phase transitions (general) in equilibrium statistical mechanics (82B26) Percolation (82B43)
This page was built for publication: Critical Percolation Probabilities for the Next-Nearest-Neighboring Site Problems on Sierpinski Carpets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6468951)
