The Erlang weighted tree, a new branching process

In this paper, we study a new discrete tree and the resulting branching process, which we call the erlang weighted tree(EWT). The EWT appears as the local weak limit of a random graph model proposed in La and Kabkab, Internet Math. 11 (2015), no. 6, 528-554. In contrast to the local weak limit of well-known random graph models, the EWT has an interdependent structure. In particular, its vertices encode a multi-type branching process with uncountably many types. We derive the main properties of the EWT, such as the probability of extinction, growth rate, and so forth. We show that the probability of extinction is the smallest fixed point of an operator. We then take a point process perspective and analyze the growth rate operator. We derive the Krein-Rutman eigenvalue beta 0$$ {\beta}_0 $$ and the corresponding eigenfunctions of the growth operator, and show that the probability of extinction equals one if and only if beta 0 <= 1$$ {\beta}_0\le 1 $$.