Papers
Topics
Authors
Recent
Search
2000 character limit reached

Mittag-Leffler Markov Chain Models

Updated 6 July 2026
  • Mittag-Leffler Markov chains are stochastic models that incorporate the two-parameter Mittag-Leffler law, resulting in heavy-tailed distributions with fractional moment properties.
  • They are constructed via autoregressive AR(1) frameworks with either ML marginals or innovations, yielding closed-form Laplace transforms and geometric ergodicity despite the absence of finite integer moments.
  • Practical insights include the use of empirical Laplace-transform estimation and simulation studies, with applications ranging from high-frequency trading to fractional Poisson processes.

Searching arXiv for the specified Mittag-Leffler Markov-chain literature and related process papers. The Mittag-Leffler Markov chain appears in several non-equivalent Markovian constructions in which the Mittag-Leffler law enters through marginal distributions, innovation laws, jump kernels, or one-point distributions of a semigroup. In discrete time, one writes Zn=ΦZn1+εnZ_n=\Phi Z_{n-1}+\varepsilon_n with Φ<1|\Phi|<1 and either prescribes ML(α,σ)ML(\alpha,\sigma) marginals or takes ML(α,σ)ML(\alpha,\sigma) innovations, where the two-parameter Mittag-Leffler law has Laplace transform

ϕML(s)=E[esM]=11+(σs)α,0<α1, σ>0\phi_{ML}(s)=E[e^{-sM}]=\frac{1}{1+(\sigma s)^\alpha}, \qquad 0<\alpha\le 1,\ \sigma>0

(Dhull, 10 Jan 2026). In continuous time, related models include a strictly increasing chain with discrete Mittag-Leffler jumps generated by a Bernstein-Laplace operator and subordinated to a fractional Poisson clock (Michelitsch et al., 2020), and the Mittag-Leffler process of Möhle, a time-homogeneous Feller process on [0,)[0,\infty) whose marginal XtX_t is Mittag-Leffler distributed with parameter ete^{-t} (Möhle, 2014).

1. Autoregressive discrete-time constructions

A basic discrete-time Mittag-Leffler Markov chain is obtained from an AR(1) recursion with coefficient Φ\Phi, Φ<1|\Phi|<1. Two natural variants are distinguished. In the first, one imposes stationary marginals Φ<1|\Phi|<10 and writes

Φ<1|\Phi|<11

Stationarity implies

Φ<1|\Phi|<12

hence

Φ<1|\Phi|<13

Via a Bromwich contour, the innovation density is

Φ<1|\Phi|<14

In the second variant, the innovations themselves are Mittag-Leffler: Φ<1|\Phi|<15 The one-step conditional law then satisfies

Φ<1|\Phi|<16

where

Φ<1|\Phi|<17

The first construction has ML marginals and non-ML innovations; the second has ML innovations and non-ML marginals (Dhull, 10 Jan 2026).

2. Transition kernels, stationarity, and moment structure

For either AR(1) construction, the one-step kernel can be written as

Φ<1|\Phi|<18

and therefore

Φ<1|\Phi|<19

These expressions are closed in the sense that they involve one-dimensional integrals against elementary kernels, or inversion of known Laplace transforms (Dhull, 10 Jan 2026).

Under ML(α,σ)ML(\alpha,\sigma)0, existence of a unique strictly stationary solution of

ML(α,σ)ML(\alpha,\sigma)1

follows from the usual contraction argument if ML(α,σ)ML(\alpha,\sigma)2. The innovation law is heavy tailed, but it has finite fractional moments of order ML(α,σ)ML(\alpha,\sigma)3. More precisely, for ML(α,σ)ML(\alpha,\sigma)4,

ML(α,σ)ML(\alpha,\sigma)5

Since ML(α,σ)ML(\alpha,\sigma)6, the law has no finite integer moments above order ML(α,σ)ML(\alpha,\sigma)7. The AR(1) chain inherits the same no-integer-moments property, although it is geometrically ergodic under ML(α,σ)ML(\alpha,\sigma)8 (Dhull, 10 Jan 2026).

This sharp separation between ergodicity and classical moment finiteness is one of the characteristic features of the discrete-time Mittag-Leffler AR(1) chain. It also explains why moment-based inference is structurally fragile in this setting.

3. Empirical Laplace-transform estimation

Parameter estimation for the AR(1) Mittag-Leffler chain is formulated through empirical Laplace transforms rather than sample moments. Given observations ML(α,σ)ML(\alpha,\sigma)9, define

ML(α,σ)ML(\alpha,\sigma)0

