Abstract
In this paper we compute the site percolation probabilitiesP c on Sierpinski Carpets, using the Translational-Dilation method and Monte Carlo technique. We find a relation amongP c , fractal dimensionalityD and connectivityQ. It seems that the family of Carpets with central cutouts belongs to the same universality class, and the family of Carpets with evently scattered cutouts seems to belong to another universality class.
Similar content being viewed by others
References
Mandelbrot, B.B.: The fractal geometry of nature, San Francisco: Freeman 1982
Gefen, Y., Aharony, A., Mandelbrot, B.B.: J. Phys. A: Math. Gen.16, 1267 (1983)
Gefen, Y., Aharony, A., Shapir, Y., Mandelbrot, B.B.: J. Phys. A: Math. Gen.17, 435 (1984)
Gefen, Y., Aharony, A., Mandelbrot, B.B.: J. Phys. A: Math. Gen.17, 1277 (1984)
Gefen, Y., Mandelbrot, B.B., Aharony, A.: Phys. Rev. Lett.45, 855 (1980)
Riea, R., Chaves, C.M.: Z. Phys. B — Condensed Matter62, 387 (1986)
Lin, B., Yang, Z.R.: J. Phys. A: Math. Gen.19, L 49 (1986)
Kadanoff, L.P.: Ann. Phys. NY100, 359 (1976)
Dean, P.: Proc. Cambridge Philos Soc.59, 397 (1963)
Author information
Authors and Affiliations
Additional information
This work supported by China National Science Foundation
Rights and permissions
About this article
Cite this article
Bo-Ming, Y., Kai-Lun, Y. Critical percolation probabilities for site problems on Sierpinski Carpets. Z. Physik B - Condensed Matter 70, 209–212 (1988). https://doi.org/10.1007/BF01318301
Issue Date:
DOI: https://doi.org/10.1007/BF01318301