Moments of general time dependent branching processes with applications
classification
🧮 math.PR
keywords
processbranchingdegreeapplicationsappliedboundedcollaborationsconditions
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.