The many-to-few lemma and multiple spines
By Simon C. Harris, Matthew I. Roberts. 2011
126 citations recorded by the source corpus.
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.
Subfields: Applied Mathematics, Mathematical Physics, Statistics and Probability
View Paper: https://www.semanticscholar.org/paper/b5f854d5ebfab2fae3f3263ecbcfaa9a0c3649a6
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Applied Mathematics
- Elie Aidékon
- Marc Hoffmann
- Zhan Shi
- Nathalie Krell
- J. Berestycki
- Marie Doumic
- L. Robert
- Mathieu Rosenbaum
In Mathematical Physics
- Zhan Shi
- Elie Aidékon
- Thomas Madaule
- Marc Hoffmann
- Nathalie Krell
- J. Berestycki
- Marie Doumic
- L. Robert
In Statistics and Probability
- Zhan Shi
- Elie Aidékon
- Marc Hoffmann
- Nathalie Krell
- J. Berestycki
- Marie Doumic
- L. Robert
- Thomas Madaule
Citations in the corpus
- Branching Brownian motion seen from its tip (2011, background): “To see this, one can for instance adapt the proofs for the fixed-time many-to-one lemma in [14,17] to the case of dissecting stopping lines.”
- Statistical estimation of a growth-fragmentation model observed on a genealogical tree (2012, background): “Alternative approaches to the same kind of questions include the probabilistic studies of Chauvin et al. [9], Bansaye et al. [5] or Harris and Roberts [22] and references therein.”
- Branching random walks (2015, methodology): “There is a corresponding formula, called the many-to-few formula, suitable for computing higher-order moments; see Harris and Roberts [127].”
- The coalescent structure of continuous-time Galton–Watson trees (2017, unknown): “Spine methods are well known; for a thorough treatment see [13].”