Sierpinski地毯上次近邻点问题的临界渗流概率
Critical Percolation Probabilities for the Next-Nearest-Neighboring Site Problems on Sierpinski Carpets
摘要:
在本文中,我们计算的次最近邻站点渗流(连接不仅存在于最近邻站点之间,但也存在于次最近邻站点之间)。概率Pc的二维Sierpinski地毯,使用膨胀方法和Monte Carlo技术。得到了Pc、分形维数D和连通度Q之间的关系。对于具有中心开孔的地毯族,其中,给出了正方形格子上次近邻点问题的临界渗流概率。当D达到2时,这与具有次近邻相互作用的2-d正方晶格上的临界渗流概率一致。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。