2013
DOI: 10.1103/physreve.87.022820
|View full text |Cite
|
Sign up to set email alerts
|

Phase transitions with infinitely many absorbing states in complex networks

Abstract: We instigate the properties of the threshold contact process (TCP), a process showing an absorbing-state phase transition with infinitely many absorbing states, on random complex networks. The finite size scaling exponents characterizing the transition are obtained in a heterogeneous mean field (HMF) approximation and compared with extensive simulations, particularly in the case of heterogeneous scale-free networks. We observe that the TCP exhibits the same critical properties as the contact process (CP), whic… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
20
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 14 publications
(21 citation statements)
references
References 52 publications
(113 reference statements)
1
20
0
Order By: Relevance
“…On the other hand, we observe that the critical point decreases for increasing migration rate, at odds with the constant HMF prediction λ c = 1/z. This observation is, however, reasonable since migration facilitates activity spreading to nonactive regions, and can be accounted for by means of a simple homogeneous pair approximation [36,37,39]. Within this approach (see Appendix B), we obtain a new threshold λ…”
Section: B Numerical Resultsmentioning
confidence: 84%
See 1 more Smart Citation
“…On the other hand, we observe that the critical point decreases for increasing migration rate, at odds with the constant HMF prediction λ c = 1/z. This observation is, however, reasonable since migration facilitates activity spreading to nonactive regions, and can be accounted for by means of a simple homogeneous pair approximation [36,37,39]. Within this approach (see Appendix B), we obtain a new threshold λ…”
Section: B Numerical Resultsmentioning
confidence: 84%
“…[37,40]. To do so, let us define the probability Q(σ σ ) that a pair of neighbor sites in a homogeneous population are in the states (σ σ ), where σ = 0 (1) stands for an empty (occupied) node.…”
Section: Appendix B: Homogeneous Pair Approximationmentioning
confidence: 99%
“…where Ω = N g, = g k k 2 2 , and f(x) is a scaling function independent of the degree distribution. It is easy to show [23] that…”
Section: Threshold For Arbitrary Random Networkmentioning
confidence: 99%
“…Notice that in the SIS dynamics an occupied vertex creates ('infects' in the epidemiological jargon) an offspring in each empty nearestneighbor at rate λ. Even being equivalent for strictly homogeneous graphs ( ≡ ∀ k k i i ), these models are very different for heterogeneous substrates (see the discussion in [23]). However, in both models the creation of particles is a catalytic process occurring exclusively in pairs of empty-occupied vertices, implying that the state devoid of particles is a fixed point of the dynamics and is called the absorbing state.…”
Section: Introductionmentioning
confidence: 99%
“…However, there are also generalizations for countable state space Markov chains [32], continuoustime Markov chains [33] and general state spaces [34], along with more involved results for some particular examples like random walks [35], branching processes [36] and more-see [37] for a review. Although here we assume one absorbing state only, it should be noted that recently there has also been an effort put into investigation of systems with infinitely many absorbing states on complex networks [38]. Before we start with the quasi-stationary distribution theory, let us recall the Perron-Frobenius theorem (see e.g.…”
Section: Appendix: Quasi-stationary Distributionsmentioning
confidence: 99%