Moments of general time dependent branching processes with applications

2018/07/02 by Móri, Tamás F., Rokob, Sándor
#05C80 #60F25 #60J85 #FOS: Mathematics #Probability (math.PR)

paper · doi:10.48550/arxiv.1807.00767

Abstract

In this paper, we give sufficient conditions for a Crump-Mode-Jagers process to be bounded in L_k for a given k>1. This result is then applied to a recent random graph process motivated by pairwise collaborations and driven by time-dependent branching dynamics. We show that the maximal degree has the same rate of increase as the degree process of a fixed vertex.

Related

• Central limit theorem for supercritical Crump-Mode-Jagers processes counted with non-individual random characteristics
• Local limit of the random degree constrained process
• Functional law of large numbers and central limit theorem for Crump-Mode-Jagers branching processes
• From trees to graphs: collapsing continuous-time branching processes
• Non-linear branching processes and Crump-Mode-Jagers processes with interaction