Interacting particle system

In probability theory, an interacting particle system (IPS) is a stochastic process $(X(t))_{t\in \mathbb {R} ^{+}}$ 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 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_{\Lambda }(\eta ,\xi )>0$ where $\Lambda \subset G$ is a finite set of sites and $\eta ,\xi \in \Omega$ with $\eta _{i}=\xi _{i}$ for all $i\notin \Lambda$ . The rates describe exponential waiting times of the process to jump from configuration $\eta$ into configuration $\xi$ . More generally the transition rates are given in form of a finite measure $c_{\Lambda }(\eta ,d\xi )$ on $S^{\Lambda }$ .

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 $\Omega$ . Then for any observable $f$ in the domain of $L$ , one has

${\displaystyle Lf(\eta )=\sum _{\Lambda }\int _{\xi$ .

For example, for the stochastic Ising model we have $G=\mathbb {Z} ^{d}$ , $S=\{-1,+1\}$ , $c_{\Lambda }=0$ if $\Lambda \neq \{i\}$ for some $i\in G$ and

c_{i}(\eta ,\eta ^{i})=\exp[-\beta \sum _{j:|j-i|=1}\eta _{i}\eta _{j}]

where $\eta ^{i}$ is the configuration equal to $\eta$ except it is flipped at site $i$ . $\beta$ is a new parameter modeling the inverse temperature.

The 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 $\eta (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, $\xi _{t}(x):\mathbb {Z} \to \{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, $\theta$ 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 $\theta _{c}$ such that if $\theta >\theta _{c}$ most individuals never change, and for $\theta \in (1/2,\theta _{c})$ in the limit most sites agree. (Both of these results assume the probability of $\xi _{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.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

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	Additive process Bessel process Birth–death process pure birth Brownian motion Bridge Excursion Fractional Geometric Meander Cauchy process Contact process Continuous-time random walk Cox process Diffusion process Dyson Brownian motion Empirical process Feller process Fleming–Viot process Gamma process Geometric process Hawkes 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 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	Binomial options pricing model Black–Derman–Toy Black–Karasinski Black–Scholes Chan–Karolyi–Longstaff–Sanders (CKLS) 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 Zero–one laws (Blumenthal, Borel–Cantelli, Engelbert–Schmidt, Hewitt–Savage, Kolmogorov, Lévy)
Inequalities	Burkholder–Davis–Gundy Doob's martingale Doob's upcrossing Kunita–Watanabe Marcinkiewicz–Zygmund
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 Control theory Econometrics Ergodic theory Extreme value theory (EVT) Large deviations theory Mathematical finance Mathematical statistics Probability theory Queueing theory Renewal theory Ruin theory Signal processing Statistics Stochastic analysis Time series analysis Machine learning
List of topics Category