A Compression Algorithm for Probability Transition Matrices

DOI10.1137/S0895479897316916MaRDI QIDQ4243493zbMATH OpenOpenAlexFDO

Authors William M. Spears

Publication date 18 May 1999

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895479897316916

zbMATH Keywords

numerical examplescompression algorithmprobability transition matrices

Mathematics Subject Classification ID

Stochastic matrices (15B51)

Recommendations

• Monte Carlo matrix computations based on compression
• A mixed integer linear program to compress transition probability matrices in Markov chain bootstrapping
• Compression of transfer matrices
• Compression of Multivariate Discrete Measures and Applications
• Compression via matroids: a randomized polynomial kernel for odd cycle transversal
• Compression via Matroids
• Probability Distance Based Compression of Hidden Markov Models
• An informational approach to the problem of compressing random processes
• A Markov chain algorithm for compression in self-organizing particle systems

Cited in

(7)

• A probabilistic algorithm for aggregating vastly undersampled large Markov chains
• Algorithm for computing transition probability between components in Internetware
• Probability Distance Based Compression of Hidden Markov Models
• Compression via Matroids
• On the relationship between bisimulation and trace equivalence in an approximate probabilistic context
• A mixed integer linear program to compress transition probability matrices in Markov chain bootstrapping
• Modeling the effects of size-dependent harvesting strategies on the population dynamics of tropical trees

This page was built for publication: A Compression Algorithm for Probability Transition Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243493)