Skip to content
Preprint

Matrix asymptotic calculus for plug-in maximum likelihood estimators in finite Markov chains

Jul 2026 · 1 citation · 28 references
Mathematics

TL;DR

A unified matrix-level asymptotic calculus for plug-in non-parametric maximum likelihood estimators in finite Markov models, where the stochastic constraints of the transition matrix need not be removed by a minimal parametrization.

Abstract

In this work, we develop a unified matrix-level asymptotic calculus for plug-in non-parametric maximum likelihood estimators in finite Markov models. Starting from the asymptotic distribution of the estimated transition matrix, the limiting object is kept in its natural matrix form as a Gaussian random matrix, while the corresponding row-wise vector representation remains immediately available. The main point is that the stochastic constraints of the transition matrix need not be removed by a minimal parametrization: they are carried by the tangent directions and by the covariance structure of the limiting Gaussian matrix, whereas the relevant differentials are computed directly in matrix spaces. A single stochastic calculus theorem gives first-order limit distributions, finite-order developments for sufficiently differentiable functionals, and analytic expansions when the functional is analytic. This provides a common source for asymptotic formulas for matrix powers, stationary characteristics, finite-dimensional curves of Markov characteristics, additive-functional variances, entropy-type quantities and reliability indicators. The resulting covariance operators lead directly to confidence intervals, confidence regions, simultaneous finite-dimensional bands and Wald-type tests. Since the derivations are expressed through matrix products and Kronecker representations rather than coordinate-wise calculations, the method also gives substantial simplifications and, in many cases, computational gains. The second-order terms identify curvature corrections of smooth functionals and provide refined approximations whenever higher-order information is useful.

View source

Similar papers

Preprint Sep 2026

On the parametric and semiparametric Fisher information matrix for non-zero mean stationary spherical invariant random processes

The classical Whittle formula provides a closed-form expression for the asymptotic Fisher information matrix (FIM) rate of multidimensional, real-valued, zero-mean, purely nondeterministic stationary Gaussian processes (GPs), expressed in terms of their parameterized spectra within a maximum-likelihood framework. Howev...

Jean-Pierre Delmas, Habti Abeida, Stefano Fortunati · 0 citations
Open access Aug 2026

Statistical Learning Theory for Inverse-Probability-Weighted Conditional U-Statistics via Delta Sequences Under Functional Missing-at-Random Models

This paper develops a unified asymptotic theory for inverse-probability-weighted conditional U-statistics of arbitrary fixed order in the presence of missing-at-random responses and infinite-dimensional functional covariates. The target is a conditional higher-order functional generated by a measurable response kernel...

Salim Bouzebda · 0 citations
Open access Aug 2026

Optimality Notions for Resolvent Monte Carlo

Resolvent Monte Carlo estimates eigenvalues of large matrices by sampling Markov chains and reading the target value off a truncated resolvent quotient, trading exact arithmetic for a stochastic error that the almost-optimal sampling scheme is designed to suppress. This paper studies when that error vanishes outright....

Tsvetelina Kostadinov, I. Dimov · 0 citations
Preprint Sep 2026

Invariant Measures as Estimators: Second-Order Stochastic Expansions and Bias Reduction

We develop a general second-order asymptotic framework for estimators constructed from invariant probability measures of data-dependent Markov processes. The framework yields a universal bias correction for smooth functionals, computed from the same invariant measure used to construct the estimator, without the resampl...

S. Yano · 0 citations
Preprint Sep 2026

Computing Stationary Equilibria in Measure-Dependent Markov Systems

This paper shows that the original stationary-equilibrium problem can be reduced to a finite-dimensional self-consistency equation, separating steady-state analysis of the underlying Markov system from equilibrium computation, and uses properties of the resulting self-consistency map to guide the choice among fixed-poi...

Jing Dong, Bar Light, Xin T. Tong · 0 citations
Preprint Sep 2026

Stochastic Lanczos Quadrature for Computational Uncertainty in Linear Algebra

It is shown that a single Lanczos run yields both a matrix-free approximation of the inverse and a Gaussian distribution over the exact result, whose covariance measures what the truncation discarded and concentrates as the number of steps grows.

Hassan Fifen, Issa Karambal, Philipp Hennig · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.