Statistics and ComputingBioinformaticsPeer-reviewed journal article
Graph-based algorithms for phase-type distributions
Abstract
Phase-type distributions model the time until absorption in continuous or discrete-time Markov chains on a finite state space. The multivariate phase-type distributions have diverse and important applications by modeling rewards accumulated at visited states. However, even moderately sized state spaces make the traditional matrix-based equations computationally infeasible. State spaces of phase-type distributions are often large but sparse, with only a few transitions from a state. This sparseness makes a graph-based representation of the phase-type distribution more natural and efficient than the traditional matrix-based representation. In this paper, we develop graph-based algorithms for analyzing phase-type distributions. In addition to algorithms for state space construction, reward transformation, and moments calculation, we give algorithms for the marginal distribution functions of multivariate phase-type distributions and for the state probability vector of the underlying Markov chains of both time-homogeneous and time-inhomogeneous phase-type distributions. The algorithms are available as a numerically stable and memory-efficient open source software package written in C named ptdalgorithms. This library exposes all methods in the programming languages C and R. We compare the running time of ptdalgorithms to the fastest tools using a traditional matrix-based formulation. This comparison includes the computation of the probability distribution, which is usually computed by exponentiation of the sub-intensity or sub-transition matrix. We also compare time spent calculating the moments of (multivariate) phase-type distributions usually defined by inversion of the same matrices. The numerical results of our graph-based and traditional matrix-based methods are identical, and our graph-based algorithms are often orders of magnitudes faster. Finally, we demonstrate with a classic problem from population genetics how ptdalgorithms serves as a much faster, simpler, and completely general modeling alternative.
- Citations
- 6
- FWCI
- 1.11
- Field percentile
- top 21%
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- PhaseTypeR: phase-type distributions in R with reward transformations and a view towards population genetics
Iker Rivas-González, Lars Nørvang Andersen, Asger Hobolth·bioRxiv·Jun 16, 2022
- Phase-type distributions in population genetics
Asger Hobolth, Arno Siri‐Jégousse, Mogens Bladt·Theoretical Population BiologyPeer-reviewed·Feb 26, 2019
- PhaseGen: Exact Solutions for Time-Inhomogenous Multivariate Coalescent Distributions under Diverse Demographies
Janek Sendrowski, Asger Hobolth·GeneticsPeer-reviewed·Jul 22, 2025
- Graph-based algorithms for Laplace transformed coalescence time distributions.
Gertjan Bisschop·PLoS Computational BiologyPeer-reviewed·Sep 15, 2022
- Limit distribution of the quartet balance index for Aldous’s β ≥ 0-model
K. Bartoszek·bioRxiv·Nov 26, 2018
- Bayesian inference of power law distributions
Kristina Grigaityte, Gurinder S. Atwal·bioRxiv·Jun 18, 2019