Exponential approximation for the nearly critical galton-watson process and occupation times of Markov chains

Electronic Journal of Probability

Volumn 16, Issue , 2011, Pages 1381-1393

  Peköz, Erol ^a   Röllin, Adrian ^b  

^a BOSTON UNIVERSITY   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Erd s Taylor theorem; Exponential distribution; Nearly critical Galton Watson branching process; Occupation times of Markov chains; Stein s method

Indexed keywords

EID: 80053162972     PISSN: None     EISSN: 10836489     Source Type: Journal    
DOI: 10.1214/EJP.v16-914     Document Type: Article

References (16)

1. R. Arratia and L. Goldstein (2010). Size bias, sampling, the waiting time paradox, and infinite divisibility: when is the increment independent? Preprint. Available at http: //arxiv. org/abs/1007.3910.
2. A. D. Barbour, L. Holst, and S. Janson (1992). Poisson approximation, volume 2 of Oxford Studies in Probability. The Clarendon Press Oxford University Press, New York. ISBN 0-19-852235-5. Oxford Science Publications.
3. N. H. Bingham (1988). On the limit of a supercritical branching process. J. Appl. Probab. 25, 215-228.
4. M. Brown (2006). Exploiting the waiting time paradox: applications of the size-biasing transformation. Probability in the Engineering and Informational Sciences 20, 195-230.
5. D. A. Darling and M. Kac (1957). On occupation times for markoff processes. Transactions of the American Mathematical Society 84, 444-458.
6. P Erdos and S. J. Taylor (1960). Some problems concerning the structure of random walk paths. Acta Math. Acad. Sci. Hungar 11, 137-162. (unbound insert).
7. K. S. Fahady, M. P Quine, and D. Vere-Jones (1971). Heavy traffic approximations for the galton-watson process. Advances in Applied Probability 3, 282-300.
8. T. Fujimagari (1980). On the extinction time distribution of a branching process in varying environments. Adv. Appl. Probab. 12, 350-366.
9. J. Gärtner and R. Sun (2009). A quenched limit theorem for the local time of random walks on Z2. Stochastic Process. Appl. 119, 1198-1215. ISSN 0304-4149.
10. A. L. Gibbs and F. E. Su (2002). On choosing and bounding probability metrics. International Statistical Review /Revue Internationale de Statistique 70, 419-435.
11. G. F. Lawler and V. Limic (2010). Random walk: a modern introduction. Cambridge.
12. R. Lyons, R. Pemantle, and Y. Peres (1995). Conceptual proofs of L logL criteria for mean behavior of branching processes. Ann. Probab. 23, 1125-1138.
13. E. Peköz and A. Röllin (2011). New rates for exponential approximation and the theorems of Renyi and Yaglom. Ann. Probab. 39, 587-608.
14. E. A. Peköz, A. Röllin, V. Cekanaviaus, and M. Shwartz (2009). A three-parameter binomial approximation. J. Appl. Probab. 46, 1073-1085.
15. S. Ross and E. Peköz (2007). A second course in probability. www.ProbabilityBookstore.com, Boston, MA.
16. A. M. Yaglom (1947). Certain limit theorems of the theory of branching random processes. Doklady Akad. Nauk SSSR (N.S.) 56, 795-798.