Metraipolis › archive › dc_d52ec562668f
Maximum entropy reconstruction of discrete-time Markov chains under partial information — arXiv:2611.02982
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.02982
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T19:08:38.819Z
- SHA-256 of the archived text
535aa9a1afe6cf037e919963324f505926661bb8bdf96bdaedbb62e72211cb46- Stable URL of this page
https://metraipolis.com/documento/dc_d52ec562668f
How to cite
Maximum entropy reconstruction of discrete-time Markov chains under partial information — arXiv:2611.02982 — arXiv (en), https://arxiv.org/abs/2611.02982 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d52ec562668f (Metraipolis archive dc_d52ec562668f, sha256 535aa9a1afe6cf037e919963324f505926661bb8bdf96bdaedbb62e72211cb46)
BibTeX
@misc{dcd52ec562668f,
title = {Maximum entropy reconstruction of discrete-time Markov chains under partial information — arXiv:2611.02982},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.02982},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d52ec562668f; sha256 535aa9a1afe6cf037e919963324f505926661bb8bdf96bdaedbb62e72211cb46},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02982. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper addresses the reconstruction of discrete-time Markov chains from incomplete information using the maximum entropy rate principle. Three settings are considered: prescribed graph topology alone, topology with a fully specified stationary distribution, and topology with partially specified stationary probabilities. We investigate the relationship between entropy-maximizing transition mechanisms and Luce's choice axiom, establishing conditions under which optimal transition matrices admit a Luce-score representation. When the stationary distribution is fully prescribed, we develop a constructive feasibility test and a system-theoretic iterative algorithm based on a Lyapunov-like function. Unlike conventional matrix-scaling approaches, the proposed algorithm operates directly on Luce scores. We illustrate the results for selected graph topologies, including complete graphs without self-loops and odd cycles. We also provide a counterexample to a previously stated uniqueness claim, showing that distinct, nonproportional Luce-score vectors can generate the same entropy-maximizing transition matrix. For partially prescribed stationary distributions, we extend the score-based approach to jointly reconstruct the unknown stationary probabilities and transition mechanism through an iterative procedure involving a parameterized Lyapunov-like function. Overall, the proposed framework integrates graph compatibility, entropy-rate maximization, and probabilistic choice representations, offering constructive tools for reconstructing Markov chains under different levels of stationary information and structural constraints. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv eess.SY, nuovi lavori del giorno). Categorie arXiv: Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2611.02982 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T18:25:37.824Z dalla pagina https://arxiv.org/list/eess.SY/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).