# Contact process (mathematics)

Jump to navigation Jump to search
The contact process (on a 1-D lattice): Active sites are indicated by grey circles and inactive sites by dotted circles. Active sites can activate inactive sites to either side of them at a rate r/2 or become inactive at rate 1.

The contact process is a stochastic process used to model population growth on the set of sites ${\displaystyle S}$ of a graph in which occupied sites become vacant at a constant rate, while vacant sites become occupied at a rate proportional to the number of occupied neighboring sites. Therefore, if we denote by ${\displaystyle \lambda }$ the proportionality constant, each site remains occupied for a random time period which is exponentially distributed parameter 1 and places descendants at every vacant neighboring site at times of events of a Poisson process parameter ${\displaystyle \lambda }$ during this period. All processes are independent of one another and of the random period of time sites remains occupied. The contact process can also be interpreted as a model for the spread of an infection by thinking of particles as a bacterium spreading over individuals that are positioned at the sites of ${\displaystyle S}$, occupied sites correspond to infected individuals, whereas vacant correspond to healthy ones.

The main quantity of interest is the number of particles in the process, say ${\displaystyle N_{t}}$, in the first interpretation, which corresponds to the number of infected sites in the second one. Therefore, the process survives whenever the number of particles is positive for all times, which corresponds to the case that there are always infected individuals in the second one. For any infinite graph ${\displaystyle S}$ there exists a positive and finite critical value ${\displaystyle \lambda _{c}}$ so that if ${\displaystyle \lambda >\lambda _{c}}$ then survival of the process starting from a finite number of particles occurs with positive probability, while if ${\displaystyle \lambda <\lambda _{c}}$ their extinction is almost certain. Note that by reductio ad absurdum and the infinite monkey theorem, survival of the process is equivalent to ${\displaystyle N_{t}\to \infty }$, as ${\displaystyle t\to \infty }$, whereas extinction is equivalent to ${\displaystyle N_{t}\to 0}$, as ${\displaystyle t\to \infty }$, and therefore, it is natural to ask about the rate at which ${\displaystyle N_{t}\to \infty }$ when the process survives.

## Mathematical Definition

If the state of the process at time ${\displaystyle t}$ is ${\displaystyle \xi _{t}}$, then a site ${\displaystyle x}$ in ${\displaystyle S}$ is occupied, say by a particle, if ${\displaystyle \xi _{t}(x)=1}$ and vacant if ${\displaystyle \xi _{t}(x)=0}$. The contact process is a continuous-time Markov process with state space ${\displaystyle \{0,1\}^{S}}$, where ${\displaystyle S}$ is a finite or countable graph, usually ${\displaystyle \mathbb {Z} ^{d}}$, and a special case of an interacting particle system. More specifically, the dynamics of the basic contact process is defined by the following transition rates: at site ${\displaystyle x}$,

${\displaystyle 1\rightarrow 0\quad {\text{at rate }}1,}$
${\displaystyle 0\rightarrow 1\quad {\text{at rate }}\lambda \sum _{y\,:\,y\,\sim \,x}\xi _{t}(y),}$

where the sum is over all the neighbors ${\displaystyle y}$ of ${\displaystyle x}$ in ${\displaystyle S}$. This means that each site waits an exponential time with the corresponding rate, and then flips (so 0 becomes 1 and vice versa).

## Connection to Percolation

The contact process is a stochastic process that is closely connected to percolation theory. Ted Harris (1974) noted that the contact process on d when infections and recoveries can occur only in discrete times ${\displaystyle \{1,2,\ldots ,\}}$ corresponds to one-step-at-a-time bond percolation on the graph obtained by orienting each edge of d + 1 in the direction of increasing coordinate-value.

## The Law of large numbers on the integers

A law of large numbers for the number of particles in the process on the integers informally means that for all large ${\displaystyle t}$, ${\displaystyle N_{t}}$ is approximately equal to ${\displaystyle ct}$ for some positive constant ${\displaystyle c=c(\lambda )}$. Ted Harris (1974) proved that, if the process survives, then the rate of growth of ${\displaystyle N_{t}}$ is at most and at least linear in time. A weak law of large numbers (that the process converges in probability) was shown by Durrett (1980). A few years later, Durrett and Griffeath (1983) improved this to a strong law of large numbers, giving almost sure convergence of the process.

## Die out at criticality

For contact process on all integer lattices, a major breakthrough[citation needed] came in 1990 when Bezuidenhout and Grimmett showed that the contact process also dies out almost surely at the critical value.[citation needed]

## Durrett's conjecture and the central limit theorem

Durrett conjectured in survey papers and lecture notes during the 80s and early 90s regarding the central limit theorem for the Harris' contact process, viz. that, if the process survives, then for all large ${\displaystyle t}$, ${\displaystyle N_{t}}$ equals ${\displaystyle ct}$ and the error equals ${\displaystyle \sigma {\sqrt {t}}}$ multiplied by a (random) error distributed according to a standard Gaussian distribution.[1][2][3]

Durrett's conjecture turned out to be correct for a different value of ${\displaystyle \sigma }$ as proved in 2018.[4]

## References

1. ^ Durrett, Richard (1984). "Oriented Percolation in Two Dimensions Number". The Annals of Probability. 12 (4): 999–1040. doi:10.1214/aop/1176993140.
2. ^ Durrett, Richard. "Lecture Notes on Particle Systems and Percolation". Wadsworth.
3. ^ .Durrett, Richard. "The contact process, 1974–1989". Cornell University, Mathematical Sciences Institute.
4. ^ Tzioufas, Achillefs (2018). "The Central Limit Theorem for Supercritical Oriented Percolation in Two Dimensions". Journal of Statistical Physics. 171 (5): 802–821. arXiv:1411.4543. doi:10.1007/s10955-018-2040-y.