Moments of general time dependent branching processes with applications

被引:1
|
作者
Mori, T. F. [1 ]
Rokob, S. [2 ]
机构
[1] Eotvos Lorand Univ, Dept Probabil Theory & Stat, Pazmany P S 1-C, H-1117 Budapest, Hungary
[2] Budapest Univ Technol & Econ, Dept Stochast, Egry J U 1, H-1111 Budapest, Hungary
关键词
Crump-Mode-Jagers process; Burkholder-Rosenthal nequality; renewal equation; evolving random graph; maximal degree; GROWTH;
D O I
10.1007/s10474-019-00976-9
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We give sufficient conditions for a Crump-Mode-Jagers processto 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 samerate of increase as the degree process of a fixed vertex.
引用
收藏
页码:131 / 149
页数:19
相关论文
共 50 条