Moments of general time dependent branching processes with applications
Abstract
In this paper, we give sufficient conditions for a Crump-Mode-Jagers process to be bounded in Lk 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.