2000 character limit reached
Moments of general time dependent branching processes with applications
Published 2 Jul 2018 in math.PR | (1807.00767v2)
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.
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.