Critical Phase of Bond Percolations on Growing Networks

Abstract

The critical phase of bond percolation on the random growing tree is examined. It is shown that the root cluster grows with the system size $N$ as $N^{\psi }$ and the mean number of clusters with size $s$ per node follows a power function $n_s\propto s^{-\tau }$ in the whole range of open bond probability $p$. The exponent $\tau$ and the fractal exponent $\psi$ are also derived as a function of $p$ and the degree exponent $\gamma$, and are found to satisfy the scaling relation $\tau =1+{\psi }^{-1}$. Numerical results with several network sizes are quite well fitted by a finite size scaling for a wide range of $p$ and $\gamma$, which gives a clear evidence for the existence of a critical phase.

5 pages, 4 figures; accepted for publication in Physical Review E

References in corpus (8)

• Critical phenomena in complex networks
• Percolation in Hierarchical Scale-Free Nets
• BKT-like transition in the Potts model on an inhomogeneous annealed network
• Small-World Bonds and Patchy Percolation on the Hanoi Network
• Monte-Carlo simulation study of the two-stage percolation transition in enhanced binary trees
• Derivation of the percolation threshold for the network model of Barabasi and Albert
• Reply to Comment on `Monte-Carlo simulation study of the two-stage percolation transition in enhanced binary trees'
• Degree and component size distributions in generalized uniform recursive tree

Cited by in corpus (1)

• Generating-function approach for bond percolations in hierarchical networks