Article
Licensed
Unlicensed
Requires Authentication
Branching processes in a Markov random environment
Published/Copyright:
November 25, 2014
Abstract
The paper is concerned with critical branching processes in a Markov random environment. A conditional functional limit theorem for the number of particles in a process and a conditional invariance principle are proved. The asymptotic tail behaviour for the distributions of the maximum and the total number of particles in a process is found.
Published Online: 2014-11-25
Published in Print: 2014-12-1
© 2014 by Walter de Gruyter Berlin/Boston
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Frontmatter
- On the asymptotic normality of the number of empty cells in a scheme of group allocation of particles
- Branching processes in a Markov random environment
- Properties of Boolean functions without three-argument implicents
- On the fraction of matrices with maximal additive complexity
- On the maximum size of a tree in the Galton–Watson forest with a bounded number of vertices
- Lower bounds of temporal and spatial complexity of the substring search problem
Articles in the same Issue
- Frontmatter
- On the asymptotic normality of the number of empty cells in a scheme of group allocation of particles
- Branching processes in a Markov random environment
- Properties of Boolean functions without three-argument implicents
- On the fraction of matrices with maximal additive complexity
- On the maximum size of a tree in the Galton–Watson forest with a bounded number of vertices
- Lower bounds of temporal and spatial complexity of the substring search problem