The procedure matches ML(α,σ)ML(\alpha,\sigma)1 to the theoretical Laplace-transform identities of the model (Dhull, 10 Jan 2026).

When the observed chain has ML marginals, the identity

ML(α,σ)ML(\alpha,\sigma)2

implies, at each ML(α,σ)ML(\alpha,\sigma)3,

ML(α,σ)ML(\alpha,\sigma)4

Taking logs gives

ML(α,σ)ML(\alpha,\sigma)5

When the observed chain has ML marginals but non-ML innovations, one instead uses

ML(α,σ)ML(\alpha,\sigma)6

Again one takes logs and fits ML(α,σ)ML(\alpha,\sigma)7 from two or more abscissae ML(α,σ)ML(\alpha,\sigma)8. Concretely, for ML(α,σ)ML(\alpha,\sigma)9, one solves

ϕML(s)=E[esM]=11+(σs)α,0<α1, σ>0\phi_{ML}(s)=E[e^{-sM}]=\frac{1}{1+(\sigma s)^\alpha}, \qquad 0<\alpha\le 1,\ \sigma>00

by ordinary least-squares or direct root-finding.

Because the Mittag-Leffler law lacks ordinary integer moments in the heavy-tailed range considered here, this method is explicitly moment-free. A plausible implication is that the transform domain is not merely computationally convenient but structurally aligned with the model class.

4. Simulation evidence and high-frequency trading application

The simulation study in the AR(1) framework uses ϕML(s)=E[esM]=11+(σs)α,0<α1, σ>0\phi_{ML}(s)=E[e^{-sM}]=\frac{1}{1+(\sigma s)^\alpha}, \qquad 0<\alpha\le 1,\ \sigma>01 replications with chain length ϕML(s)=E[esM]=11+(σs)α,0<α1, σ>0\phi_{ML}(s)=E[e^{-sM}]=\frac{1}{1+(\sigma s)^\alpha}, \qquad 0<\alpha\le 1,\ \sigma>02. In the ML-innovations scenario, with ϕML(s)=E[esM]=11+(σs)α,0<α1, σ>0\phi_{ML}(s)=E[e^{-sM}]=\frac{1}{1+(\sigma s)^\alpha}, \qquad 0<\alpha\le 1,\ \sigma>03, ϕML(s)=E[esM]=11+(σs)α,0<α1, σ>0\phi_{ML}(s)=E[e^{-sM}]=\frac{1}{1+(\sigma s)^\alpha}, \qquad 0<\alpha\le 1,\ \sigma>04 or ϕML(s)=E[esM]=11+(σs)α,0<α1, σ>0\phi_{ML}(s)=E[e^{-sM}]=\frac{1}{1+(\sigma s)^\alpha}, \qquad 0<\alpha\le 1,\ \sigma>05, and ϕML(s)=E[esM]=11+(σs)α,0<α1, σ>0\phi_{ML}(s)=E[e^{-sM}]=\frac{1}{1+(\sigma s)^\alpha}, \qquad 0<\alpha\le 1,\ \sigma>06 or ϕML(s)=E[esM]=11+(σs)α,0<α1, σ>0\phi_{ML}(s)=E[e^{-sM}]=\frac{1}{1+(\sigma s)^\alpha}, \qquad 0<\alpha\le 1,\ \sigma>07, the reported averages are precise. For ϕML(s)=E[esM]=11+(σs)α,0<α1, σ>0\phi_{ML}(s)=E[e^{-sM}]=\frac{1}{1+(\sigma s)^\alpha}, \qquad 0<\alpha\le 1,\ \sigma>08, the average estimates over ϕML(s)=E[esM]=11+(σs)α,0<α1, σ>0\phi_{ML}(s)=E[e^{-sM}]=\frac{1}{1+(\sigma s)^\alpha}, \qquad 0<\alpha\le 1,\ \sigma>09 runs are

[0,)[0,\infty)0

with

[0,)[0,\infty)1

For [0,)[0,\infty)2,

[0,)[0,\infty)3

with

[0,)[0,\infty)4

In the ML-marginals scenario, with [0,)[0,\infty)5 and [0,)[0,\infty)6, similar Monte Carlo shows [0,)[0,\infty)7 and [0,)[0,\infty)8 in [0,)[0,\infty)9 and XtX_t0 across four combinations (Dhull, 10 Jan 2026).

A real-data illustration re-analyzes the inter-arrival times, in seconds, of positive and negative ticks in crude-oil futures HFT data with XtX_t1 records. A preliminary Poisson-process exponential fit shows large systematic departures in log-survival plots. Fitting the AR(1) version with ML-innovations yields

