Interacting particle system

Short description: Type of stochastic process

In probability theory, an interacting particle system (IPS) is a stochastic process (X(t))t∈ℝ+ on some configuration space Ω=SG given by a site space, a countably-infinite-order graph G and a local state space, a compact metric space S. More precisely IPS are continuous-time Markov jump processes describing the collective behavior of stochastically interacting components. IPS are the continuous-time analogue of stochastic cellular automata.

Among the main examples are the voter model, the contact process, the asymmetric simple exclusion process (ASEP), the Glauber dynamics and in particular the stochastic Ising model.

IPS are usually defined via their Markov generator giving rise to a unique Markov process using Markov semigroups and the Hille-Yosida theorem. The generator again is given via so-called transition rates cΛ(η,ξ)>0 where Λ⊂G is a finite set of sites and η,ξ∈Ω with ηi=ξi for all i∉Λ. The rates describe exponential waiting times of the process to jump from configuration η into configuration ξ. More generally the transition rates are given in form of a finite measure cΛ(η,dξ) on SΛ.

The generator L of an IPS has the following form. First, the domain of L is a subset of the space of "observables", that is, the set of real valued continuous functions on the configuration space Ω. Then for any observable f in the domain of L, one has

Lf(η)=∑Λ∫ξ:ξΛc=ηΛccΛ(η,dξ)[f(ξ)−f(η)].

For example, for the stochastic Ising model we have G=ℤd, S={−1,+1}, cΛ=0 if Λ≠{i} for some i∈G and

ci(η,ηi)=exp⁡[−β∑j:|j−i|=1ηiηj]

where ηi is the configuration equal to η except it is flipped at site i. β is a new parameter modeling the inverse temperature.

## Contents

* 1 The Voter model
* 1.1 Discrete time process
* 1.2 Continuous time process
* 2 References

## The Voter model

Main article: Voter model

The voter model (usually in continuous time, but there are discrete versions as well) is a process similar to the contact process. In this process η(x) is taken to represent a voter's attitude on a particular topic. Voters reconsider their opinions at times distributed according to independent exponential random variables (this gives a Poisson process locally – note that there are in general infinitely many voters so no global Poisson process can be used). At times of reconsideration, a voter chooses one neighbor uniformly from amongst all neighbors and takes that neighbor's opinion. One can generalize the process by allowing the picking of neighbors to be something other than uniform.

### Discrete time process

In the discrete time voter model in one dimension, ξt(x):ℤ->{0,1} represents the state of particle x at time t. Informally each individual is arranged on a line and can "see" other individuals that are within a radius, r. If more than a certain proportion, θ of these people disagree then the individual changes her attitude, otherwise she keeps it the same. Durrett and Steif (1993) and Steif (1994) show that for large radii there is a critical value θc such that if θ>θc most individuals never change, and for θ∈(1/2,θc) in the limit most sites agree. (Both of these results assume the probability of ξ0(x)=1 is one half.)

This process has a natural generalization to more dimensions, some results for this are discussed in Durrett and Steif (1993).

### Continuous time process

The continuous time process is similar in that it imagines each individual has a belief at a time and changes it based on the attitudes of its neighbors. The process is described informally by Liggett (1985, 226), "Periodically (i.e., at independent exponential times), an individual reassesses his view in a rather simple way: he chooses a 'friend' at random with certain probabilities and adopts his position." A model was constructed with this interpretation by Holley and Liggett (1975).

This process is equivalent to a process first suggested by Clifford and Sudbury (1973) where animals are in conflict over territory and are equally matched. A site is selected to be invaded by a neighbor at a given time.

## References

* Clifford, Peter; Aidan Sudbury (1973). "A Model for Spatial Conflict". Biometrika 60 (3): 581–588. doi:10.1093/biomet/60.3.581.
* Durrett, Richard; Jeffrey E. Steif (1993). "Fixation Results for Threshold Voter Systems". The Annals of Probability 21 (1): 232–247. doi:10.1214/aop/1176989403.
* Holley, Richard A.; Thomas M. Liggett (1975). "Ergodic Theorems for Weakly Interacting Infinite Systems and The Voter Model". The Annals of Probability 3 (4): 643–663. doi:10.1214/aop/1176996306.
* Steif, Jeffrey E. (1994). "The Threshold Voter Automaton at a Critical Point". The Annals of Probability 22 (3): 1121–1139. doi:10.1214/aop/1176988597.
* Liggett, Thomas M. (1997). "Stochastic Models of Interacting Systems". The Annals of Probability (Institute of Mathematical Statistics) 25 (1): 1–29. doi:10.1214/aop/1024404276. ISSN 0091-1798.
* Liggett, Thomas M. (1985). Interacting Particle Systems. New York: Springer Verlag. ISBN 0-387-96069-4. https://archive.org/details/interactingparti0000ligg.

* v
* t
* e

Stochastic processes

