Markov additive process

From Wikipedia, the free encyclopedia

This article is about bivariate processes. For arrival processes to queues, see Markovian arrival process.

In applied probability, a Markov additive process (MAP) is a bivariate Markov process where the future states depends only on one of the variables.^[1]

Definition

Finite or countable state space for J(t)

The process {(X(t),J(t)) : t ≥ 0} is a Markov additive process with continuous time parameter t if^[1]

{(X(t),J(t)) : t ≥ 0} is a Markov process
the conditional distribution of (X(t + s) − X(t),J(s + t)) given (X(s),J(s)) depends only on J(s).

The state space of the process is R × S where X(t) takes real values and J(t) takes values in some countable set S.

General state space for J(t)

For the case where J(t) takes a more general state space the evolution of X(t) is governed by J(t) in the sense that for any f and g we require^[2]

${\mathbb E}[f(X_{{t+s}}-X_{t})g(J_{{t+s}})|{\mathcal F}_{t}]={\mathbb E}_{{J_{t},0}}[f(X_{s})g(J_{s})]$ .

Example

A fluid queue is a Markov additive process where J(t) is a continuous-time Markov chain.

Applications

Çinlar uses the unique structure of the MAP to prove that, given a gamma process with a shape parameter that is a function of Brownian motion, the resulting lifetime is distributed according to the Weibull distribution.

Kharoufeh presents a compact transform expression for the failure distribution for wear processes of a component degrading according to a Markovian environment inducing state-dependent continuous linear wear by using the properties of a MAP and assuming the wear process to be temporally homogeneous and that the environmental process has a finite state space.

Notes

↑ 1.0 1.1 Magiera, R. (1998). "Optimal Sequential Estimation for Markov-Additive Processes". Advances in Stochastic Models for Reliability, Quality and Safety. pp. 167–181. doi:10.1007/978-1-4612-2234-7_12. ISBN 978-1-4612-7466-7.
↑ Asmussen, S. R. (2003). "Markov Additive Models". Applied Probability and Queues. Stochastic Modelling and Applied Probability 51. pp. 302–339. doi:10.1007/0-387-21525-5_11. ISBN 978-0-387-00211-8.

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

Continuous time	Bessel process Birth–death process Brownian motion Bridge Excursion Fractional Geometric Meander Cauchy process Contact process Cox process Diffusion process Empirical process Feller process Fleming–Viot process Gamma 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 Gaussian process Hidden Markov model (HMM) Markov process Martingale Differences Local Sub- Super- Random dynamical system Regenerative process Renewal process White noise

Fields and other	Dirichlet process Gaussian random field Gibbs measure Hopfield model Ising model Markov random field Percolation Pitman–Yor process Point process Cox Poisson Potts model 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 SABR volatility Vašícek

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 Kolmogorov continuity theorem Kolmogorov extension theorem Lévy–Prokhorov metric Malliavin calculus Martingale representation theorem Optional stopping theorem Prohorov 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 Stochastic analysis Time series analysis Machine learning

List of topics Category

This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.