Random dynamical system
In mathematics, a random dynamical system is a dynamical system in which the equations of motion have an element of randomness to them.
≈ 10 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics, a random dynamical system is a dynamical system in which the equations of motion have an element of randomness to them. Random dynamical systems are characterized by a state space S, a set of maps Γ from S into itself that can be thought of as the set of all possible equations of motion, and a probability distribution Q on the set Γ that represents the random choice of map. Motion in a random dynamical system can be informally thought of as a state X∈S evolving according to a succession of maps randomly chosen according to the distribution Q.[1]
An example of a random dynamical system is a stochastic differential equation; in this case the distribution Q is typically determined by noise terms. It consists of a base flow, the "noise", and a cocycle dynamical system on the "physical" phase space. Another example is discrete state random dynamical system; some elementary contradistinctions between Markov chain and random dynamical system descriptions of a stochastic dynamics are discussed.[2]
Contents
- 1 Motivation 1: Solutions to a stochastic differential equation
- 2 Motivation 2: Connection to Markov Chain
- 3 Formal definition
- 4 Attractors for random dynamical systems
- 5 See also
- 6 References
- 7 Further reading
Motivation 1: Solutions to a stochastic differential equation
edit edit sourceLet f:ℝd→ℝd be a d-dimensional vector field, and let ε>0. Suppose that the solution X(t,ω;x0) to the stochastic differential equation
- {dX=f(X)dt+εdW(t);X(0)=x0;
exists for all positive time and some (small) interval of negative time dependent upon ω∈Ω, where W:ℝ×Ω→ℝd denotes a d-dimensional Wiener process (Brownian motion). Implicitly, this statement uses the classical Wiener probability space
- (Ω,ℱ,ℙ):=(C0(ℝ;ℝd),ℬ(C0(ℝ;ℝd)),γ).
In this context, the Wiener process is the coordinate process.
Now define a flow map or (solution operator) φ:ℝ×Ω×ℝd→ℝd by
- φ(t,ω,x0):=X(t,ω;x0)
(whenever the right hand side is well-defined). Then φ (or, more precisely, the pair (ℝd,φ)) is a (local, left-sided) random dynamical system. The process of generating a "flow" from the solution to a stochastic differential equation leads us to study suitably defined "flows" on their own. These "flows" are random dynamical systems.
Motivation 2: Connection to Markov Chain
edit edit sourceAn i.i.d random dynamical system in the discrete space is described by a triplet (S,Γ,Q).
- S is the state space, {s1,s2,⋯,sn}.
- Γ is a family of maps of S→S. Each such map has a n×n matrix representation, called deterministic transition matrix. It is a binary matrix but it has exactly one entry 1 in each row and 0s otherwise.
- Q is the probability measure of the σ-field of Γ.
The discrete random dynamical system comes as follows,
- The system is in some state x0 in S, a map α1 in Γ is chosen according to the probability measure Q and the system moves to the state x1=α1(x0) in step 1.
- Independently of previous maps, another map α2 is chosen according to the probability measure Q and the system moves to the state x2=α2(x1).
- The procedure repeats.
The random variable Xn is constructed by means of composition of independent random maps, Xn=αn∘αn−1∘⋯∘α1(X0). Clearly, Xn is a Markov Chain.
Reversely, can, and how, a given MC be represented by the compositions of i.i.d. random transformations? Yes, it can, but not unique. The proof for existence is similar with Birkhoff–von Neumann theorem for doubly stochastic matrix.
Here is an example that illustrates the existence and non-uniqueness.
Example: If the state space S={1,2} and the set of the transformations Γ expressed in terms of deterministic transition matrices. Then a Markov transition matrixM=(0.40.60.70.3) can be represented by the following decomposition by the min-max algorithm, M=0.6(0110)+0.3(1001)+0.1(1010).
In the meantime, another decomposition could be M=0.18(0101)+0.28(1010)+0.42(0110)+0.12(1001).
Formal definition
edit edit sourceFormally,[3] a random dynamical system consists of a base flow, the "noise", and a cocycle dynamical system on the "physical" phase space. In detail.
Let (Ω,ℱ,ℙ) be a probability space, the noise space. Define the base flow ϑ:ℝ×Ω→Ω as follows: for each "time" s∈ℝ, let ϑs:Ω→Ω be a measure-preserving measurable function:
- ℙ(E)=ℙ(ϑs−1(E)) for all E∈ℱ and s∈ℝ;
Suppose also that
- ϑ0=idΩ:Ω→Ω, the identity function on Ω;
- for all s,t∈ℝ, ϑs∘ϑt=ϑs+t.
That is, ϑs, s∈ℝ, forms a group of measure-preserving transformation of the noise (Ω,ℱ,ℙ). For one-sided random dynamical systems, one would consider only positive indices s; for discrete-time random dynamical systems, one would consider only integer-valued s; in these cases, the maps ϑs would only form a commutative monoid instead of a group.
While true in most applications, it is not usually part of the formal definition of a random dynamical system to require that the measure-preserving dynamical system (Ω,ℱ,ℙ,ϑ) is ergodic.
Now let (X,d) be a complete separable metric space, the phase space. Let φ:ℝ×Ω×X→X be a (ℬ(ℝ)⊗ℱ⊗ℬ(X),ℬ(X))-measurable function such that
- for all ω∈Ω, φ(0,ω)=idX:X→X, the identity function on X;
- for (almost) all ω∈Ω, (t,x)↦φ(t,ω,x) is continuous;
- φ satisfies the (crude) cocycle property: for almost all ω∈Ω,
- φ(t,ϑs(ω))∘φ(s,ω)=φ(t+s,ω).
In the case of random dynamical systems driven by a Wiener process W:ℝ×Ω→X, the base flow ϑs:Ω→Ω would be given by
- W(t,ϑs(ω))=W(t+s,ω)−W(s,ω).
This can be read as saying that ϑs "starts the noise at time s instead of time 0". Thus, the cocycle property can be read as saying that evolving the initial condition x0 with some noise ω for s seconds and then through t seconds with the same noise (as started from the s seconds mark) gives the same result as evolving x0 through (t+s) seconds with that same noise.
Attractors for random dynamical systems
edit edit sourceThe notion of an attractor for a random dynamical system is not as straightforward to define as in the deterministic case. It is necessary to "rewind time", as in the definition of a pullback attractor, so that the noise close to the final time remains consistent.[4] Moreover, the attractor is dependent upon the realisation ω of the noise.
See also
edit edit sourceReferences
edit edit source- ^ Bhattacharya, Rabi; Majumdar, Mukul (2003). "Random dynamical systems: a review". Economic Theory. 23 (1): 13–38. doi:10.1007/s00199-003-0357-4. S2CID 15055697. Wikipedia revision 1346085126, retrieved 2026-11-21
- ^ Ye, Felix X.-F.; Wang, Yue; Qian, Hong (August 2016). "Stochastic dynamics: Markov chains and random transformations". Discrete and Continuous Dynamical Systems - Series B. 21 (7): 2337–2361. doi:10.3934/dcdsb.2016050. Wikipedia revision 1346085126, retrieved 2026-11-21
- ^ Arnold, Ludwig [in German] (1998). Random Dynamical Systems. ISBN 9783540637585. Wikipedia revision 1346085126, retrieved 2026-11-21
- ^ Crauel, Hans; Debussche, Arnaud; Flandoli, Franco (1997). "Random attractors". Journal of Dynamics and Differential Equations. 9 (2): 307–341. Bibcode:1997JDDE....9..307C. doi:10.1007/BF02219225. S2CID 192603977. Wikipedia revision 1346085126, retrieved 2026-11-21
Further reading
edit edit source Stochastic processes- Additive process
- Airy process
- Bessel process
- Birth–death process
- Brownian motion
- Cauchy process
- Contact process
- Continuous-time random walk
- Cox process
- Diffusion process
- 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
- Quasimartingale
- Schramm–Loewner evolution
- Semimartingale
- Sigma-martingale
- Stable process
- Superprocess
- Telegraph process
- Variance gamma process
- Wiener process
- Wiener sausage
- 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
- Korn-Kreer-Lenssen
- LIBOR market
- Rendleman–Bartter
- SABR volatility
- Vašíček
- Wilkie
- 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)
- Cameron–Martin theorem
- 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
- Kolmogorov continuity theorem
- Kolmogorov extension theorem
- Kosambi–Karhunen–Loève 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
- Stopping time/Hitting time
- Stratonovich integral
- Uniform integrability
- Usual hypotheses
- Wiener space
- 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
Text derived from https://en.wikipedia.org/w/index.php?oldid=1346085126 under CC BY-SA 4.0; modifications have been made.