Abstract
In this paper, we compute the next-nearest-neighbouring site percolation (Connections exist not only between nearest-neighbouring sites, but also between next-nearest-neighbouring sites.) probabilities on the two-dimensional Sierpinski carpets, using the translational-dilation method and Monte Carlo technique. We obtain a relation among , fractal dimensionality and connectivity . For the family of carpets with central cutouts, , where , the critical percolation probability for the next-nearest-neighbouring site problem on square lattice. As reaches , which is in agreement with the critical percolation probability on square lattices with next-nearest-neighbouring interactions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
