General branching processes in discrete time as random trees

Details General branching processes in discrete time as random trees General branching processes in discrete time as random trees

2008-11-14

arxiv.org/abs/0811.2299v1

Bernoulli 2008, Vol. 14, No. 4, 949-962

Mathematics

Statistics Theory

Published in at http://dx.doi.org/10.3150/08-BEJ138 the Bernoulli (http://isi.cbs.nl/bernoulli/) by the International Statisti

Scientific paper

10.3150/08-BEJ138

The simple Galton--Watson process describes populations where individuals live one season and are then replaced by a random number of children. It can also be viewed as a way of generating random trees, each vertex being an individual of the family tree. This viewpoint has led to new insights and a revival of classical theory. We show how a similar reinterpretation can shed new light on the more interesting forms of branching processes that allow repeated bearings and, thus, overlapping generations. In particular, we use the stable pedigree law to give a transparent description of a size-biased version of general branching processes in discrete time. This allows us to analyze the $x\log x$ condition for exponential growth of supercritical general processes as well as relation between simple Galton--Watson and more general branching processes.

Affiliated with

Also associated with

No associations

Rating

General branching processes in discrete time as random trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with General branching processes in discrete time as random trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and General branching processes in discrete time as random trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-10967