XtX_t2

for up-ticks, and

XtX_t3

for down-ticks. Residual diagnostic checks—Q-Q plots against XtX_t4, Kolmogorov-Smirnov XtX_t5-values XtX_t6, and Ljung-Box tests on transformed residuals—confirm an excellent fit. The AR coefficient XtX_t7–XtX_t8 captures mild short-term correlation, and the heavy-tail index XtX_t9 is consistent with fractional-Poisson waiting-time phenomena noted in the literature (Dhull, 10 Jan 2026).

5. Strictly increasing continuous-time chains with discrete Mittag-Leffler jumps

A different Mittag-Leffler Markov construction is a strictly increasing continuous-time Markov chain on ete^{-t}0, formulated through a Bernstein-function generator. Let ete^{-t}1 be the backward shift, ete^{-t}2, and set the discrete Laplacian

ete^{-t}3

Choose

ete^{-t}4

and define the generator

ete^{-t}5

The resulting process is then time-changed by an independent fractional Poisson clock of rate ete^{-t}6 and order ete^{-t}7, with Caputo derivative

ete^{-t}8

(Michelitsch et al., 2020).

If ete^{-t}9, the forward equation is

Φ\Phi0

In operator form,

Φ\Phi1

The solution is expressed through the Mittag-Leffler matrix function: Φ\Phi2 Its generating function

Φ\Phi3

satisfies

Φ\Phi4

The same process admits a subordination representation through the waiting-time density of the fractional Poisson clock,

Φ\Phi5

and the Montroll-Weiss series reproduces the Caputo equation (Michelitsch et al., 2020).

Under the well-scaled diffusion limit Φ\Phi6, with Φ\Phi7,

Φ\Phi8

and

Φ\Phi9

The rescaled state density Φ<1|\Phi|<10 solves

Φ<1|\Phi|<11

Equivalently, with

Φ<1|\Phi|<12

one has

Φ<1|\Phi|<13

After integration in Φ<1|\Phi|<14, these kernels coincide with the Prabhakar integrals

Φ<1|\Phi|<15

which makes the link to the three-parameter Prabhakar fractional calculus (Michelitsch et al., 2020).

6. Möhle’s Mittag-Leffler process, scaling limits, and distinctions

Möhle’s Mittag-Leffler process Φ<1|\Phi|<16 is a time-homogeneous Feller process on Φ<1|\Phi|<17 with the property that Φ<1|\Phi|<18 is Mittag-Leffler distributed with parameter Φ<1|\Phi|<19, Φ<1|\Phi|<100. Its entire moments are

Φ<1|\Phi|<101

and its Laplace transform is

Φ<1|\Phi|<102

The transition kernel is defined by

Φ<1|\Phi|<103

where Φ<1|\Phi|<104 is Mittag-LefflerΦ<1|\Phi|<105, and the semigroup acts as

Φ<1|\Phi|<106

Standard Feller-process theory yields a càdlàg Markov process with this semigroup and with Φ<1|\Phi|<107 almost surely (Möhle, 2014).

The infinitesimal generator admits a power-series representation. For suitable Φ<1|\Phi|<108 with convergent Taylor expansions,

Φ<1|\Phi|<109

where

Φ<1|\Phi|<110

Thus

Φ<1|\Phi|<111

The finite-dimensional distributions have explicit joint moments in terms of Gamma-ratios, and the main scaling-limit result states that if Φ<1|\Phi|<112 denotes the block counting process of the Bolthausen-Sznitman Φ<1|\Phi|<113-coalescent, then

Φ<1|\Phi|<114

converges in Φ<1|\Phi|<115, the Skorohod topology of càdlàg paths, to Φ<1|\Phi|<116 as Φ<1|\Phi|<117 (Möhle, 2014).

A recurrent source of confusion is the relation between this process and the discrete-time autoregressive constructions. Möhle explicitly notes that, although one sometimes sees in the literature an “autoregressive Mittag-Leffler process” in discrete time, the process Φ<1|\Phi|<118 considered here has finite moments of all orders and is of a different type. He also states that Φ<1|\Phi|<119 is not a Lévy process, since its increments are neither independent nor stationary (Möhle, 2014). This distinguishes the coalescent-scaling-limit process sharply from the heavy-tailed AR(1) chains, whose defining feature is precisely the coexistence of geometric ergodicity with only fractional moments.

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 Mittag-Leffler Markov chain.