Critical Percolation Probabilities for the Next-Nearest-Neighboring Site Problems on Sierpinski Carpets

Simple item page
dc.creatorNie, H. B.
dc.creatorYu, B. M.
dc.creatorYao, K. L.
dc.date2003-06-03
dc.date.accessioned2026-07-07T04:30:14Z
dc.date.available2026-07-07T04:30:14Z
dc.descriptionIn 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.
dc.description10 pages, 8 figures
dc.identifierhttps://arxiv.org/abs/math-ph/0306013
dc.identifierhttp://arxiv.org/abs/math-ph/0306013
dc.identifierCOMMUNICATIONS IN THEORETICAL PHYSICS 21 (3): 281-288 APR 30 1994
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/57404
dc.subjectMathematical Physics
dc.subject82B43, 82B26, 28A80
dc.titleCritical Percolation Probabilities for the Next-Nearest-Neighboring Site Problems on Sierpinski Carpets
dc.typetext

Files

Collections

arXiv