Abstract
Bifurcating Markov chains (BMC) are Markov chains indexed by a full binary tree representing the evolution of a trait along a population where each individual has two children. We provide a central limit theorem for general additive functionals of BMC, and prove the existence of three regimes. This corresponds to a competition between the reproducing rate (each individual has two children) and the ergodicity rate for the evolution of the trait. This is in contrast with the work of Guyon (Ann. Appl. Probab. 17 (2007) 1538–1569), where the considered additive functionals are sums of martingale increments, and only one regime appears. Our result can be seen as a discrete time version, but with general trait evolution, of results in the time continuous setting of branching particle system from Adamczak and Miłos´ (Electron. J. Probab. 20 (2015) 42), where the evolution of the trait is given by an Ornstein–Uhlenbeck process.
| Original language | English |
|---|---|
| Pages (from-to) | 3817-3849 |
| Number of pages | 33 |
| Journal | Annals of Applied Probability |
| Volume | 32 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 1 Oct 2022 |
Keywords
- Bifurcating Markov chains
- binary trees
- central limit theorem
- tree indexed Markov chain
Fingerprint
Dive into the research topics of 'CENTRAL LIMIT THEOREM FOR BIFURCATING MARKOV CHAINS UNDER POINTWISE ERGODIC CONDITIONS'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver