• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Local limit theory and large deviations for supercritical branching processes (2004)

by P E Ney, A N Vidyashankar
Venue:Ann. Appl. Probab
Add To MetaCart

Tools

Sorted by:
Results 1 - 4 of 4

supercritical branching processes in random environment

by Centre De, Mathématiques Appliquées, Vincent Bansaye, Christian Boeingho, Vincent Bansaye, Christian Böingho , 2011
"... Small positive values and lower large deviations for supercritical branching processes in random environment ..."
Abstract - Add to MetaCart
Small positive values and lower large deviations for supercritical branching processes in random environment

LIKELY PATH TO EXTINCTION IN SIMPLE BRANCHING MODELS WITH LARGE INITIAL POPULATION

by Klebaner F, Liptser R , 2005
"... Abstract. We give explicit formulae for most likely paths to extinction in simple branching models when initial population is large. In discrete time we study the Galton-Watson process and in continuous time the Branching diffusion. The most likely paths are found with the help of the Large Deviatio ..."
Abstract - Add to MetaCart
Abstract. We give explicit formulae for most likely paths to extinction in simple branching models when initial population is large. In discrete time we study the Galton-Watson process and in continuous time the Branching diffusion. The most likely paths are found with the help of the Large Deviation Principle (LDP). We also find asymptotics for the extinction probability, which gives a new expression in continuous time and recovers the known formula in discrete time. Due to the non-negativity of the processes, the proof of LDP at the point of extinction uses a nonstandard argument of independent interest. 1. Introduction and

Supported by the DFG.

by Klaus Fleischmann, Vitali Wachtel, Corresponding K. Fleischmann, Lower Deviations, For Supercritical Gwp , 2005
"... Abstract. There is a well-known sequence of constants cn describing the growth of supercritical Galton-Watson processes Zn. With “lower deviation probabilities ” we refer to P(Zn = kn) with kn = o(cn) as n increases. We give a detailed picture of the asymptotic behavior of such lower deviation proba ..."
Abstract - Add to MetaCart
Abstract. There is a well-known sequence of constants cn describing the growth of supercritical Galton-Watson processes Zn. With “lower deviation probabilities ” we refer to P(Zn = kn) with kn = o(cn) as n increases. We give a detailed picture of the asymptotic behavior of such lower deviation probabilities. This complements and corrects results known from the literature concerning special cases. Knowledge on lower deviation probabilities is needed to describe large deviations of the ratio Zn+1/Zn. The latter are important in statistical inference to estimate the offspring mean. For our proofs, we adapt the well-known Cramér method for proving large deviations of sums of independent variables to our needs. Contents

Contents

by unknown authors
"... Abstract. In this paper we study the large deviation behavior of sums of i.i.d. random variables Xi defined on a supercritical Galton-Watson process Z. We assume the finiteness of the moments EX 2 1 and EZ1 log Z1. The underlying interplay of the partial sums of the Xi and the lower deviation probab ..."
Abstract - Add to MetaCart
Abstract. In this paper we study the large deviation behavior of sums of i.i.d. random variables Xi defined on a supercritical Galton-Watson process Z. We assume the finiteness of the moments EX 2 1 and EZ1 log Z1. The underlying interplay of the partial sums of the Xi and the lower deviation probabilities of Z is clarified. Here we heavily use lower deviation probability results
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University