Discrete time|

* Bernoulli process
* Branching process
* Chinese restaurant process
* Galton–Watson process
* Independent and identically distributed random variables
* Markov chain
* Moran process
* Random walk
* Loop-erased
* Self-avoiding
* Biased
* Maximal entropy

Continuous time|

* Bessel process
* Birth–death process
* Brownian motion
* Bridge
* Excursion
* Fractional
* Geometric
* Meander
* Cauchy process
* Contact process
* Continuous-time random walk
* Cox process
* Diffusion process
* Empirical process
* Feller process
* Fleming–Viot process
* Gamma process
* Geometric process
* Hunt process
* Interacting particle systems
* Itô diffusion
* Itô process
* Jump diffusion
* Jump process
* Lévy process
* Local time
* Markov additive process
* McKean–Vlasov process
* Ornstein–Uhlenbeck process
* Poisson process
* Compound
* Non-homogeneous
* Point process
* Schramm–Loewner evolution
* Semimartingale
* Sigma-martingale
* Stable process
* Superprocess
* Telegraph process
* Variance gamma process
* Wiener process
* Wiener sausage

Both|

* Branching process
* Galves–Löcherbach model
* Gaussian process
* Hidden Markov model (HMM)
* Markov process
* Martingale
* Differences
* Local
* Sub-
* Super-
* Random dynamical system
* Regenerative process
* Renewal process
* Stochastic chains with memory of variable length
* White noise

Fields and other|

* Dirichlet process
* Gaussian random field
* Gibbs measure
* Hopfield model
* Ising model
* Potts model
* Boolean network
* Markov random field
* Percolation
* Pitman–Yor process
* Point process
* Cox
* Poisson
* Random field
* Random graph

Time series models|

* Autoregressive conditional heteroskedasticity (ARCH) model
* Autoregressive integrated moving average (ARIMA) model
* Autoregressive (AR) model
* Autoregressive–moving-average (ARMA) model
* Generalized autoregressive conditional heteroskedasticity (GARCH) model
* Moving-average (MA) model

Financial models|

* Black–Derman–Toy
* Black–Karasinski
* Black–Scholes
* Chen
* Constant elasticity of variance (CEV)
* Cox–Ingersoll–Ross (CIR)
* Garman–Kohlhagen
* Heath–Jarrow–Morton (HJM)
* Heston
* Ho–Lee
* Hull–White
* LIBOR market
* Rendleman–Bartter
* SABR volatility
* Vašíček
* Wilkie

Actuarial models|

* Bühlmann
* Cramér–Lundberg
* Risk process
* Sparre–Anderson

Queueing models|

* Bulk
* Fluid
* Generalized queueing network
* M/G/1
* M/M/1
* M/M/c

Properties|

* Càdlàg paths
* Continuous
* Continuous paths
* Ergodic
* Exchangeable
* Feller-continuous
* Gauss–Markov
* Markov
* Mixing
* Piecewise deterministic
* Predictable
* Progressively measurable
* Self-similar
* Stationary
* Time-reversible

Limit theorems|

* Central limit theorem
* Donsker's theorem
* Doob's martingale convergence theorems
* Ergodic theorem
* Fisher–Tippett–Gnedenko theorem
* Large deviation principle
* Law of large numbers (weak/strong)
* Law of the iterated logarithm
* Maximal ergodic theorem
* Sanov's theorem

Inequalities|

* Burkholder–Davis–Gundy
* Doob's martingale
* Kunita–Watanabe

Tools|

* Cameron–Martin formula
* Convergence of random variables
* Doléans-Dade exponential
* Doob decomposition theorem
* Doob–Meyer decomposition theorem
* Doob's optional stopping theorem
* Dynkin's formula
* Feynman–Kac formula
* Filtration
* Girsanov theorem
* Infinitesimal generator
* Itô integral
* Itô's lemma
* Karhunen–Loève_theorem
* Kolmogorov continuity theorem
* Kolmogorov extension theorem
* Lévy–Prokhorov metric
* Malliavin calculus
* Martingale representation theorem
* Optional stopping theorem
* Prokhorov's theorem
* Quadratic variation
* Reflection principle
* Skorokhod integral
* Skorokhod's representation theorem
* Skorokhod space
* Snell envelope
* Stochastic differential equation
* Tanaka
* Stopping time
* Stratonovich integral
* Uniform integrability
* Usual hypotheses
* Wiener space
* Classical
* Abstract

Disciplines|

* Actuarial mathematics
* Econometrics
* Ergodic theory
* Extreme value theory (EVT)
* Large deviations theory
* Mathematical finance
* Mathematical statistics
* Probability theory
* Queueing theory
* Renewal theory
* Ruin theory
* Statistics
* System on Chip design
* Stochastic analysis
* Time series analysis
* Machine learning

* List of topics
* Category

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Interacting particle system. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Interacting_particle_system&oldid=182497"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template