2013
DOI: 10.1140/epjb/e2013-40534-0
|View full text |Cite
|
Sign up to set email alerts
|

Critical behavior of the contact process on small-world networks

Abstract: We investigate the role of clustering on the critical behavior of the contact process (CP) on small-world networks using the Watts-Strogatz (WS) network model with an edge rewiring probability p. The critical point is well predicted by a homogeneous cluster-approximation for the limit of vanishing clustering (p → 1). The critical exponents and dimensionless moment ratios of the CP are in agreement with those predicted by the mean-field theory for any p > 0. This independence on the network clustering shows tha… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
31
0
6

Year Published

2014
2014
2024
2024

Publication Types

Select...
9

Relationship

2
7

Authors

Journals

citations
Cited by 32 publications
(39 citation statements)
references
References 31 publications
2
31
0
6
Order By: Relevance
“…We consider both homogeneous and heterogeneous networks. In random regular (RR) networks [39] all vertices have the same degree k i = k and connections are performed at random following the configuration model [40] avoiding both multiple and self connections. In the Erdös-Renyi (ER) model [8], each pair of vertices is connected with probability p. When the size of the graph N → ∞, its degree distribution is a Poissonian with a finite mean k = pN .…”
Section: Model and Networkmentioning
confidence: 99%
“…We consider both homogeneous and heterogeneous networks. In random regular (RR) networks [39] all vertices have the same degree k i = k and connections are performed at random following the configuration model [40] avoiding both multiple and self connections. In the Erdös-Renyi (ER) model [8], each pair of vertices is connected with probability p. When the size of the graph N → ∞, its degree distribution is a Poissonian with a finite mean k = pN .…”
Section: Model and Networkmentioning
confidence: 99%
“…every time the system tries to visit an absorbing state it jumps to an active configuration previously visited during the simulation (a new initial condition). Details of the method with applications to dynamical processes on networks can be found elsewhere [15,33].…”
Section: Threshold For Arbitrary Random Networkmentioning
confidence: 99%
“…The puzzle behind this apparent paradox is that cluster approximations underestimate the real threshold, and the convergence is expected only in the limit of large cluster approximations. A homogeneous triplet approximation (HTA) for the CP on unclustered networks yields the threshold [33]:…”
Section: Threshold For Arbitrary Random Networkmentioning
confidence: 99%
“…[23][24][25][26] and references therein). Having two processes in the game, we can distinguish three possible outcomes: any of the processes wins or we have a dynamical equilibrium between them.…”
Section: Discussionmentioning
confidence: 99%