首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Effects of ramification and connectivity degree on site percolation threshold on regular lattices and fractal networks
Authors:Alexander S Balankin  MA Martínez-Cruz  MD Álvarez-Jasso  M Patiño-Ortiz  J Patiño-Ortiz
Institution:Grupo “Mecánica Fractal”, ESIME-Zacatenco, Instituto Politécnico Nacional, México D.F. 07738, Mexico
Abstract:This Letter is focused on the impact of network topology on the site percolation. Specifically, we study how the site percolation threshold depends on the network dimensions (topological d and fractal D), degree of connectivity (quantified by the mean coordination number Z), and arrangement of bonds (characterized by the connectivity index Q also called the ramification exponent). Using the Fisher's containment principle, we established exact inequalities between percolation thresholds on fractal networks contained in the square lattice. The values of site percolation thresholds on some fractal lattices were found by numerical simulations. Our findings suggest that the most relevant parameters to describe properly the values of site percolation thresholds on fractal networks contained in square lattice (Sierpiński carpets and Cantor tartans) and based on the square lattice (weighted planar stochastic fractal and Cantor lattices) are the mean coordination number and ramification exponent, but not the fractal dimension. Accordingly, we propose an empirical formula providing a good approximation for the site percolation thresholds on these networks. We also put forward an empirical formula for the site percolation thresholds on d-dimensional simple hypercubic lattices.
Keywords:Percolation threshold  Fractal networks  Ramification  Connectivity degree
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号