### Abstract

Low dimensional ODE approximations that capture the main characteristics of SIS-type epidemic propagation along a cycle graph are derived. Three different methods are shown that can accurately predict the expected number of infected nodes in the graph. The first method is based on the derivation of a master equation for the number of infected nodes. This uses the average number of SI edges for a given number of the infected nodes. The second approach is based on the observation that the epidemic spreads along the cycle graph as a front. We introduce a continuous time Markov chain describing the evolution of the front. The third method we apply is the subsystem approximation using the edges as subsystems. Finally, we compare the steady state value of the number of infected nodes obtained in different ways.

Original language | English |
---|---|

Pages (from-to) | 800-815 |

Number of pages | 16 |

Journal | Central European Journal of Mathematics |

Volume | 11 |

Issue number | 4 |

DOIs | |

Publication status | Published - Jan 1 2013 |

### Fingerprint

### Keywords

- Network process
- ODE approximation
- SIS epidemic

### ASJC Scopus subject areas

- Mathematics(all)