Metraipolis › archive › dc_3da954bc14de
Algebraic formulas for first-passage times of Markov processes in the linear framework: generalising the work of Hill and Kac — arXiv:2608.08375
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.08375
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T09:06:58.422Z
- SHA-256 of the archived text
6a054e1049f657f482d067cc006e9db9960f0d952d6353255e7f3ac8ffa6edb2- Stable URL of this page
https://metraipolis.com/documento/dc_3da954bc14de
How to cite
Algebraic formulas for first-passage times of Markov processes in the linear framework: generalising the work of Hill and Kac — arXiv:2608.08375 — arXiv (en), https://arxiv.org/abs/2608.08375 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3da954bc14de (Metraipolis archive dc_3da954bc14de, sha256 6a054e1049f657f482d067cc006e9db9960f0d952d6353255e7f3ac8ffa6edb2)
BibTeX
@misc{dc3da954bc14de,
title = {Algebraic formulas for first-passage times of Markov processes in the linear framework: generalising the work of Hill and Kac — arXiv:2608.08375},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.08375},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3da954bc14de; sha256 6a054e1049f657f482d067cc006e9db9960f0d952d6353255e7f3ac8ffa6edb2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.08375. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In a preceding paper, we used the graph-theoretic linear framework to show how transient properties of continuous-time Markov processes -- splitting probabilities and the moments of first-passage time (FPT) distributions -- could be expressed as rational algebraic functions of the transition rates, by using spanning forests of the underlying graph. This contrasts with the related rational formulas for steady-state (s.s.) probabilities, which use only spanning trees. The biophysicist Terrell Hill sketched a procedure for calculating mean FPTs and splitting probabilities in terms of the s.s. probabilities of a modified Markov process, thereby converting calculations using ensembles of trajectories to those using a single trajectory. Similarly, Mark Kac showed that the mean recurrence time to a state of a Markov process could be expressed in terms of the s.s. probability of that state. Here, we explore further the relationships between transient and s.s. properties, forests and trees, and ensemble and single-trajectory calculations. We formalise Hill's procedure by introducing a Hill operator, $H_u[G]$, on a graph, $G$, and use it to calculate all moments of the conditional and unconditional FPTs from $u$ as rational functions of the s.s. probabilities of $H_u[G]$, which arise from trees and "exchange factors" which arise from forests. We then combine this with an unravelling operator, $U_v[G]$, to calculate all moments of the recurrence time distribution as rational functions of the s.s. probabilities of $G$ and related exchange factors. Surprisingly, the Hill operator turns out to be a left-inverse to the unravelling operator, suggesting that the algebra of operators on linear framework graphs may be of broader interest. Our results integrate and generalise previously disparate findings into a common repertoire of rational algebraic formulas for FPTs of Markov processes. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in math.PR). Categorie arXiv: Probability (math.PR) ; Quantitative Methods (q-bio.QM). Pagina del lavoro: https://arxiv.org/abs/2608.08375 — 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-10-19T09:04:32.172Z dalla pagina https://arxiv.org/catchup/math.PR/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).