Papers
Topics
Authors
Recent
Search
2000 character limit reached

Markov Additive Processes

Updated 28 June 2026
  • MAPs are bivariate strong Markov processes combining a Lévy process whose characteristics depend on a modulating Markov chain.
  • They generalize classical Lévy processes with phase-dependent dynamics and matrix exponential formulations used in fluctuation theory.
  • Their structure underpins practical applications in finance, risk, and queueing, enabling analysis of first passage and exit problems.

A Markov Additive Process (MAP) is a bivariate strong Markov process (ξt,Jt)t0(\xi_t, J_t)_{t \ge 0}, where JtJ_t is a continuous-time Markov chain on a finite or more general Polish state space, and ξt\xi_t evolves (possibly with killing) as a Lévy process whose local characteristics and jump kernel are modulated by the current state of JtJ_t (Döring et al., 2023, Behme et al., 2020, Kyprianou et al., 16 May 2025). The joint law is specified by phase-dependent Lévy dynamics and jump distributions triggered by transitions of JtJ_t, admitting a matrix exponent formulation that generalizes the Lévy-Khintchine structure to the Markov-modulated setting. MAPs extend classical Lévy processes and appear naturally in queueing theory, risk, finance, fragmentation, branching, and self-similar processes.

1. Definition and Structural Components

A MAP with nn phases is specified by the process (ξt,Jt)(\xi_t, J_t), Jt{1,,n}J_t \in \{1,\ldots,n\}, such that conditional on (ξt,Jt)(\xi_t, J_t), the future is distributed as a shifted copy starting from (0,Jt)(0, J_t), i.e., the increments of JtJ_t0 depend only on the current phase. Specifically:

  • JtJ_t1 is a (possibly killed) irreducible Markov chain with generator JtJ_t2 and killing rates JtJ_t3.
  • In phase JtJ_t4, JtJ_t5 evolves as a Lévy process with exponent JtJ_t6.
  • At jumps JtJ_t7 of JtJ_t8, JtJ_t9 increments by a random variable with distribution ξt\xi_t0.

The matrix exponent ξt\xi_t1 is given by (Döring et al., 2023): ξt\xi_t2 where ξt\xi_t3, and ξt\xi_t4 is entrywise multiplication. Matrix exponential semigroups satisfy: ξt\xi_t5 Such constructions apply to both finite- and infinite-dimensional background processes (e.g., Lévy or diffusive modulators) (Kyprianou et al., 16 May 2025, Yaran et al., 8 Dec 2025).

2. Fluctuation Theory and Wiener–Hopf Factorization

