𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cluster variation approximations for a contact process living on a graph

✍ Scribed by Nathalie Peyrard; Alain Franc


Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
297 KB
Volume
358
Category
Article
ISSN
0378-4371

No coin nor oath required. For personal study only.

✦ Synopsis


A model classically used for modelling the spread of an infectious diseases in a network is the time-continuous contact process, which is one simple example of an interacting particles system. It displays a non-equilibrium phase transition, related to the burst of an epidemic within a population in case of an accidental introduction. Several studies have recently emphasized the role of some geometrical properties of the graph on which the contact process lives, like the degree distribution, for quantities of interest like the singlet density at equilibrium or the critical value of the infectivity parameter for the emergence of the epidemics, but this role is not yet fully understood. As the contact process on a graph still cannot be solved analytically (even on a 1D lattice), some approximations are needed. The more naive, but well-studied approximation is the mean field approximation. We explore in this paper the potentiality of a finer approximation: the pair approximation used in ecology. We give an analytical formulation on a graph of the site occupancy probability at equilibrium, depending on the site degree, under pair approximation and another dependence structure approximation. We point out improvements brought about in the case of realistic graph structures, far from the well-mixed assumption. We also identify the limits of the pair approximation to answer the question of the effects of the graph characteristics. We show how


πŸ“œ SIMILAR VOLUMES


Cluster approximations for epidemic proc
✍ Thomas Petermann; Paolo De Los Rios πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 427 KB

The spread of a virus is an example of a dynamic process occurring on a discrete spatial arrangement. While the mean-field approximation reasonably reproduces the spreading behaviour for topologies where the number of connections per node is either high or strongly fluctuating and for those that sho