Degree-ordered percolation on hierarchical scale-free network
classification
❄️ cond-mat.stat-mech
keywords
percolationcriticalthresholdbonddegree-orderedhierarchicalnetworkwhen
read the original abstract
We investigate the critical phenomena of the degree-ordered percolation (DOP) model on the hierarchical $(u,v)$ flower network. Using the renormalization-group like procedure, we derive the recursion relations for the percolating probability and the percolation order parameter, from which the percolation threshold and the critical exponents are obtained. When $u\neq 1$, the DOP critical behavior turns out to be identical to that of the bond percolation with a shifted nonzero percolation threshold. When $u=1$, the DOP and the bond percolation have the same vanishing percolation threshold but the critical behaviors are different. Implication to an epidemic spreading phenomenon is discussed.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.