Mittag-Leffler Markov Chain Models
- 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 with and either prescribes marginals or takes innovations, where the two-parameter Mittag-Leffler law has Laplace transform
(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 whose marginal is Mittag-Leffler distributed with parameter (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 , . Two natural variants are distinguished. In the first, one imposes stationary marginals 0 and writes
1
Stationarity implies
2
hence
3
Via a Bromwich contour, the innovation density is
4
In the second variant, the innovations themselves are Mittag-Leffler: 5 The one-step conditional law then satisfies
6
where
7
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
8
and therefore
9
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 0, existence of a unique strictly stationary solution of
1
follows from the usual contraction argument if 2. The innovation law is heavy tailed, but it has finite fractional moments of order 3. More precisely, for 4,
5
Since 6, the law has no finite integer moments above order 7. The AR(1) chain inherits the same no-integer-moments property, although it is geometrically ergodic under 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 9, define
0
The procedure matches 1 to the theoretical Laplace-transform identities of the model (Dhull, 10 Jan 2026).
When the observed chain has ML marginals, the identity
2
implies, at each 3,
4
Taking logs gives
5
When the observed chain has ML marginals but non-ML innovations, one instead uses
6
Again one takes logs and fits 7 from two or more abscissae 8. Concretely, for 9, one solves
0
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 1 replications with chain length 2. In the ML-innovations scenario, with 3, 4 or 5, and 6 or 7, the reported averages are precise. For 8, the average estimates over 9 runs are
0
with
1
For 2,
3
with
4
In the ML-marginals scenario, with 5 and 6, similar Monte Carlo shows 7 and 8 in 9 and 0 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 1 records. A preliminary Poisson-process exponential fit shows large systematic departures in log-survival plots. Fitting the AR(1) version with ML-innovations yields
2
for up-ticks, and
3
for down-ticks. Residual diagnostic checks—Q-Q plots against 4, Kolmogorov-Smirnov 5-values 6, and Ljung-Box tests on transformed residuals—confirm an excellent fit. The AR coefficient 7–8 captures mild short-term correlation, and the heavy-tail index 9 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 0, formulated through a Bernstein-function generator. Let 1 be the backward shift, 2, and set the discrete Laplacian
3
Choose
4
and define the generator
5
The resulting process is then time-changed by an independent fractional Poisson clock of rate 6 and order 7, with Caputo derivative
8
If 9, the forward equation is
0
In operator form,
1
The solution is expressed through the Mittag-Leffler matrix function: 2 Its generating function
3
satisfies
4
The same process admits a subordination representation through the waiting-time density of the fractional Poisson clock,
5
and the Montroll-Weiss series reproduces the Caputo equation (Michelitsch et al., 2020).
Under the well-scaled diffusion limit 6, with 7,
8
and
9
The rescaled state density 0 solves
1
Equivalently, with
2
one has
3
After integration in 4, these kernels coincide with the Prabhakar integrals
5
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 6 is a time-homogeneous Feller process on 7 with the property that 8 is Mittag-Leffler distributed with parameter 9, 00. Its entire moments are
01
and its Laplace transform is
02
The transition kernel is defined by
03
where 04 is Mittag-Leffler05, and the semigroup acts as
06
Standard Feller-process theory yields a càdlàg Markov process with this semigroup and with 07 almost surely (Möhle, 2014).
The infinitesimal generator admits a power-series representation. For suitable 08 with convergent Taylor expansions,
09
where
10
Thus
11
The finite-dimensional distributions have explicit joint moments in terms of Gamma-ratios, and the main scaling-limit result states that if 12 denotes the block counting process of the Bolthausen-Sznitman 13-coalescent, then
14
converges in 15, the Skorohod topology of càdlàg paths, to 16 as 17 (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 18 considered here has finite moments of all orders and is of a different type. He also states that 19 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.