2000 character limit reached
Non-binary branching process and Non-Markovian exploration process
Published 5 Feb 2016 in math.PR | (1602.02007v1)
Abstract: We study the exploration (or height) process of a continuous time non-binary Galton-Watson random tree, in the subcritical, critical and supercritical cases. Thus we consider the branching process in continuous time (Z_{t})_{t\geq 0}, which describes the number of offspring alive at time t. We then renormalize our branching process and exploration process, and take the weak limit as the size of the population tends to infinity. Finally we deduce a Ray-Knight representation.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.