2017
DOI: 10.1214/15-aihp714
|View full text |Cite
|
Sign up to set email alerts
|

The many-to-few lemma and multiple spines

Abstract: We develop a simple and intuitive identity for calculating expectations of weighted k-fold sums over particles in branching processes, generalising the well-known many-to-one lemma.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

1
97
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 77 publications
(98 citation statements)
references
References 15 publications
1
97
0
Order By: Relevance
“…We begin by recalling the useful technique of spinal decomposition (c.f., [7]). The (one) spine branching Brownian motion (SBBM) is defined as the original process (h, T, d), only that at any given time one of the particles is designated as the spine particle.…”
Section: Reduction To the Cluster Of The Spine Conditioned To Be Thementioning
confidence: 99%
“…We begin by recalling the useful technique of spinal decomposition (c.f., [7]). The (one) spine branching Brownian motion (SBBM) is defined as the original process (h, T, d), only that at any given time one of the particles is designated as the spine particle.…”
Section: Reduction To the Cluster Of The Spine Conditioned To Be Thementioning
confidence: 99%
“…The proof of the following result with a detailed discussion can be found for example in [5] or [7].…”
Section: Many-to-one Lemma and Applicationsmentioning
confidence: 99%
“…We can now state the main results concerning the limit of (2) with the penalization function (8). We must separate two cases for super-critical offspring distributions depending on q 0 > 0 (which is equivalent to κ > 0) or q 0 = 0 (which is equivalent to κ = 0).…”
Section: 1mentioning
confidence: 99%