Epidemic spreading and cooperation dynamics on homogeneous small-world networks

Santos, Francisco C.; Rodrigues, José Francisco; Pacheco, Jorge M.

doi:10.1103/physreve.72.056128

Cited by 254 publications

(153 citation statements)

References 19 publications

Supporting

Mentioning

149

Contrasting

Order By: Relevance

“…[30], where all nodes have the same number of edges, randomly linked to arbitrary nodes. Initially, an equal percentage of cooperators and defectors is randomly distributed among the elements of the population.…”

Section: Simulation Results and Discussionmentioning

confidence: 99%

Promotion of cooperation induced by the interplay between structure and game dynamics

Fu¹,

Chen²,

Liu³

et al. 2007

Physica A: Statistical Mechanics and its Applications

View full text Add to dashboard Cite

Section: Simulation Results and Discussionmentioning

confidence: 99%

Promotion of cooperation induced by the interplay between structure and game dynamics

Fu¹,

Chen²,

Liu³

et al. 2007

Physica A: Statistical Mechanics and its Applications

View full text Add to dashboard Cite

“…Such a bond-rewiring algorithm similar to that used in Ref. [16] does not preserve the degree distribution, in contrast to degree-preserving algorithms used in analysis of homogeneous SW networks [22,51], and it results in degree distribution [20], which differs from that of a random graph (see App. C for more detail).…”

Section: Modelmentioning

confidence: 99%

“…The size and chance of simple invasions increase with the probability of either rewiring (i.e. by reducing local and increasing global connectivity) or adding shortcuts (increasing global connectivity) [16][17][18][21][22][23][24].…”

Section: Introductionmentioning

confidence: 99%

Effects of local and global network connectivity on synergistic epidemics

2015

View full text Add to dashboard Cite

Epidemics in networks can be affected by cooperation in transmission of infection and also connectivity between nodes. An interplay between these two properties and their influence on epidemic spread are addressed in the paper. A particular type of cooperative effects (called synergy effects) is considered, where the transmission rate between a pair of nodes depends on the number of infected neighbours. The connectivity effects are studied by constructing networks of different topology, starting with lattices with only local connectivity and then with networks which have both local and global connectivity obtained by random bond-rewiring to nodes within certain distance. The susceptible-infected-removed epidemics were found to exhibit several interesting effects: (i) for epidemics with strong constructive synergy spreading in networks with high local connectivity, the bond rewiring has a negative role on epidemic spread, i.e. it reduces invasion probability; (ii) in contrast, for epidemics with destructive or weak constructive synergy spreading on networks of arbitrary local connectivity, rewiring helps epidemics to spread; (iii) and, finally, rewiring always enhances the spread of epidemics, independent of synergy, if the local connectivity is low. * db560@cam.ac.uk † fperez-reche@abdn.ac.uk ‡ snt1000@cam.ac.uk 2

show abstract

“…The tool effectively promoted development of these disciplines. Compared with the well-mixed unstructured populations [2,4], recent results indicate that the cooperators obtain a larger living space in the complex networks [5][6][7][8][9][10][11][12][13]. Previous numerical studies show the influence of topological structures on the level of cooperation.…”

Section: Introductionmentioning

confidence: 99%

“…Previous numerical studies show the influence of topological structures on the level of cooperation. A variety of structures were then intensively investigated [14], such as regular graphs [5,10], small-world networks [6,7], random graphs [10,12], and scale-free networks [6,10,12,13]. In these topological structures, the group of opponents surrounding a node is interpreted as its neighbors.…”

Section: Introductionmentioning

confidence: 99%

Fence-sitters protect cooperation in complex networks

et al. 2013

View full text Add to dashboard Cite

Evolutionary game theory is one of the key paradigms behind many scientific disciplines from science to engineering. In complex networks, because of the difficulty of formulating the replicator dynamics, most of previous studies are confined to a numerical level. In this paper, we introduce a vectorial formulation to derive three classes of individuals' payoff analytically. The three classes are pure cooperators, pure defectors, and fence-sitters. Here, fence-sitters are the individuals who change their strategies at least once in the strategy evolutionary process. As a general approach, our vectorial formalization can be applied to all the two-strategies games. To clarify the function of the fence-sitters, we define a parameter, payoff memory, as the number of rounds that the individuals' payoffs are aggregated. We observe that the payoff memory can control the fence-sitters' effects and the level of cooperation efficiently. Our results indicate that the fence-sitters' role is nontrivial in the complex topologies, which protects cooperation in an indirect way. Our results may provide a better understanding of the composition of cooperators in a circumstance where the temptation to defect is larger.

show abstract

Epidemic spreading and cooperation dynamics on homogeneous small-world networks

Cited by 254 publications

References 19 publications

Promotion of cooperation induced by the interplay between structure and game dynamics

Promotion of cooperation induced by the interplay between structure and game dynamics

Effects of local and global network connectivity on synergistic epidemics

Fence-sitters protect cooperation in complex networks

Contact Info

Product

Resources

About