SearcharxivSearch

arXiv · 2512.16634

Wasserstein error bounds for aggregations of continuous-time Markov chains

Abstract

We study the approximation of a (finite) continuous-time Markov chain by a Markov chain on a reduced state space, and we provide formal error bounds for the approximated transient distributions in the Wasserstein distance. These bounds extend previous work on error bounds in the total variation distance, and are the first step towards a generalization to continuous-time Markov processes with continuous state spaces. A Wasserstein matrix norm is used to bound the error caused by the lower-dimensional approximation of the dynamics. In order to control the propagation of the accumulated error, we rely on the concept of coarse Ricci curvature of a Markov chain. The practical applicability of the presented bounds depends strongly on the curvature of the chain. Examples for CTMCs taken from the literature (where we added a metric on the state space) show that a negative curvature results in exponentially exploding bounds. On the other hand, certain CTMCs which we call translation-invariant always have non-negative curvature. When measuring the error in the total variation distance (a special case of the Wasserstein distance with the discrete metric), the curvature is also always non-negative. If it is strictly positive, the bounds presented in this paper are an improvement over previous work.

Explore related subjects

Keep this discovery

BibTeXRIS

Fabian Michel. 2025-12-18. Wasserstein error bounds for aggregations of continuous-time Markov chains. https://arxiv.org/abs/2512.16634

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR