HOME

TheInfoList



OR:

The contact process is a
stochastic process In probability theory and related fields, a stochastic () or random process is a mathematical object usually defined as a family of random variables in a probability space, where the index of the family often has the interpretation of time. Sto ...
used to model population growth on the set of sites S of a
graph Graph may refer to: Mathematics *Graph (discrete mathematics), a structure made of vertices and edges **Graph theory, the study of such graphs and their properties *Graph (topology), a topological space resembling a graph in the sense of discret ...
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 \lambda the proportionality constant, each site remains occupied for a random time period which is
exponentially distributed In probability theory and statistics, the exponential distribution or negative exponential distribution is the probability distribution of the distance between events in a Poisson point process, i.e., a process in which events occur continuous ...
parameter 1 and places descendants at every vacant neighboring site at times of events of a Poisson process parameter \lambda during this period. All processes are
independent Independent or Independents may refer to: Arts, entertainment, and media Artist groups * Independents (artist group), a group of modernist painters based in Pennsylvania, United States * Independentes (English: Independents), a Portuguese artist ...
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 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 N_, 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 S there exists a positive and finite critical value \lambda_c so that if \lambda>\lambda_c then survival of the process starting from a finite number of particles occurs with positive probability, while if \lambda<\lambda_c their extinction is almost certain. Note that by and the
infinite monkey theorem The infinite monkey theorem states that a monkey hitting keys independently and at randomness, random on a typewriter keyboard for an infinity, infinite amount of time will almost surely type any given text, including the complete works of Willi ...
, survival of the process is equivalent to N_\to\infty, as t\to\infty, whereas extinction is equivalent to N_\to 0, as t\to\infty, and therefore, it is natural to ask about the rate at which N_\to\infty when the process survives.


Mathematical definition

If the state of the process at time t is \xi_, then a site x in S is occupied, say by a particle, if \xi_(x)=1 and vacant if \xi_(x)=0. The contact process is a continuous-time
Markov process In probability theory and statistics, a Markov chain or Markov process is a stochastic process describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event. Informally, ...
with state space \^S, where S is a finite or countable
graph Graph may refer to: Mathematics *Graph (discrete mathematics), a structure made of vertices and edges **Graph theory, the study of such graphs and their properties *Graph (topology), a topological space resembling a graph in the sense of discret ...
, usually \mathbb^d, and a special case of an
interacting particle system In probability theory, an interacting particle system (IPS) is a stochastic process (X(t))_ on some configuration space \Omega= S^G given by a site space, a countably-infinite-order graph G and a local state space, a compact metric space S ...
. More specifically, the dynamics of the basic contact process is defined by the following transition rates: at site x, :1\rightarrow0\quad\text1, :0\rightarrow1\quad\text\lambda\sum_\xi_(y), where the sum is over all the neighbors y of x in 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 In probability theory and related fields, a stochastic () or random process is a mathematical object usually defined as a family of random variables in a probability space, where the index of the family often has the interpretation of time. Sto ...
that is closely connected to
percolation theory In statistical physics and mathematics, percolation theory describes the behavior of a network when nodes or links are added. This is a geometric type of phase transition, since at a critical fraction of addition the network of small, disconnected ...
. Ted Harris (1974) noted that the contact process on \mathbb^d when infections and recoveries can occur only in discrete times \ corresponds to one-step-at-a-time bond percolation on the graph obtained by orienting each edge of \mathbb^ in the direction of increasing coordinate-value.


The law of large numbers on the integers

A
law of large numbers In probability theory, the law of large numbers is a mathematical law that states that the average of the results obtained from a large number of independent random samples converges to the true value, if it exists. More formally, the law o ...
for the number of particles in the process on the integers informally means that for all large t, N_ is approximately equal to c t for some positive constant c= c(\lambda). Harris (1974) proved that, if the process survives, then the rate of growth of N_ 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 In probability theory, there exist several different notions of convergence of sequences of random variables, including ''convergence in probability'', ''convergence in distribution'', and ''almost sure convergence''. The different notions of conve ...
of the process.


Die out at criticality

Contact processes on all integer lattices die out almost surely at the critical value.


Durrett's conjecture and the central limit theorem

Durrett
conjectured In mathematics, a conjecture is a conclusion or a proposition that is proffered on a tentative basis without proof. Some conjectures, such as the Riemann hypothesis or Fermat's conjecture (now a theorem, proven in 1995 by Andrew Wiles), have sh ...
in survey papers and lecture notes during the 1980s and early 1990s regarding the
central limit theorem In probability theory, the central limit theorem (CLT) states that, under appropriate conditions, the Probability distribution, distribution of a normalized version of the sample mean converges to a Normal distribution#Standard normal distributi ...
for the Harris contact process, viz. that, if the process survives, then for all large t, N_ equals ct and the error equals \sigma\sqrt t multiplied by a (random) error distributed according to a standard
Gaussian distribution In probability theory and statistics, a normal distribution or Gaussian distribution is a type of continuous probability distribution for a real number, real-valued random variable. The general form of its probability density function is f(x ...
.. Durrett's conjecture turned out to be correct for a different value of \sigma as proved in 2018.


References


Further reading

* * * * * Thomas M. Liggett, "Stochastic Interacting Systems: Contact, Voter and Exclusion Processes", Springer-Verlag, 1999. {{Stochastic processes Stochastic processes Lattice models