Reachable sets under Kolmogorov dynamics in the probability simplex
Abstract
The finite-time reachability problem - whether two probability vectors can be transformed in a time t through a generator from a given set - is a key question in Markovian dynamics. We address this problem for normalized Kolmogorov generators with tools from differential geometry. The shortest time T connecting an ordered pair of states defines an (asymmetric) quasi-distance in the probability simplex, which distinguishes between outgoing and incoming reachable sets, and captures the inherent irreversibility of Markov dynamics. The Finsler metric corresponding to normalized generators with bounded diagonal entries is characterized, and time-independent evolutions that saturate speed limits are presented. Analytical boundaries of both reachable sets are derived and the ratio of their corresponding volumes assess the bounds obtained. The asymmetry with respect to the uniform probability vector is shown to be related to the Kullback-Leibler relative entropy.
Related
- Computing Invariant Reachable Sets through Sum-of-Squares Programming
- On uniqueness of probability solutions to one-dimensional Fokker-Planck-Kolmogorov equations
- Physics of Information Geometry - Part I: Principle of Least Action on the Probability Simplex
- Focal Sets of the John Ellipsoid of a Simplex from Its Vertices
- Chart-Generated Probability Geometry and Kolmogorov Expectations
BibTeX
@misc{bobadilla2026reachable,
title = {{Reachable sets under Kolmogorov dynamics in the probability simplex}},
author = {Alfonso Fernández de Bobadilla and Mykhailo Hontarenko and Guillem Müller-Rigat and Karol Życzkowski},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.38382},
eprint = {2609.38382},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.38382},
}
RIS
TY - UNPB
TI - Reachable sets under Kolmogorov dynamics in the probability simplex
AU - Alfonso Fernández de Bobadilla
AU - Mykhailo Hontarenko
AU - Guillem Müller-Rigat
AU - Karol Życzkowski
PY - 2026
DA - 2026/09/29
PB - arXiv
DO - 10.48550/arxiv.2609.38382
UR - https://arxiv.org/abs/2609.38382
AB - The finite-time reachability problem - whether two probability vectors can be transformed in a time t through a generator from a given set - is a key question in Markovian dynamics. We address this problem for normalized Kolmogorov generators with tools from differential geometry. The shortest time T connecting an ordered pair of states defines an (asymmetric) quasi-distance in the probability simplex, which distinguishes between outgoing and incoming reachable sets, and captures the inherent irreversibility of Markov dynamics. The Finsler metric corresponding to normalized generators with bounded diagonal entries is characterized, and time-independent evolutions that saturate speed limits are presented. Analytical boundaries of both reachable sets are derived and the ratio of their corresponding volumes assess the bounds obtained. The asymmetry with respect to the uniform probability vector is shown to be related to the Kullback-Leibler relative entropy.
ER -