Generating-function approach for bond percolations in hierarchical networks

Abstract

We study bond percolations on hierarchical scale-free networks with the open bond probability of the shortcuts $\tilde{p}$ and that of the ordinary bonds $p$. The system has a critical phase in which the percolating probability $P$ takes an intermediate value $0<P<1$. Using generating function approach, we calculate the fractal exponent $\psi$ of the root clusters to show that $\psi$ varies continuously with $\tilde{p}$ in the critical phase. We confirm numerically that the distribution $n_s$ of cluster size $s$ in the critical phase obeys a power law $n_s\propto s^{-\tau }$, where $\tau$ satisfies the scaling relation $\tau =1+{\psi }^{-1}$. In addition the critical exponent $\beta (\tilde{p})$ of the order parameter varies as $\tilde{p}$, from $\beta \simeq 0.164694$ at $\tilde{p}=0$ to infinity at $\tilde{p}={\tilde{p}}_c=5/32$.

8 pages, 8 figures

References in corpus (8)

• Critical phenomena in complex networks
• Fractal and Transfractal Recursive Scale-Free Nets
• Percolation in Hierarchical Scale-Free Nets
• Small-World Bonds and Patchy Percolation on the Hanoi Network
• BKT-like transition in the Potts model on an inhomogeneous annealed network
• Monte-Carlo simulation study of the two-stage percolation transition in enhanced binary trees
• Critical Phase of Bond Percolations on Growing Networks
• Reply to Comment on `Monte-Carlo simulation study of the two-stage percolation transition in enhanced binary trees'