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

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

2003-06-03

arxiv.org/abs/math-ph/0306013v1

COMMUNICATIONS IN THEORETICAL PHYSICS 21 (3): 281-288 APR 30 1994

Physics

Mathematical Physics

10 pages, 8 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Critical Percolation Probabilities for the Next-Nearest-Neighboring Site Problems on Sierpinski Carpets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Critical Percolation Probabilities for the Next-Nearest-Neighboring Site Problems on Sierpinski Carpets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Critical Percolation Probabilities for the Next-Nearest-Neighboring Site Problems on Sierpinski Carpets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-129810