2015
DOI: 10.3150/14-bej623
|View full text |Cite
|
Sign up to set email alerts
|

Statistical estimation of a growth-fragmentation model observed on a genealogical tree

Abstract: We raise the issue of estimating the division rate for a growing and dividing population modelled by a piecewise deterministic Markov branching tree. Such models have broad applications, ranging from TCP/IP window size protocol to bacterial growth. Here, the individuals split into two offsprings at a division rate B(x) that depends on their size x, whereas their size grow exponentially in time, at a rate that exhibits variability. The mean empirical measure of the model satisfies a growth-fragmentation type eq… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

10
132
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 74 publications
(142 citation statements)
references
References 40 publications
10
132
0
Order By: Relevance
“…These include binary growth-fragmentation processes, where we subsequently estimate adaptively the splitting rate of a size-dependent model, thus extending previous results of Doumic et al [26] and bifurcating autoregressive processes, where we complete previous studies of Bitseki Penda et al [12] and Bitseki Penda and Olivier [13].…”
Section: 2supporting
confidence: 55%
See 2 more Smart Citations
“…These include binary growth-fragmentation processes, where we subsequently estimate adaptively the splitting rate of a size-dependent model, thus extending previous results of Doumic et al [26] and bifurcating autoregressive processes, where we complete previous studies of Bitseki Penda et al [12] and Bitseki Penda and Olivier [13].…”
Section: 2supporting
confidence: 55%
“…We consider in Section 4.1 the growth-fragmentation model as studied in Doumic et al [26], where we estimate the sizedependent splitting rate of the model as a function of the invariant measure of an associated BMC in Theorem 11. This enables us to extend the recent results of Doumic et al in several directions: adaptive estimation, extension of the smoothness classes and the loss functions considered, and also a proof of a minimax lower bound.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…Theorem 1. Let us consider the algorithm (8) and the function u K defined by (10). The following convergence result holds:…”
Section: Convergencementioning
confidence: 99%
“…The construction of B is based on the key representation formula proved in [10] B(y) = y 2 ν B (y/2)…”
Section: Construction Of Bmentioning
confidence: 99%