1981
DOI: 10.1007/bf00534830
|View full text |Cite
|
Sign up to set email alerts
|

On the convergence of supercritical general (C-M-J) branching processes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

5
382
0

Year Published

1996
1996
2021
2021

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 216 publications
(387 citation statements)
references
References 10 publications
5
382
0
Order By: Relevance
“…The following theorem is due to Nerman [22] and is an analogue of the renewal theorem for ordinary random walks.…”
Section: 2mentioning
confidence: 99%
See 1 more Smart Citation
“…The following theorem is due to Nerman [22] and is an analogue of the renewal theorem for ordinary random walks.…”
Section: 2mentioning
confidence: 99%
“…Recall our standing assumption 1 < E[ν] < ∞. Nerman's theorem actually requires less than E[ν] < ∞; see [22] for the precise conditions needed. Furthermore, the lattice case does not require Z to have sample paths which possess right-and left-hand limits.…”
Section: Theorem 34 Suppose That There Exists a Non-increasing And mentioning
confidence: 99%
“…The branching process discussed in the previous section is still valid and would allow us to calculate the variance in the overall number of infected but the method is problematic to implement (Nerman, 1981;Ball and Donnelly, 1995). Instead, we investigate this phase of the epidemic by deriving a diffusion approximation for the process in the limit of the number of clumps m → ∞ The variance tends to decrease as we increase β past this threshold as large outbreaks become more probable.…”
Section: Early Asymptotic Behaviourmentioning
confidence: 99%
“…In the context of Crump-Mode-Jagers processes, φ can be interpreted as a general characteristic of the process, see [13]. As usual, we suppress the dependence of φ on ω in most of the formulas, i.e., we write φ(t) and think of it as the random variable ω → φ(t, ω …”
Section: As Renewal Theorems For Brws On the Linementioning
confidence: 99%
“…For instance, Nerman's a.s. renewal theorem [13,Theorem 5.4] has been successfully applied in the study of the functional equation in the BRW, see e.g. [4,Theorem 8.6] and [2,Proposition 9.2].…”
Section: Introductionmentioning
confidence: 99%