On Hitting Times and Fastest Strong Stationary Times for Skip-Free and More General Chains
- 2 June 2009
- journal article
- Published by Springer Nature in Journal of Theoretical Probability
- Vol. 22 (3) , 587-600
- https://doi.org/10.1007/s10959-009-0233-7
Abstract
No abstract availableKeywords
All Related Versions
This publication has 9 references indexed in Scilit:
- On absorption times and Dirichlet eigenvaluesESAIM: Probability and Statistics, 2010
- Spectral Polynomial Algorithms for Computing Bi-Diagonal Representations for Phase Type Distributions and Matrix-Exponential DistributionsStochastic Models, 2006
- Strong stationary duality for continuous-time Markov chains. Part I: TheoryJournal of Theoretical Probability, 1992
- Time to Stationarity for a Continuous-Time Markov ChainProbability in the Engineering and Informational Sciences, 1991
- Strong Stationary Times Via a New Form of DualityThe Annals of Probability, 1990
- Identifying Coefficients in the Spectral Representation for First Passage Time DistributionsProbability in the Engineering and Informational Sciences, 1987
- Matrix AnalysisPublished by Cambridge University Press (CUP) ,1985
- On functions which preserve the class of Stieltjes matricesLinear Algebra and its Applications, 1979
- Coincidence properties of birth and death processesPacific Journal of Mathematics, 1959