An Efficient Procedure for Computing Quasi-Stationary Distributions of Markov Chains by Sparse Transition Structure
From MaRDI portal
Publication:4287970
Recommendations
Cited in
(15)- Influence of Preconditioning and Blocking on Accuracy in Solving Markovian Models
- The determination of quasistationary distributions directly from the transition rates of an absorbing Markov chain
- scientific article; zbMATH DE number 7297838 (Why is no real title available?)
- Schwarz methods for quasi stationary distributions of Markov chains
- Minimal quasi-stationary distributions under null \(R\)-recurrence
- Modelling quasi-stationary behaviour in metapopulations
- Analysis of a stochastic approximation algorithm for computing quasi-stationary distributions
- scientific article; zbMATH DE number 2051225 (Why is no real title available?)
- Asymptotic expansions for stationary distributions of perturbed semi-Markov processes
- Quasi-stationary distributions and population processes
- An iterative aggregation/disaggregation procedure for modelling the long-term behaviour of continuous-time evanescent random processes
- Alternating two-stage methods for consistent linear systems with applications to the parallel solution of Markov chains
- A diffusion approach to approximating preservation probabilities for gene duplicates
- A stochastic model for disease transmission in a managed herd, motivated by \textit{Neospora caninum} amongst dairy cattle
- A low-rank technique for computing the quasi-stationary distribution of subcritical Galton-Watson processes
This page was built for publication: An Efficient Procedure for Computing Quasi-Stationary Distributions of Markov Chains by Sparse Transition Structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4287970)