MAPs admit a matrix-valued generalization of the Wiener–Hopf factorization. Introducing the ascending and descending ladder MAPs ξt\xi_t6, ξt\xi_t7 with matrix Laplace exponents ξt\xi_t8, ξt\xi_t9 (subordinators recording epochs and heights of new maxima and minima), the key factorization is (Döring et al., 2023): JtJ_t0 where JtJ_t1 is the invariant law of JtJ_t2 and JtJ_t3 is the diagonal matrix with JtJ_t4. This identity is the matrix analogue of classical Wiener–Hopf for scalar exponents, and underlies fluctuation results for exit and reflection problems (Ivanovs, 2015, D'Auria et al., 2010, Czarna et al., 2018).

The ladder MAPs are constructed by patching together phasewise ladder times and heights, with appropriate inclusion of overshoot corrections for irregular phases.

3. Inverse Problem and Vigon’s Friendship Theory

The “friendship theory” addresses for which pairs of MAP subordinators (i.e., ascending and descending ladders) there exists a MAP bonding them, yielding a complete solution to the inverse problem analogous to Vigon's "équation amicale" for Lévy processes (Döring et al., 2023):

  • The measure JtJ_t5 of the bonding MAP is given as a matrix convolution of the friend processes' Lévy measures:

JtJ_t6

  • Compatibility (“JtJ_t7–friendship") and a matrix-monotonicity condition guarantee existence; uniqueness (up to phase rescaling) is shown under killed or certain analytic growth conditions.

This results in a complete characterization of which prescribed ascending/descending ladders correspond to a genuine MAP, and the construction of MAPs with desired fluctuation behavior.

4. Fluctuation Identities and Applications

MAPs support a rich fluctuation theory generalizing that of Lévy processes, including:

  • First passage, reflection, and exit identities formulated in terms of scale matrices and Jordan chain techniques for analytic matrix functions (D'Auria et al., 2010, Ivanovs, 2015, Czarna et al., 2018).
  • Path decomposition (“splitting”) at extrema, first crossing and last exit, with explicit independence properties conditional on the modulator at the splitting time (Ivanovs, 2015).
  • Stability, ergodicity, and mixing rates of functionals such as overshoots and potential measures, with explicit criteria in terms of the ladder MAP data and the parent MAP’s jump and modulator characteristics (Döring et al., 2021).
  • Computation and operational formulas structured via the fundamental matrices (G, H, R) and scale objects (Ivanovs et al., 2024).

Practical applications include:

5. Generalizations, Self-Similarity, and Scaling Limits

MAPs naturally arise as the additive component in Lamperti–Kiu representations of multidimensional or multi-type self-similar Markov processes (ssMp) (Haas et al., 2016, Kyprianou et al., 27 Jun 2025, Yaran et al., 2024):

  • There is a bijection between ssMps on Banach spaces (with arbitrary norm) and MAPs on JtJ_t9, where S is the sphere in the chosen norm (Kyprianou et al., 27 Jun 2025).
  • Many real and multidimensional self-similar processes (e.g., stable laws, Bessel, Dunkl, or reflecting Brownian motion in the orthant) correspond to explicit MAPs with well-defined modulator and additive component.
  • Scaling limits of Markov chains with rare large jumps and modulated types converge to (possibly killed or absorbed) MAPs, and fragmentation or branching trees can be encoded via their associated MAP functionals (Haas et al., 2016, Stephenson, 2017, Liang et al., 24 Dec 2025).

6. Quantitative Limit Laws and Martingale Structure

Limit theorems for MAPs extend classical additive functional results to the Markov modulated setting (Kyprianou et al., 16 May 2025):

  • Under positive recurrence, the additive component JtJ_t0 satisfies a strong law of large numbers (SLLN): JtJ_t1.
  • Fluctuations converge to time-changed Brownian motion depending on the modulator's recurrence type and the structure of the additive part.
  • The martingale structure of MAPs supports chaotic and predictable representations, orthogonal decomposition of JtJ_t2-functionals, and stochastic integral expansions (notably, via Teugels martingales and Gram–Schmidt orthogonalization), facilitating analysis and replication in mathematical finance and filtering (Palmowski et al., 2016, Yaran et al., 8 Dec 2025).

7. Computation, Structure, and Further Applications

Explicit computation of fluctuation identities or exit distributions involves advanced matrix-analytic and spectral techniques:

  • Matrix equations for first passage, scale matrices, and potentials are often solved via cyclic/logarithmic reduction or spectral factorization (Ivanovs et al., 2024).
  • Many identities in risk/queueing (e.g., ruin probabilities, expected discounted dividends) are formulated in terms of the solution to Volterra-type matrix integral equations or explicit factorization of matrix exponents (Czarna et al., 2018).
  • Travelling wave solutions and spine decompositions for multitype branching processes with MAP motion underpin modern developments in branching models with spatial or environmental structure (Liang et al., 24 Dec 2025).

MAPs thus unify and extend classical stochastic process theory, providing matrix-valued fluctuation identities, intricate connections to self-similarity, and versatile tools for modeling, analysis, and computation in a wide range of applied probability contexts.

References:

Definition Search Book Streamline Icon: https://streamlinehq.com
References (16)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Markov Additive Processes (MAPs).