An iterative aggregation/disaggregation procedure for modelling the long-term behaviour of continuous-time evanescent random processes
DOI10.1080/00949659608811781zbMath0881.60068OpenAlexW2068137841MaRDI QIDQ4346981
M. S. Bebbington, David E. Stewart
Publication date: 18 September 1997
Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00949659608811781
Characteristic functions; other transforms (60E10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Probabilistic methods, stochastic differential equations (65C99)
Uses Software
Cites Work
- Unnamed Item
- On a direct method for the solution of nearly uncoupled Markov chains
- Block iterative algorithms for stochastic matrices
- Limit theorems for the population size of a birth and death process allowing catastrophes
- Non-negative matrices and Markov chains. 2nd ed
- On the quasi-stationary distribution of the Ross malaria model
- Continuous-time Markov chains. An applications-oriented approach
- Quasi-stationary distributions for absorbing continuous-time denumerable Markov chains
- On the problem of evaluating quasistationary distributions for open reaction schemes
- On two classes of interacting stochastic processes arising in cancer modeling
- A description of the long-term behaviour of absorbing continuous-time Markov chains using a centre manifold
- Aggregation/Disaggregation for Eigenvalue Problems
- Iterative Methods for Computing Stationary Distributions of Nearly Completely Decomposable Markov Chains
- Iterative aggregation/disaggregation techniques for nearly uncoupled markov chains
- Aggregation/Disaggregation Methods for Computing the Stationary Distribution of a Markov Chain
- Sparse Cholesky Factorization on a Local-Memory Multiprocessor
- Quasi-stationary distributions and convergence to quasi-stationarity of birth-death processes
- An aggregation/disaggregation algorithm for computing the stationary distribution of a large markov chain
- An Efficient Procedure for Computing Quasi-Stationary Distributions of Markov Chains by Sparse Transition Structure
- On Quasi-Stationary distributions in absorbing discrete-time finite Markov chains
- On quasi-stationary distributions in discrete-time Markov chains with a denumerable infinity of states
- On a stochastic model of an epidemic
- On quasi-stationary distributions in absorbing continuous-time finite Markov chains
- SOME LIMIT THEOREMS FOR EVANESCENT PROCESSES
- The calculation of limit probabilities for denumerable Markov processes from infinitesimal properties
This page was built for publication: An iterative aggregation/disaggregation procedure for modelling the long-term behaviour of continuous-time evanescent random processes