Marc Hoffmann
email: hoffmann@ceremade.dauphine.fr

Aline Marguet
email: aline.marguet@inria.fr

Statistical estimation in a randomly structured branching population

Keywords: Mathematics Subject Classification (2010): 62G05, 62M05, 60J80, 60J20, 92D25 Branching processes, bifurcating Markov chains, statistical estimation, geometric ergodicity, scalar diffusions

come

1. Introduction 1.1. Motivation. The study of structured populations, with a strong input from evolutionary or cell division modelling in mathematical biology (see for instance the textbooks [START_REF] Méléard | Modèles aléatoires en écologie et évolution. (French) [Random models in ecology and evolution[END_REF][START_REF] Perthame | Transport equations in biology[END_REF] and the references therein) has driven the statistics of branching Markov processes over the last few years. Several models have been considered, with data processed either in discrete or continuous time. In this context, one typically addresses the inference of critical parameters like branching rates, modelled as functions of biological traits like age, size and so on. In many cases, this approach is linked to certain piecewise deterministic Markov models or bifurcating Markov chains (BMC) in discrete time. These models are well understood from a probabilist point of view (in discrete time Guyon [START_REF] Guyon | Limit theorems for bifurcating Markov chains. Application to the detection of cellular aging[END_REF], Bitseki-Penda et al. [START_REF] Valère Bitseki Penda | Deviation inequalities, moderate deviations and some limit theorems for bifurcating Markov chains with application[END_REF][START_REF] Valère Bitseki | Transportation and concentration inequalities for bifurcating Markov chains[END_REF], in continuous time Bansaye and Méléard [START_REF] Bansaye | Stochastic models for structured populations[END_REF], Bansaye et al. [START_REF] Bansaye | Limit theorems for Markov processes indexed by continuous time Galton-Watson trees[END_REF] or more recently Marguet [START_REF] Marguet | Uniform sampling in a structured branching population[END_REF] for a general approach). For the statistical estimation, we refer to [START_REF] Valère Bitseki | Adaptive estimation for bifurcating Markov chains[END_REF][START_REF] Doumic | Nonparametric estimation of the division rate of a size-structured population[END_REF][START_REF] Doumic | Statistical estimation of a growthfragmentation model observed on a genealogical tree[END_REF][START_REF] Hoffmann | Nonparametric estimation of the division rate of an age dependent branching process[END_REF][START_REF] Basawa | Non-Gaussian bifurcating models and quasi-likelihood estimation[END_REF], and the references therein, see also Bitseki-Penda and Olivier [START_REF] Valère | Autoregressive functions estimation in nonlinear bifurcating autoregressive models[END_REF], de Saporta et al. [START_REF] Benoîte De Saporta | Asymmetry tests for bifurcating auto-regressive processes with missing data[END_REF][START_REF] Benoîte De Saporta | Random coefficients bifurcating autoregressive processes[END_REF], Azaïs et al. [START_REF] Azaïs | Non-parametric estimation of the conditional distribution of the interjumping times for piecewise-deterministic Markov processes[END_REF] or recently Bitseki-Penda and Roche [START_REF] Biteski-Penda | Local bandwidth selection for kernel density estimation in bifurcating markov chain model[END_REF]. In these models, the traits of a population between branching events like cell division evolve through time according to a dynamical system. The next logical step is to replace this deterministic evolution by a random flow, that allows one to account for traits that may have their own random evolution according to some exogeneous input. A paradigmatic example is Kimmel's model (see Kimmel [24] and Bansaye [START_REF] Bansaye | Proliferating parasites in dividing cells: Kimmel's branching model revisited[END_REF]) where the trait is given by a density of parasites within a cell that evolve according to a diffusion process. The statistical analysis of such models is the topic of the present paper.

We consider a population model with binary division triggered by a trait x ∈ X where X ⊆ R is an open (possibly unbounded) interval. The trait φ x (t) of each individual evolves according to [START_REF] Azaïs | Non-parametric estimation of the conditional distribution of the interjumping times for piecewise-deterministic Markov processes[END_REF] dφ x (t) = r(φ x (t))dt + σ(φ x (t))dW t , φ x (0) = x, where r, σ : X → X are regular functions and (W t ) t≥0 is a standard Brownian motion. Each individual with trait x dies according to a killing or rather division rate x → B(x), i.e. an individual with trait φ x (t) at time t dies with probability B(φ x (t))dt during the interval [t, t + dt]. At division, a particle with trait y is replaced by two new individuals with trait at birth given respectively by θy and (1θ)y where θ is drawn according to κ(y)dy for some probability density function κ(y) on [0, 1].The model is described by the traits of the population, formally given as a Markov process

(2) X(t) = (X 1 (t), X 2 (t), . . .), t ≥ 0 with values in k≥1 X k , where the X i (t) denote the (ordered) traits of the living particles at time t. Its distribution is entirely determined by an initial condition at t = 0 and by the parameters (r, σ, B, κ).

1.2. Statistical setting by reduction to a bifurcating Markov chain model. We assume we have data at branching events (i.e. at cell division) and we wish to make inference on the parameters of the model. Using the Ulam-Harris-Neveu notation, for m ≥ 0, let G m = {0, 1} m (with G 0 = {∅}) and introduce the infinite genealogical tree

T = m∈N G m .
For u ∈ G m , set |u| = m and define the concatenation u0 = (u, 0) ∈ G m+1 and u1 = (u, 1) ∈ G m+1 .

For n ≥ 0, let T n = n m=0 G m denote the genealogical tree up to the n-th generation and |T n | denote its cardinality. We denote by X u the trait at birth of an individual u ∈ T. From the branching events, we assume that we observe X n = (X u ) u∈Un , where U n ⊆ T n is what we call a regular incomplete tree, that is a connected subtree of T n that contains at least one individual at the n-th generation (see the formal definition 8 in Section 2.2 below) and with cardinality of order 2 n for some 0 ≤ ≤ 1. This observation scheme is motivated by typical datasets available in biological experiments, see e.g. Robert et al. [START_REF] Robert | Division in Escherichia coli is triggered by a size-sensing rather than a timing mechanism[END_REF] and the refrences therein: when moving from generation m -1 to m (for m = 1, . . . , n) we possibly lose some information, quantified by , due to experimental anomalies or simply because of the design of the experimental process (for instance, in the extreme case = 0, it may well happen that one observes only a single lineage of the bifurcating process due to experimental constraints, as some datasets studied in [START_REF] Robert | Division in Escherichia coli is triggered by a size-sensing rather than a timing mechanism[END_REF]). We thus have approximately 2 n random variables with value in X with a certain Markov structure. Asymptotics are taken as n grows to infinity. An example of trajectory is represented on Figure 1 with the associated genealogy.

There are several objects of interest that we may try to infer from the data X n . First, one may notice that the Markov structure of X in (2) turns (X u , u ∈ T) into a bifurcating Markov chain according to the terminology introduced Basawa and Zhou [START_REF] Basawa | Non-Gaussian bifurcating models and quasi-likelihood estimation[END_REF], later highlighted by Guyon [START_REF] Guyon | Limit theorems for bifurcating Markov chains. Application to the detection of cellular aging[END_REF]. A bifurcating Markov chain is specified by 1) a measurable state space, here X (endowed with its Borel sigma-field) with a Markov kernel P from X to X × X and 2) a filtered probability space Ω, F, (F m ) m≥0 , P . Following Guyon, [START_REF] Guyon | Limit theorems for bifurcating Markov chains. Application to the detection of cellular aging[END_REF], Definition 2, we have the Definition 1. A bifurcating Markov chain (BMC) is a family (X u ) u∈T of random variables with value in X such that X u is F |u| -measurable for every u ∈ T and for every m ≥ 0 and any family of (bounded) measurable functions (ψ u ) u∈Gm , where Pψ(x) = X×X ψ(x, y 1 , y 2 )P(x, dy 1 dy 2 ) denotes the action of P on ψ.

(3) E u∈Gm ψ u (X u , X u0 , X u1 ) F m = u∈Gm Pψ u (X u )
The distribution of (X u ) u∈T is thus entirely determined by P and an initial distribution for X ∅ . A key role for understanding the asymptotic behavior of the bifurcating Markov chain is the socalled tagged-branch chain, that consists in picking a lineage at random in the population (X u ) u∈T : it is a Markov chain with value in X defined by Y 0 = X ∅ and for m ≥ 1:

Y m = X ∅ 1 ... m ,
where ( m ) m≥1 is a sequence of independent Bernoulli random variables with parameter 1/2, independent of (X u ) u∈T , with transition (4) Q = (P 0 + P 1 )/2 obtained from the marginal transitions of P: P 0 (x, dy) = y1∈X P(x, dy dy 1 ) and P 1 (x, dy) = y0∈X P(x, dy 0 dy).

Guyon proves in [START_REF] Guyon | Limit theorems for bifurcating Markov chains. Application to the detection of cellular aging[END_REF] that if (Y m ) m≥0 is ergodic with invariant measure ν(dx) on X, then a convergence of the type

(5) 1 |T n | u∈Tn ψ(X u , X u0 , X u1 ) → X Pψ(x)ν(dx)
holds as n → ∞ for appropriate test functions g, almost surely and appended with appropriate central limit theorems (Theorem 19 in [START_REF] Guyon | Limit theorems for bifurcating Markov chains. Application to the detection of cellular aging[END_REF]). Under appropriate regularity assumptions, an analogous result shall hold when T n is replaced by a regular incomplete tree U n .

1.3. Main results. In this context, there are several quantities that can be inferred from the data X n as n grows and that are important in order to understand the dynamics of (X u ) u∈T . Under suitable assumptions on the stochastic flow (1), the transition Q admits an invariant measure ν and we have fast convergence of the tagged-chain (Y m ) m≥1 to equilibrium. This enables us to construct in a first part nonparametric estimators of ν and Q with an optimal rate of convergence and reveals the structure of the underlying BMC.

However, estimators of ν and Q do not give us any insight about the parameters (r, σ, B, κ) of the model. In a second part, we investigate the inference of the division rate x → B(x) as a function of the trait x ∈ X when the other parameters r, σ and κ(x) are known. This seemingly stringent assumption is necessary given the observation scheme X n . If extraneous data were available, estimators of the parameters r, σ and κ could be obtained in a relatively straightforward manner: i) As soon as a discretisation of the values of the flow are available, standard techniques about inference in ergodic diffusions can be applied to recover x → r(x) and x → σ(x) 2 , see for instance [START_REF] Hoffmann | Adaptive estimation in diffusion processes[END_REF][START_REF] Kutoyants | Statistical inference for ergodic diffusion processes[END_REF]. ii) The fact that an individual u distributed its traits to its offspring in a conservative way enables one to recover the fraction θ u distributed among the children. Indeed the individual u born at b u with lifespan d ub u has trait φ Xu (d ub u ) at its time of death. It follows that its children have trait at birth given by

X u0 = θ u φ Xu (d u -b u ), X u1 = (1 -θ u )φ Xu (d u -b u ),
where the θ u are drawn independently from the distribution κ(x)dx and therefore, the relationship

Xu 0 Xu 1 = θu 1-θu identifies θ u .
In turn, the estimation of x → κ(x) reduces to a standard density estimation problem from data (θ u ) u∈Un , see for instance [START_REF] Hoang | Estimating the division kernel of a size-structured population[END_REF]. The identification and estimation of the branching rate x → B(x) from data X n is more delicate and is the topic of the second part of the paper. Under minimal regularity assumptions developed in Section 2 below, it is not difficult to obtain an explicit representation of the transition Q(x, dy) = Q B (x, dy) = q B (x, y)dy that reads [START_REF] Bezanson | Julia: A fresh approach to numerical computing[END_REF]

q B (x, y) = 1 0 κ(z) + κ(1 -z) 2z B(y/z)σ(y/z) -2 E ∞ 0 e -t 0 B(φx(s))ds dL y/z t (φ x ) dz,
where L y t (φ x ) denotes the local time at t in y of the semimartingale (φ x (t)) t≥0 . Assuming (r, σ, κ) known (or identified by extraneous observation schemes) we study the estimation of x → B(x) when B belongs to a parametric class of functions {B ϑ , ϑ ∈ Θ} for some regular subset of the Euclidean space R d . Under a certain ordering property (Definition 15 in Section 3.2 below) that ensures identifiability of the model and suitable standard regularity properties, we realise a standard maximum likelihood proxy estimation of B thanks to (6) by maximising the contrast

ϑ → u∈U n q B ϑ (X u -, X u ), ϑ ∈ Θ,
(with U n = U n \ G 0 and where u -denotes the unique parent of u) and we prove that it achieves asymptotic efficiency and discuss its practical implementation. It is noteworthy that for the parametric estimation of B, there is no straightforward contrast minimisation procedure (at least we could not find any) whereas q B (x, y) is explicit. The fairly intricate dependence of B in the representation (6) makes however the whole scheme relatively delicate, both mathematically and numerically.

Clearly, other observation schemes are relevant in the context of cell division modelling. For instance, one could consider a (large) time T > 0 and observe the branching process X t defined in (2) for every t ∈ [0, T ]. This entails the possibility to extract the times (T u ) at which branching events occur, like e.g. in [START_REF] Hoffmann | Nonparametric estimation of the division rate of an age dependent branching process[END_REF]. However, the continuous time setting is drastically different and introduce the additional difficulty of bias sampling, an issue we avoid in the present context. Alternatively, one could consider the augmented statistical experiment where one observes (X u , T u ) u∈Un , but the underlying mathematical structure is presumably not simpler. Our results show in particular that for the parametric estimation of the branching rate B, although the times at which branching event occur are statistically informative, their observation is not necessary to obtain optimal rates of convergence as soon as (r, σ, κ) are known.

1.4. Organisation of the paper. Section 2.1 is devoted to the construction of the stochastic model, our assumptions and the accompanying statistical experiments. In particular, we have a nice structure enough so that explicit representations of P and Q are available (Proposition 5). We give a first result on the geometric ergodicity of the model via an explicit Lyapunov function in Proposition 6 and derive in Proposition 9 a rate of convergence for the variance of empirical measures of the data X n = (X u ) u∈Un against test functions ϕ(X u ) or ψ(X u -, X u ) with a sharp control in terms of adequate norms for ϕ, ψ that do not follow from the standard application of the geometric ergodicity of Proposition 6. This is crucial for the subsequent applications to the nonparametric estimation of Q and its invariant measure ν that are given in Theorem 12 of Section 3.1. Section 3.2 is devoted to the parametric estimation of the branching rate, where an asymptotically efficient result is proved for a maximum likelihood estimator in Theorem 22. It is based on a relatively sharp study of the transition Q, thanks to local time properties of the stochastic flow that triggers the branching events. Section 4 is devoted to the numerical implementation of the parametric estimator of B. In particular, in order to avoid the computational cost of the explicit computation of q ϑ (X u -, X u ), we take advantage of our preceding results and implement a nonparametric estimator on Monte-Carlo simulations instead, resulting in a feasible procedure for practical purposes. The proofs are postponed to Section 5 and an Appendix Section 6 contains useful auxiliary results. Dynamics of the traits. Remember that X ⊆ R is an open, possibly unbounded interval. The flow is specified by r, σ : X → X which are measurable and that satisfy the following assumption: Assumption 2. For some r 1 , σ 1 , σ 2 > 0, we have |r(x)| ≤ r 1 (1 + |x|) and σ 1 ≤ σ(x) ≤ σ 2 , for every x ∈ X. Moreover, for some r 2 > 0, we have sgn(x)r(x) < 0 for |x| ≥ r 2 (with sgn(x) = 1 {x>0} -1 {x≤0} ).

Under Assumption 2, there is a unique strong solution to (1) (for instance [START_REF] Øksendal | Stochastic differential equations: an introduction with applications[END_REF], Theorem 5.2.1.). We denote by (Φ x (t), t ≥ 0) the unique solution to (1) with initial condition x ∈ X. In particular, (Φ x (t), t ≥ 0) is a strong Markov process and is ergodic (cf. [START_REF] Kutoyants | Statistical inference for ergodic diffusion processes[END_REF], Theorem 1.16.). Note that when X is bounded, the drift condition sgn(x)r(x) < 0 for large enough x can be dropped.

Division events. An individual with trait x dies at an instantaneous rate x → B(x), where B : X → [0, ∞) satisfies the following condition:

Assumption 3. The function x → B(x) is continuous. Moreover, for some b 1 , b 2 > 0 and γ ≥ 0, we have b 1 ≤ B(x) ≤ b 2 |x| γ + b 1 for every x ∈ X.
Under Assumptions 2 and 3, the process X in (2) is well defined and the size of the population does not explode in finite time almost-surely, see for instance Marguet [START_REF] Marguet | Uniform sampling in a structured branching population[END_REF]. Note that the lower bounds for σ and B are not needed for the well-posedness of X but rather for later statistical purposes.

Fragmentation of the trait at division. Finally, we make an additional set of assumptions on the fragmentation distribution κ(z)dz that ensures in particular the non-degeneracy of the process.

Assumption 4. We have supp(κ) ⊂ [ε, 1 -ε] for some 0 < ε < 1/2, inf z∈[ε,1-ε] κ(z) ≥ δ.
This assumption is slightly technical and may presumably be relaxed. We emphasize that the density κ(z) needs not be symmetric.

Representations of P and Q. Under Assumptions 2, 3 and 4, we obtain closed-form formulae for the transition P defined via (3) and the mean or marginal transition Q of the BMC (X u ) u∈T , see (4) that also gives the transition probability of the discrete Markov chain with value in X corresponding to the trait at birth along an ancestral lineage. These representations are crucial for the subsequent analysis of the variance of the estimators of P and of the invariant measure ν. Proposition 5. Work under Assumptions 2, 3 and 4. For every x, y, y 1 , y 2 ∈ X, we have P(x, dy 1 dy 2 ) = p(x, y 1 , y 2 )dy 1 dy 2 and Q(x, dy) = q(x, y)dy, with

(7) p(x, y 1 , y 2 ) = κ y 1 /(y 1 + y 2 ) y 1 + y 2 B (y 1 + y 2 ) σ(y 1 + y 2 ) -2 E ∞ 0 e -t 0 B(φx(s))ds dL y1+y2 t (φ x )
and

(8) q(x, y) = 1 0 κ(z) z B(y/z)σ(y/z) -2 E ∞ 0 e -t 0 B(φx(s))ds dL y/z t (φ x ) dz,
where κ(z) = 1 2 (κ(z) + κ(1z)) and L y t (φ x ) denotes the local time at t in y of the semimartingale (φ x (t)) t≥0 .

Notice that in the case of a symmetric fragmentation kernel, we have κ = κ.

Convergence of empirical measures.

We study the convergence of empirical means of the form

(9) M Un (ψ) = 1 |U n | u∈U n ψ(X u -, X u ) towards νQ(ψ) if U n is a rich enough incomplete tree, for test functions ψ : X × X → R. (If ϕ : X → R we set M Un (ϕ) = |U n | -1 u∈Un ϕ(X u ) → ν(ϕ)
and we have a formal correspondence between the two expressions by writing ψ(x, y) = ϕ(y) as a function of the second variable.) In order to derive nonparametric estimators of ν and Q by means of kernel functions ψ that shall depend on n, we need sharp estimates in terms of ψ, see Remark 1) after Proposition 9 below.

Convergence of Q to equilibrium. Assumptions 2, 3 and 4 imply a drift condition for the Lyapunov function V (x) = x 2 on X and a minorisation condition over a small set so that in turn Q is geometrically ergodic.

Let Q = Q(r i , b i , σ i , γ, ε, δ, i = 1, 2) be the class of all transitions Q = Q(r, σ, B, κ) defined over X that satisfy Assumptions 2, 3 and 4 with appropriate constants. An invariant probability measure for Q is a probability ν on X such that νQ = ν, where νQ(dy) = x∈X ν(dx)Q(x, dy). Define

Q r (x, dy) = Q(x, dz)Q r-1 (z, dy) with Q 0 (x, dy) = δ x (dy)
for the r-th iteration of Q. For ϕ : X → R, we set

|ϕ| V = sup x∈X |ϕ(x)| 1 + V (x)
and write ν(ϕ) = X ϕ(x)ν(dx) when no confusion is possible.

Proposition 6 (Convergence to equilibrium). Work under Assumptions 2, 3 and 4. Then any Q ∈ Q admits an invariant probability distribution ν. Moreover, for V (x) = x 2 , there exist C = C(Q) > 0 and ρ = ρ(Q) ∈ (0, 1) such that for every m ≥ 1, the bound

Q m ϕ -ν(ϕ) V ≤ Cρ m ϕ -ν(ϕ) V holds as soon as |ϕ| V < ∞. Moreover, sup Q∈Q C(Q) < ∞ and sup Q∈Q ρ(Q) < 1. In particular, if |ϕ| ∞ = sup x∈X |ϕ(x)| is finite, we have |Q m ϕ(x) -ν(ϕ)| ≤ Cρ m (1 + V (x))|ϕ - ν(ϕ)| ∞ for every x ∈ X.
Sharp controls of empirical variances. Proposition 6 is the key ingredient in order to control the rate of convergence of empirical means of the form (9) for appropriate observation schemes U n ⊂ T n .

We need some notation. We denote by | • | 1 the usual L 1 -norm w.r. Note in particular that when ψ(x, y) = ϕ(y) is a function of y only, we may have that |ψ | 1 = X |ϕ(y)|dy is finite while ψ is not integrable on X × X as a function of two variables. For a positive measure ρ on X, let also

|ψ| ρ = X×X |ψ(x, y)|ρ(dx)dy + |ψ| ∧1 .
We write P µ for the law of (X u ) u∈T with initial distribution µ for X ∅ . Remember that V (x) = x 2 from Proposition 6. We shall further restrict our study to transitions Q ∈ Q for which the geometric rate of convergence to equilibrium ρ = ρ(Q) given in Proposition 6 satisfies ρ(Q) ≤ 1/2. Let Q 1/2 ⊂ Q denote the set of such transitions.

Remark 7. It is delicate to check in general that ρ ≤ 1/2 but it is for instance satisfied in the following example: i) φ x (t) is an Ornstein-Uhlenbeck process on X = R: we have r(x) = -βx and σ(x) = σ for every x ∈ X and some β, σ > 0, ii) the division rate is constant: we have B(x) = b for every x ∈ X and some b > 0, iii) the fragmentation distribution is uniform: we have κ(z) = 1/(1 -2ε) on [ε, 1ε] for some ε > 0. Adapting the proof of Proposition 24 below to this special case and using the explicit formula of ρ given Theorem 1.2 in [START_REF] Hairer | Yet another look at Harris' ergodic theorem for Markov chains[END_REF], we show in Appendix 6.1 that for B small enough, we have ρ < 1/2 in this example.

Finally we consider observation schemes U n that satisfy a certain sparsity condition that we quantify in the following definition Definition 8. A regular incomplete tree is a subset

U n ⊆ T n (for n ≥ 1) such that (i) u ∈ U n implies u -∈ U n , (ii) We have 0 < lim inf n→∞ 2 -n U n ∩ G n ≤ lim sup n→∞ 2 -n U n ∩ G n < ∞ for some 0 ≤ ≤ 1.
Proposition 9. Work under Assumptions 2, 3 and 4. Let µ be a probability measure on X such that µ(V 2 ) < ∞. Let ψ : X × X → R a bounded function such that ψ is compactly supported. If U n is a regular incomplete tree, the following estimate holds true:

E µ M Un (ψ) -ν(Qψ) 2 |U n | -1 |ψ 2 | µ+ν + |ψ ψ| µ + 1 + µ(V 2 ) |ψ | 1 |ψ| ν ,
where the symbol means up to an explicitly computable constant that depends on Q and on supp(ψ ) only. Moreover, the estimate is uniform in

Q ∈ Q 1/2 .
Several remarks are in order: 1) We have a sharp order in terms of the test functions ψ, that behave no worse than X 2 ψ 2 under minimal regularity on ν which is satisfied, see Lemma 27 below (and of course µ, although this restriction could be relaxed). This behaviour is the one expected for instance in the IID case and is crucial for the subsequent statistical application of Theorem 12 where the functions ψ will be kernel depending on n. 2) The proof heavily relies on the techniques developed in Biteski Penda et al. [START_REF] Valère Bitseki Penda | Deviation inequalities, moderate deviations and some limit theorems for bifurcating Markov chains with application[END_REF] or Guyon [START_REF] Guyon | Limit theorems for bifurcating Markov chains. Application to the detection of cellular aging[END_REF] (more specifically, Theorems 11 and 12 of [START_REF] Guyon | Limit theorems for bifurcating Markov chains. Application to the detection of cellular aging[END_REF] or Theorem 2.11 and 2.1 of [START_REF] Valère Bitseki Penda | Deviation inequalities, moderate deviations and some limit theorems for bifurcating Markov chains with application[END_REF], see also [START_REF] Valère Bitseki | Adaptive estimation for bifurcating Markov chains[END_REF][START_REF] Biteski-Penda | Local bandwidth selection for kernel density estimation in bifurcating markov chain model[END_REF]). However, we need a slight refinement here, in order to obtain a sharp control in terms of the trial function ψ, similar to the behaviour of X 2 ψ 2 , while the aformentioned references would give a term of order sup x,y |ψ(x, y)| that would not be sufficiently sharp for the nonparametric statistical analysis. 3) Proposition 9 has an analog in [START_REF] Doumic | Statistical estimation of a growthfragmentation model observed on a genealogical tree[END_REF] for piecewise deterministic growth-fragmentation models, but our proof is somewhat simpler here and sharper (we do not pay the superfluous logarithmic term in [START_REF] Doumic | Statistical estimation of a growthfragmentation model observed on a genealogical tree[END_REF]). 4) Finally, note that in Proposition 9, the observation U n must be deterministic (or at least independent of (X u ) u∈Tn ) otherwise biased selection may occur that would result in completely different behaviours of the empirical means (like for instance if U n is allowed to contain stopping times on the tree).

Statistical estimation

3.1. Nonparametric estimation of Q and ν. Under Assumptions 2, 3 and 4, any Q(x, dy) = q(x, y)dy admits an invariant probability measure ν(dx) = ν(x)dx, the regularity of ν(x) being inherited from that of Q via ν(x) = X q(z, x)ν(dz).

Fix (x 0 , y 0 ) ∈ X × X. We are interested in constructing estimators of q(x 0 , y 0 ) and ν(x 0 ) from the observation X n when both functions satisfy some Hölder regularity properties in the vicinity of (x 0 , y 0 ). To that end, we need approximating kernels.

Definition 10. A function G : X → R is a kernel of order k if it is compactly supported and satisfies X x G(x)dx = 1 { =0} for = 0, . . . , k.

The construction and numerical tractability of approximating kernels is documented in numerous textbooks, see for instance Tsybakov [36, Chapter 1]. For bandwidth parameters

h, h 1 , h 2 > 0, we set G h (y) = h -1 G(h -1 y) and G ⊗2 h1,h2 (x, y) = h -1 1 h -1 2 G(h -1 1 x)G(h -1
2 y and obtain approximations of ν(y 0 ) and q(x 0 , y 0 ) by setting

G h ν(y 0 ) = X G h (y 0 -y)ν(y)dy and G h q(x 0 , y 0 ) = X×X G ⊗2
h1,h2 (x 0x, y 0y)ν(x)q(x, y)dxdy.

The convergence of M Un (ϕ) to ν(ϕ)

suggests to pick ϕ = G h (x 0 -•). Then M Un (G h (x 0 -•)) is close to G h ν(x 0 )
for small enough h and can be used as a proxy of ν(x 0 ). We obtain the estimator

ν n (x 0 ) = M Un G h (x 0 -•) ,
specified by the choice of h > 0 and the kernel G. Likewise, with ψ = G h1,h2 (x 0 -•, y 0 -•), an estimator of q(x 0 , y 0 ) is obtained by considering the quotient estimator with numerator M Un (ψ) that is close to G h1,h2 ν(•)q(•, •) (x 0 , y 0 ) and denominator ν n,h (x 0 ) in order to balance the superfluous weight ν(x 0 ) in the numerator. We obtain the estimator

q n (x 0 , y 0 ) = M Un G ⊗2 h1,h2 (x 0 -•, y 0 -•) M Un G h (x 0 -•) ∨ ,
specified by the choice of h, h 1 , h 2 > 0, a threshold > 0 and the kernel G. In order to quantify the kernel approximation, we introduce anisotropic Hölder classes. For α > 0, we write α = α + {α} with α an integer and 0 < {α} ≤ 1.

Definition 11. Let α, β > 0 and V x0 and V y0 be bounded neighbourhoods of x 0 and y 0 .

i) The function ϕ :

V x0 → R belongs to the Hölder class H α (x 0 ) if (10) |ϕ ( α ) (y) -ϕ ( α ) (x)| ≤ C|y -x| {α} for every x, y ∈ V x0 .
ii) The function ψ :

V x0 × V y0 → R belongs to the anisotropic Hölder class H α,β (x 0 , y 0 ) if x → ψ(x, y 0 ) ∈ H α (x 0 ) and y → ψ(x 0 , y) ∈ H β (y 0 )
hold simultaneously.

We obtain a semi-norm on H α (x 0 ) by setting |ϕ|

H α (x0) = sup x∈Vx 0 |ϕ(x)| + c α (ϕ)
, where c α (ϕ) is the smallest constant for which [START_REF] Valère Bitseki | Adaptive estimation for bifurcating Markov chains[END_REF] holds. Likewise, we equip H α,β (x 0 , y 0 ) with the semi-norm

|ψ| H α,β (x0,y0) = |ψ(•, y 0 )| H α (x0) + |ψ(x 0 , •)| H β (y0) . The space H α,β (x 0 , y 0 ) is appended with (semi) Hölder balls H α,β (x 0 , y 0 )(R) = ψ : X × X → R, |ψ| H α,β (x0,y0) ≤ R , R > 0.
We are ready to state our convergence result over transitions Q that belong to

Q α,β 1/2 (R) = Q 1/2 ∩ H α,β (x 0 , y 0 )(R), R > 0, with a slight abuse of notation.
Theorem 12. Work under Assumptions 2, 3 and 4. Assume that the initial distribution µ is absolutely continuous w.r.t. the Lebesgue measure with a locally bounded density function and satisfies µ(V 2 ) < ∞.

Let α, β > 0. Specify ν n (y 0 ) by a kernel of order k > max{α, β} and h = |U n | -1/(2β+1) and q n (x 0 , y 0 ) with the same kernel and

h 1 = |U n | -s(α,β)/(α∧β)(2s(α,β)+1) , h 2 = |U n | -s(α,β)/β(2s(α,β)+1) and = n → 0. Then, if U n is an -regular incomplete tree, for every R > 0, sup Q∈Q α,β 1/2 (R) E µ ν n (y 0 ) -ν(y 0 ) 2 1/2 |U n | -β/(2β+1)
and sup

Q∈Q α,β 1/2 (R) E µ q n (x 0 , y 0 ) -q(x 0 , y 0 ) 2 1/2 -1 n |U n | -s(α,β)/(2s(α,β)+1)
hold true, where s(α, β) -1 = (α ∧ β) -1 + β -1 is the effective anisotropic smoothness associated with (α, β).

Several remarks are in order: 1) We obtain an optimal result in the minimax sense for estimating ν(y 0 ) and in the case β ≥ α for estimating q(x 0 , y 0 ). This stems from the fact that the representation ν(x) = X ν(y)q(y, x)dy henceforth q ∈ H α,β implies that ν ∈ H β . In turn, the numerator of q n (x 0 , y 0 ) is based on the estimation of the function ν(x)q(x, y) ∈ H α∧β,β . 2) In the estimation of q(x 0 , y 0 ), we have a superfluous term -1 n in the error that can be taken arbitrarily small, and that comes from the denominator of the estimator. It can be removed, however at a significant technical cost. Alternatively, one can get rid of it by weakening the error loss: it is not difficult to prove

E µ q n (x 0 , y 0 ) -q(x 0 , y 0 ) p 1/p |U n | -s(α,β)/(2s(α,β)+1) for every 0 < p < 2,
and the result of course also holds in probability.

3) The assumption that µ is absolutely continuous can also be removed. 4) Finally, a slightly annoying fact is that the estimators ν n (x 0 ) and q n (x 0 , y 0 ) require the knowledge of (α, β) to be tuned optimally, and this is not reasonable in practice. It is possible to tune our estimators in practice by cross-validation in the same spirit as in [START_REF] Hoffmann | Nonparametric estimation of the division rate of an age dependent branching process[END_REF], but an adaptive estimation theory still needs to be established. This lies beyond the scope of the paper, and requires concentration inequalities, a result we do not have here, due to the fact that the model is not uniformly geometrically ergodic (otherwise, we could apply the same strategy as in [START_REF] Valère Bitseki | Adaptive estimation for bifurcating Markov chains[END_REF][START_REF] Biteski-Penda | Local bandwidth selection for kernel density estimation in bifurcating markov chain model[END_REF]).

Parametric estimation of the division rate.

In order to conduct inference on the division rate x → B(x), we need more stringent assumptions on the model so that we can apply the results of Proposition 9. The main difficulty lies in the fact that we need to apply Proposition 9 to test functions of the form ψ(x, y) = log q(x, y) when applied to the loglikelihood of the data, and that these functions are possibly unbounded.

A stochastic trait model as a diffusion on a compact with reflection at the boundary. We circumvent this difficulty by assuming that the trait φ x (t) of each individual evolves in a bounded interval with reflections at the boundary and with no loss of generality, we take X = [0, L] for some L > 0. The dynamics of the traits now follows

dφ x (t) = r(φ x (t))dt + σ(φ x (t))dW t + d t , (11)
where the solution ( t ) t≥0 to t = t 0 (1 {φx(s)=0} + 1 {φx(s)=L} )d s accounts for the reflection at the boundary and (W t ) t≥0 is a standard Brownian motion. Under Assumption 2 (that reduces here to the boundedness of r, σ and the ellipticity of σ) there exists a unique strong solution to [START_REF] Cappé | Inference in Hidden Markov Models[END_REF], see for instance Theorem 4.1. in [START_REF] Tanaka | Stochastic differential equations with reflecting boundary condition in convex regions[END_REF].

A slight modification of Proposition 5 gives the following explicit formulae for the transitions P and Q. Remember that by Assumption 4, we have supp(κ)

⊂ [ε, 1 -ε]. Define D = 0 < y 1 ≤ εL, ε 1-ε y 1 ≤ y 2 ≤ 1-ε ε y 1 ∪ εL ≤ y 1 ≤ (1 -ε)L, ε 1-ε y 1 ≤ y 2 ≤ L-y1 y1 .
Then the explicit formula for p(x, y 1 , y 2 ) given in [START_REF] Biteski-Penda | Local bandwidth selection for kernel density estimation in bifurcating markov chain model[END_REF] remains unchanged provided (x, y 1 , y 2 ) ∈ X×D and it vanishes outside of X × D. For q(x, y), the formula (8) now becomes [START_REF] Cattiaux | Stochastic calculus and degenerate boundary value problems[END_REF] q(x, y) =

1 y/L κ(z) z B(y/z)σ(y/z) -2 E ∞ 0 e -t 0 B(φx(s))ds dL y/z t (φ x ) dz, for (x, y) ∈ X × [0, (1 -ε)L] and 0 otherwise.
Adapting the proof of Proposition 6 to the case of a diffusion living on a compact interval (formally replacing [-w, w] by [0, L] in the proof of Proposition 24 below) one checks that Proposition 6 remains valid in this setting (applying for instance Theorem 4.3.16 in [START_REF] Cappé | Inference in Hidden Markov Models[END_REF]). In turn, Proposition 9 also holds true in the case of a reflected diffusion. For parametric estimation, the control on the variance of M Un (ψ) is less demanding and we will simply need the following Corollary 13. Work under Assumptions 2, 3 and 4 in the case of a reflected diffusion on [0, L] for the evolution of the trait (φ x (t), t ≥ 0). Let ψ : X × X → R. Then, for any probability measure µ, if U n is a -regular incomplete tree, we have sup

Q∈Q 1/2 E µ (M Un (ψ) -ν(Qψ)) 2 |U n | -1 sup x,y ψ(x, y) 2 .
Maximum likelihood estimation. From now on, we fix a triplet (r 0 , σ 0 , κ 0 ) and we let the division rate x → B(x) belong to a parametric class

B = B : X → R, B(x) = B 0 (ϑ, x), x ∈ X, ϑ ∈ Θ ,
where x → B 0 (x, ϑ) is known up to the parameter ϑ ∈ Θ, and Θ ⊂ R d for some d ≥ 1 is a compact subset of the Euclidean space. In this setting, the model is entirely characterised by ϑ which is our parameter of interest. A first minimal stability requirement of the parametric model is the following

Assumption 14. We have Q(B) = {Q = Q(r 0 , σ 0 , B, κ), B ∈ B} ⊂ Q 1/2 .
A second minimal requirement is the identifiability of the class B, namely the fact that the map

B → Q(r 0 , σ 0 , B, κ 0 )
from B to Q is injective. This is satisfied in particular if B satisfies a certain orderliness property.

Definition 15. A class B of functions from X → [0, ∞) is orderly if ϕ 1 , ϕ 2 ∈ B implies either ϕ 1 (x) ≤ ϕ 2 (x) for every x ∈ X or ϕ 2 (x) ≤ ϕ 1 (x) for every x ∈ X.
Proposition 16. Let B be orderly in the sense of Definition 15 and Q(B) ⊂ Q for some (r 0 , σ 0 , κ 0 ).

Then B → Q(r 0 , σ 0 , B, κ 0 ) is injective.
We further stress the dependence on ϑ by introducing a subscript in the notation whenever relevant. We formally obtain a statistical experiment

E n = P n ϑ , ϑ ∈ Θ by letting P n ϑ denote the law of X n = (X u , u ∈ U n
) under P ϑ with initial condition X ∅ distributed according to ν ϑ on the product space X |Un| endowed with its Borel sigma-field. Therefore, the process is supposed to be stationary for simplicity. The experiment E n is dominated by the Lebesgue measure on X |Tn| and we obtain a likelihood-type function by setting

(13) L n ϑ, (X u , u ∈ U n ) = u∈U n q ϑ (X u -, X u ).
Taking any maximiser of ( 13) we obtain a maximum likelihood estimator

ϑ n ∈ argmax ϑ∈Θ L n ϑ, X n
provided a maximiser exists. As noted by a referee, in the case where we observe the full tree, i.e.

U n = T n and thus = 1 in Definition 8, we have access to the observation (X u , X u0 + X u1 ) for every u ∈ T n-1 . Going back to the expression of the transition density of the bifurcating process itself in [START_REF] Biteski-Penda | Local bandwidth selection for kernel density estimation in bifurcating markov chain model[END_REF], we may alternatively maximise the contrast

ϑ → u∈T * n p B ϑ (X u , X u0 , X u1 ) = u∈T n κ X u0 /(X u0 + X u1 ) (X u0 + X u1 )σ(X u0 + X u1 ) 2 B ϑ (X u0 + X u1 ) E ∞ 0 e -t 0 B ϑ (φ Xu (s))ds dL Xu0+Xu1 t (φ Xu ) , or equivalently ϑ → u∈T * n B ϑ (X u0 + X u1 ) E ∞ 0 e -t 0 B ϑ (φ Xu (s))ds dL Xu0+Xu1 t (φ Xu ) .
In particular, the latter contrast does not depend on κ which is merely a nuisance parameter here and that can be ignored, in this specific setting, where one can observe the complete tree (X u , u ∈ T n ).

Convergence results and asymptotic efficiency. We first have an existence and consistency result of ϑ n under the following non-degeneracy assumption that strengthens Assumption 3.

Assumption 17. The function B 0 : Θ × X → [0, ∞) is continuous and for some positive b 3 , b 4 , we have 0 < b 3 ≤ inf ϑ,x B 0 (ϑ, x) ≤ sup ϑ,x B 0 (ϑ, x) ≤ b 4
Moreover, the class B = B 0 (ϑ, •), ϑ ∈ Θ is orderly in the sense of Definition 15.

Theorem 18. Work under Assumptions 2, 4, 14 and 17. Then, for every ϑ ∈ Θ, ϑ n converges to ϑ in probability as n → ∞.

Our next result gives an explicit rate of convergence and asymptotic normality for ϑ n . We need further regularity assumptions. Assumption 19. The set Θ has non empty interior and, for every x ∈ X the map ϑ → B 0 (ϑ, x) is three times continuously differentiable. Moreover, for every 1 ≤ i, j, k ≤ d:

sup ϑ,x |∂ ϑi B 0 (ϑ, x)| + sup ϑ,x |∂ 2 ϑiϑj B 0 (ϑ, x)| + sup ϑ,x |∂ 3 ϑiϑj ϑ k B 0 (ϑ, x)| < ∞.
Introduce the Fisher information operator

Ψ(ϑ) = ν ϑ Q ϑ (∂ ϑ log q ϑ )(∂ ϑ log q ϑ ) T at point ϑ ∈ Θ as the d × d-matrix with entries: Ψ(ϑ) i,j = ν ϑ Q ϑ ∂ ϑi q ϑ ∂ ϑj q ϑ q 2 ϑ = X×X ∂ ϑi q ϑ (x, y) ∂ ϑj q ϑ (x, y) q ϑ (x, y) 2 ν ϑ (x)q ϑ (x, y)dxdy, for 1 ≤ i, j ≤ d.
Assumption 20. For every ϑ in the interior of Θ, the matrix Ψ(ϑ) is nonsingular.

Although standard in regular parametric estimation, Assumption 20 is not obviously satisfied even if we have the explicit formula [START_REF] Cattiaux | Stochastic calculus and degenerate boundary value problems[END_REF], for q ϑ (x, y), due to its relatively intricate form. We can however show that it is satisfied in the special case of a trait evolving as a reflected diffusion with constant drift. More general parametrisations are presumably possible, adapting the proof delayed until Appendix 6.5.

Proposition 21. Assume d = 1, B 0 (ϑ, x) = ϑ for every x ∈ X, with Θ = [ϑ 1 , ϑ 2 ] ⊂ (0, ∞), r(x) = r 1 < 0 and σ(x) = σ 0 > 0 for every x ∈ X. Let κ(z) = (1 -2ε) -1 for every z ∈ [ε, 1 -ε].
There exists an explicit open interval I ⊂ (0, 1/2) such that Assumption 20 is satisfied as soon as ε ∈ I.

We are ready to state our final result on asymptotic normality of ϑ n .

Theorem 22. Work under Assumptions 2, 4, 14, 17, 19 and 20. For every ϑ in the interior of Θ, if U n is a -regular incomplete tree, we have

U n 1/2 ( ϑ n -ϑ) → N 0, Ψ(ϑ) -1
in distribution as n → ∞, where N(0, Ψ(ϑ) -1 ) denote the d-dimensional Gaussian distribution with mean 0 and covariance the inverse of the Fisher matrix Ψ(ϑ).

Several remarks are in order: 1) Although asymptotically optimal, the practical implementation of ϑ n is a challenging question that we plan to address in a systematic way. 2) As for classical estimation in diffusion processes (see e.g. [START_REF] Dacunha-Castelle | Estimation of the coefficients of a diffusion from discrete observations[END_REF][START_REF] Genon | On the estimation of the diffusion coefficient for multi-dimensional diffusion processes[END_REF]), the assumptions of Theorem 22, especially Assumption 20 are standard. However, the fact that they hold true in the simple case of Proposition 21 and a glance at the proof is an indication that they are certainly true in wider generality.

Numerical implementation

We consider the implementation of the estimator ϑ n in the case of a branching population structured by a trait drawn according to a Brownian motion reflected on [0, 1], namely

φ x (t) = x + W t + t , t = t 0 (1 {φx(s)=0} + 1 {φx(s)=1} )d s , t ≥ 0,
where (W t ) t≥0 is a standard Brownian motion. We pick κ(z) = (1 -2ε) -1 1 [ε,1-ε] (z) so that an individual with trait x at division splits into two individuals with traits U x and (1 -U )x respectively, where U is uniformly distributed on [ε, 1ε]. We pick ε = 10 -4 . 4.1. Generation of simulated data. We test our estimation procedure on simulated data. Given a division rate B and an initial trait x 0 ∈ R, we construct a dataset constituted of a full tree of size |T n | = 2 n+1 -1 using a queue.

Initialisation step. We begin with one individual in the queue with trait x 0 at time 0. It is the ancestor of the population While step. While the queue is not empty, we pick u in the queue, i) we simulate the dynamics (φ Xu (t), 0 ≤ t ≤ T ) for the trait of u using the Euler scheme for reflected stochastic differential equations of [START_REF] Lépingle | Euler scheme for reflected stochastic differential equations[END_REF] with initial condition X u and time step ∆t until time T , for some T sufficiently large, ii) we draw the lifetime ζ u of u by rejection sampling, iii) if |u| ≤ n -1, we add to the queue two new individuals with respective traits at birth given by X u0 = ηx and X u1 = (1η)x where η is a realisation of a uniform random variable on [ε, 1ε] and x = φ Xu (ζ u ) is the trait of u at division, iv) we add the pairs (X u , X u0 ) and (X u , X u1 ) to the dataset, v) we remove the individual u from the queue. Figure 2. The contrast L n ϑ, (X u , u ∈ T n ) for n = 14 and B(x, ϑ) ≡ 2 with ∆ϑ = 0.05 (left) and ∆ϑ = 0.01 (right). We look at the results only for ∆ϑ = 0.05 because for smaller values of the increment, the noise due to computational errors is too important compared to the different values of the contrast.

4.2.

Implementation of the maximum likelihood type contrast. We pick U n = T n . For a given dataset X n , we approximate L n ϑ, (X u , u ∈ T n ) using, for a given ϑ, the nonparametric estimator q n (X u -, X u ) introduced in Section 3.1.

More specifically, we implement q n (x 0 , y 0 ) =

M Un G ⊗2 h 1 ,h 2 (x0-•,y0-•) M Un G h (x0-•) ∨
for every (x 0 , y 0 ) on a grid of

mesh n -1 1 × n -1 2 of [0, 1] × [0, 1] with n 1 = n 2 = 200, G(x) = (2π) -1/2 exp(-x 2 /2), h = 2|T n | -1/3 , h 1 = h 2 = 10 -1 • h 1/2 ,
= 10 -6 . We next use an interpolation scheme with splines provided by the package Interpolations in Julia [START_REF] Bezanson | Julia: A fresh approach to numerical computing[END_REF] to compute the value of the transition at each point of the dataset (X u -, X u ) ∈ X n . For synthetic data, we pick n = 19, resulting in a tree of size 2 20 -1 = 1 048 575 with initial value x 0 = 0.5 and ∆t = 5 × 10 -4 . 4.3. Results. We consider the following parametric classes B 0 (ϑ, x) = ϑ and B 1 (ϑ, x) = 1 + ϑx. We compute 300 Monte-Carlo samples of size |T n | = 2 15 -1 = 32 767 for ϑ = ϑ 1 = 2 and ϑ = ϑ 2 = 15 in both cases. Therefore, we apply our results to four different cases. In each case, we approximate q ϑ (X u -, X u ) for different values of ϑ ∈ Θ = [ϑ min , ϑ max ] and we compute the corresponding ϑ n . We progressively reduce the increment ∆ϑ for the choice of ϑ until the contrast of likelihood starts to be noisy (see Figure 2), adapting at each level the choice for the upper and lower bounds of Θ. The results are displayed in Table 1. We recover the parameter in all four cases, with various accuracies. The most accurate value is obtained for B 1 with a small value of the parameter, i.e. ϑ = 2. We did not reach the optimal accuracy |T n | -1/2 ≈ 6 × 10 -3 . One could presumably obtain a better accuracy by choosing a finer discretisation of [0, 1] × [0, 1] for the computation of the q n . But this choice leads to an important increase of the computational time. The results in the case of a linear division rate are less accurate. Those results could also probably be improved using a cross-validation procedure for the choice of the bandwidth parameters h, h The third and fourth columns corresponds respectively to the mean value and the standard deviation of ϑ n , computed with 300 different data sets of size 2 n+1 -1 = 32767. The fifth and sixth columns correspond to a 95% confidence interval. The last column corresponds to the value of the step for the discretisation of Θ, which limits the accuracy of the result.

Proofs

5.1. Proof of Proposition 5. We first prove [START_REF] Biteski-Penda | Local bandwidth selection for kernel density estimation in bifurcating markov chain model[END_REF]. By (3), for any bounded ψ : X 3 → R and x ∈ X, we have where we set y 1 = 1-z z y 0 in order to obtain the last line and where (L y t (φ x )) t≥0 is the local time of φ x at y ∈ X. The integral is taken over the domain

Pψ(x) = E 1 0 κ(z) ∞ 0 ψ x, zφ x (t), (1 -z)φ x (t) B φ x (t) e -t 0 B(φx(s))ds dtdz = R 1 0 ψ x, y 0 , 1-z z y 0 B y 0 /z σ(y 0 /z) -2 E ∞ 0 e -t 0 B(φx(s))ds dL y0/z t (φ x ) κ(z) z dzdy 0 (14)
D = (y 0 , y 1 ) ∈ R 2 , ε 1-ε y 0 ≤ y 1 ≤ 1-ε ε y 0 ⊂ supp (y 0 , y 1 )
→ κ(y 0 /(y 0 + y 1 )) therefore the above integral is well defined and the representation (7) is proved. We turn to [START_REF] Valère Bitseki Penda | Deviation inequalities, moderate deviations and some limit theorems for bifurcating Markov chains with application[END_REF]. From ( 14), we get

P 0 ϕ(x) = R 1 0 ϕ(y 0 )B y 0 /z σ(y 0 /z) -2 E ∞ 0 e -t 0 B(φx(s))ds dL y0/z t (φ x ) κ(z) z dzdy 0 and P 1 ϕ(x) = R 1 0 ϕ 1-z z y 0 B y 0 /z σ(y 0 /z) -2 E ∞ 0 e -t 0 B(φx(s))ds dL y0/z t (φ x ) κ(z) z dzdy 0 = R 1 0 ϕ y 1 B y 1 /z σ(y 1 /z) -2 E ∞ 0 e -t 0 B(φx(s))ds dL y1/z t (φ x ) κ(1 -z) z dzdy 1 ,
where the second equality is given by two successive changes of variables y 1 = 1-z z y 0 and z = 1z. Finally,

Qϕ(x) = 1 2 P 0 ϕ(x) + P 1 ϕ(x) = R 1 0 ϕ(y)B y/z σ(y/z) -2 E ∞ 0 e -t 0 B(φx(s))ds dL y/z t (φ x ) κ(z) z dzdy,
where κ(z) = 1 2 (κ(z) + κ(1z)). Since supp(κ) ⊂ [ε, 1ε], the above integrals are well defined and ( 8) is established.

5.2.

Proof of Proposition 6. The proof goes along a classical path: we establish a drift and a minorisation condition in Proposition 23 and 24 below, and then apply for instance Theorem 1.2. in [START_REF] Hairer | Yet another look at Harris' ergodic theorem for Markov chains[END_REF], see also the references therein.

Proposition 23 (Drift condition). Let V (x) = x 2 . Work under Assumptions 2, 3 and 4. There

exist explicitly computable 0 < v 1 = v 1 (ε) < 1 and v 2 = v 2 (ε, r 1 , r 2 , σ 1 , σ 2 , b 1 ) > 0 such that QV (x) ≤ v 1 V (x) + v 2 .
Proposition 24 (Minorisation condition). Work under Assumption 2, 3 and 4. For large enough w > 0, there exists λ ∈ (0, 1) and a probability measure µ on X such that

inf {x,|x|≤w} Q(x, A) ≥ λµ(A)
for every Borel set A ⊂ X.

Proof of Proposition 23. Fix x ∈ X and let m(κ) = 1 0 z 2 κ(z)dz. By Itô formula, we obtain the decomposition

QV (x) = 1 0 κ(z) ∞ 0 E z 2 φ x (t) 2 B φ x (t) e -t 0 B(φx(s))ds dtdz = m(κ)(I + II + III + IV ),
where

I = x 2 ∞ 0 E B φ x (t) e -t 0 B(φx(s))ds dt, II = 2 ∞ 0 E t 0 φ x (u)r(φ x (u))du B φ x (t) e -t 0 B(φx(s))ds dt, III = ∞ 0 E t 0 σ φ x (u) 2 du B φ x (t) e -t 0 B(φx(s))ds dt, IV = 2 ∞ 0 E t 0 φ x (u)σ φ x (u) dW u B φ x (t) e -t 0 B(φx(s))ds dt.
First, note that ∞ 0 B(φ x (t))e -t 0 B(φx(s))ds dt = 1 holds since B(φ x (t)) ≥ b 1 > 0 by Assumption 3, therefore I = x 2 by Fubini's theorem. We turn to II. By Fubini's theorem again:

II = 2 E ∞ 0 φ x (u)r φ x (u) ∞ u B φ x (t) e -t 0 B(φx(s))ds dt du = 2 E ∞ 0 φ x (u)r φ x (u) e -u 0 B(φx(s))ds du = 2 R zr(z)σ(z) -2 E ∞ 0 e -t 0 B(φx(s))ds dL z t (φ x ) dz.
where we used again that e -∞ 0 B(φx(s))ds = 0 since B(φ x (t)) ≥ b 1 > 0 by Assumption 3 for the second equality and the occupation times formula for the last equality. By Assumption 2 we have zr(z) < 0 for |z| ≥ r 2 , therefore:

II ≤ 2 r2 -r2 zr(z)σ(z) -2 E ∞ 0 e -t 0 B(φx(s))ds dL z t (φ x ) dz ≤ 2r 1 r 2 (1 + r 1 )σ -2 1 r2 -r2 E ∞ 0 e -t 0 B(φx(s))ds dL z t (φ x ) dz ≤ 2r 1 r 2 (1 + r 1 )σ -2 1 ∞ 0 e -b1t P -r 2 ≤ φ x (t) ≤ r 2 dt ≤ 2r 1 r 2 (1 + r 1 )σ -2 1 b -1 1 .
using successively Assumption 2, 3 and the occupation times formula. For the term III, by Fubini's theorem, we have

III = ∞ 0 E σ φ x (u) 2 ∞ u B φ x (t) e -t 0 B(φx(s))ds du = ∞ 0 E σ(φ x (u)) 2 e -u 0 B(φx(s))ds du
and this last quantity is less than

σ 2 2 ∞ 0 e -b1t dt = σ 2 2 b -1 1
by Assumption 2 and 3. Similarly for the term IV, we have

IV = 2 E ∞ 0 σ φ x (u) ∞ u B φ x (t) e -t 0 B(φx(s))ds dtdW u = 2 E ∞ 0 σ φ x (u) e -u 0 B(φx(s))ds dW u
and this last quantity vanishes. Putting the estimates for I, II, III and IV together, we conclude

QV (x) ≤ m(κ)x 2 + m(κ)(2r 1 r 2 (1 + r 1 )σ -2 1 + σ 2 2 )b -1 1 . Since supp(κ) ⊂ [ε, 1-ε], we have m(κ) ≤ (1-ε) 2 < 1 and this completes the proof with v 1 = m(κ) and v 2 = m(κ)(2r 1 r 2 (1 + r 1 )σ -2 1 + σ 2 2 )b -1 1 .
Proof of Proposition 24.

Step 1). Let x ∈ [-w, w] and A ⊂ X be a Borel set. Applying Assumption 3, introducing the event W(φ x (t)) = {2w ≤ φ x (t) ≤ 2w (1ε)/ε)}, applying Fubini's theorem and a change of variable, we successively obtain

Q(x, A) = 1 0 κ(z) ∞ 0 E 1 {zφx(t)∈A} B φ x (t) e -t 0 B(φx(s))ds dtdz ≥ b 1 1 0 κ(z) ∞ 0 E 1 W(φx(t)) 1 {zφx(t)∈A} e -t 0 B φx(s) ds dtdz = b 1 ∞ 0 E 1 W(φx(t)) e -t 0 B(φx(s))ds φx(t) 0 1 {y∈A} κ y/φ x (t) φ x (t) -1 dy dt.
Using again Fubini's theorem, we get

Q(x, A) ≥ R 1 {y∈A} f (x, y)dy, with f (x, y) = b 1 ∞ 0 E 1 W(φx(t)) 1 {y≤φx(t)} e -t 0 B(φx(s))ds κ y/φ x (t) φ x (t) -1 dt.
Step 2). We now prove that f is bounded below independently of x. By Assumption 4, κ y/φ x (t) > δ for all y ∈ [εφ x (t), (1ε)φ x (t)] so that

f (x, y) ≥ δb 1 ∞ 0 E 1 W(φx(t)) 1 {εφx(t)≤y≤(1-ε)φx(t)} e -t 0 B(φx(s))ds φ x (t) -1 dt. Next, as W(φ x (t)) {εφ x (t) ≤ y ≤ (1 -ε)φ x (t)} ⊇ W(φ x (t)) {2w ε(1 -ε) ≤ y ≤ 2w(1 -ε)}, we get f (x, y) ≥ δb 1 2w (1 -ε)/ε 1 2w √ ε(1-ε)≤y≤2w(1-ε) h(x, y), where h(x, y) = ∞ 0 E 1 W(φx(t)) e -t 0 B(φx(s))ds dt. Let ∆ = (1 + (1 -ε)/ε)w denote the mid- point of the interval [2w, 2w (1 -ε)/ε]. Let also T x y = inf {t > 0, φ x (t) ≥ y} denote the exit time of the interval (inf X, y) by (φ x (t)) t≥0 . It follows that h(x, y) ≥ E ∞ T x ∆ 1 W(φx(t)) e -t 0 B(φx(s))ds dt = ∞ 0 E 1 W(φx(t+T x ∆ )) e -t+T x ∆ 0 B(φx(s))ds dt = ∞ 0 E 1 W(φx(t+T x ∆ )) e -T x ∆ 0 B(φx(s))ds e -t 0 B(φx(s+T x ∆ ))ds dt ≥ ∞ 0 E 1 W(φx(t+T x ∆ )) e -T x ∆ (b2∆ γ +b1) e -t 0 B(φx(s+T x ∆ ))ds dt,
by Assumption 3 and because φ x (s) ≤ ∆ for every s ≤ T x ∆ . Applying the strong Markov property, we further obtain [START_REF] Benoîte De Saporta | Random coefficients bifurcating autoregressive processes[END_REF] h(x, y) [START_REF] Benoîte De Saporta | Random coefficients bifurcating autoregressive processes[END_REF] and Assumption 3 again, it follows that

≥ ∞ 0 E 1 W(φ∆(t)) e -T x ∆ (b2∆ γ +b1) e -t 0 B(φ∆(s))ds dt since φ x (T x ∆ ) = ∆ for x ≤ w < ∆. Introduce next T ∆ W = inf{t ≥ 0, φ ∆ (t) / ∈ [2w, 2w (1 -ε)/ε]}, i.e. the exit time of [2w, 2w (1 -ε)/ε] by (φ ∆ (t)) t≥0 . By
h(x, y) ≥ E T ∆ W 0 1 W(φ∆(t)) e -T x ∆ (b2∆ γ +b1) e -t 0 (b2|φx(s)| γ +b1)ds dt ≥ E T ∆ W 0 1 W(φ∆(t)) e -T x ∆ (b2∆ γ +b1) e -tv3 dt , using that φ x (t) ≤ 2w (1 -ε)/ε for t ≤ T ∆ W and where v 3 = b 2 (2w (1 -ε)/ε) γ + b 1 . Since ∆ > -w, the event {T x ∆ ≤ T -w ∆ } holds almost-surely for every x ∈ [-w, w] and therefore (16) h(x, y) ≥ E T ∆ W 0 e -T -w ∆ (b2∆ γ +b1) e -tv3 dt ≥ v -1 3 E e -T -w ∆ (b2∆ γ +b1) E 1 -e -T ∆ W v3 .
by the independence of T ∆ W and T -w ∆ . Furthermore, for every a, x ∈ X with x < a, we have

P (T x a < ∞) = lim u→-∞ s(u) -s(x) s(u) -s(a) ,
where s(x) =

x inf X exp(-2 y inf X r(z)σ(z) -2 dz)dy, is the scale function associated to (φ x (t)) t≥0 . By the classical Feller classification of scalar diffusions (see e.g. Revuz and Yor [START_REF] Revuz | Continuous martingales and Brownian motion, volume 293 of Grundlehren der Mathematischen Wissenschaften[END_REF]), we have the equivalence P (T x a < ∞) = 0 if only if inf X s(x)dx = 0 but that latter property contradicts Assumption 2. Therefore, there exist w 1 , δ 1 > 0 such that P(T -w ∆ ≤ w 1 ) > δ 1 . It follows that ( 17) E e -T -w ∆ (b2∆ γ +b1) ≥ E e -w1(b2∆ γ +b1) 1 {T -w ∆ ≤w1} ≥ δ 1 e -w1(b2∆ γ +b1) and since T ∆ W > 0 almost surely, there exists δ 2 > 0, independent of x, such that (18) E 1e -T ∆ W v3 > δ 2 . Back to [START_REF] Doumic | Nonparametric estimation of the division rate of a size-structured population[END_REF], putting together ( 17) and ( 18), we obtain

h(x, y) ≥ v -1
3 δ 1 e -w1(b2∆ γ +b1) δ 2 and eventually

f (x, y) ≥ δb 1 δ 1 δ 2 2w (1 -ε)/εv 3 1 2w √ ε(1-ε)≤y≤2w(1-ε) e -w1(b2∆ γ +b1) .
Step 3). Define the probability measure µ(dy) = f (y)dy on X by

f (y) = 1 2w 1 -ε -ε(1 -ε) 1 2w √ ε(1-ε)≤y≤2w(1-ε)
,

and let λ = (1 -ε -ε(1 -ε)) b1δδ1δ2 √ (1-ε)/εv3
e -w1(b2∆ γ +b1) . We may assume that 0 < λ < 1 (the lower bound remains valid if we replace δ by δ < δ for instance) and we thus have established

Q(x, A) ≥ λµ(A),
for an arbitrary Borel set A ⊂ X. The proof of Proposition 24 is complete.

Proof of Proposition 9.

Preparations. We first state a useful estimate on the local time of L y t (φ x ) as t → ∞. Its proof is delayed until Appendix 6.2.

Lemma 25. Work under Assumption 2. For every compact K ⊂ X and for every t ≥ 0, we have

sup x∈X,y∈K E [L y t (φ x )] 1 + t 3/2 ,
up to a constant that only depends on r 1 , r 2 and σ 2 . In particular, for every c > 0, the function

y → ∞ 0 e -ct sup x∈X E [L y t (φ x )] dt
is well-defined and locally bounded, uniformly over Q.

Lemma 25 enables us to obtain estimates on the action of P and Q on functions ψ : X × X → R with nice behaviours that will prove essential for obtaining Proposition 9. We set Qψ(x) = X ψ(x, y)q(x, y)dy, P(ψ ⊗ ψ)(x) = X×X ψ(x, y 1 )ψ(x, y 2 )p(x, y 1 , y 2 )dy 1 dy 2 , where p(x, y 1 , y 2 ) and q(x, y) are given in Proposition 5.

Lemma 26. Work under Assumptions 2, 3 and 4. Let ψ : X × X → R be bounded and such that ψ has compact support. There exists a constant c supp(ψ ) depending on supp(ψ ) (and Q) such that, for i = 0, 1:

(19) |P i ψ(x)| ≤ c supp(ψ ) X |ψ(x, y)|dy and |P(ψ ⊗ ψ)(x)| ≤ c supp(ψ ) ψ (x) X |ψ(x, y)|dy.
Note in particular that [START_REF] Guyon | Limit theorems for bifurcating Markov chains. Application to the detection of cellular aging[END_REF] implies in turn the estimates ( 20)

|Qψ(x)| ≤ c supp(ψ ) X |ψ(x, y)|dy,
and, for i = 0, 1:

|QP i ψ(x)| ≤ c 2 supp(ψ ) |ψ| 1 ∧ c supp(ψ ) X ψ (y)dy |ψ| ∧1 .
Proof. By Assumption 3, we have

|P 0 ψ(x)| = 1 0 κ(z) ∞ 0 E ψ(x, zφ x (t))B φ x (t) e -t 0 B(φx(s))ds dtdz ≤ 1 0 κ(z) ∞ 0 E ψ(x, zφ x (t)) b 2 |φ x (t)| γ + b 1 e -b1t dtdz ≤ 1 0 κ(z) ∞ 0 E ψ(x, zφ x (t)) b 2 |φ x (t)| γ + b 1 ∞ t b 1 e -b1s ds dtdz.
Next, by Fubini's theorem and the occupation times formula, we derive

|P 0 ψ(x)| ≤ 1 0 κ(z) ∞ 0 b 1 e -b1s s 0 E |ψ(x, zφ x (t))|(b 2 |φ x (t)| γ + b 1 ) dtdsdz ≤ 1 0 κ(z) ∞ 0 b 1 e -b1s R |ψ(x, zy)|(b 2 |y| γ + b 1 )σ(y) -2 E[L y s (φ x )]dydsdz = 1 0 κ(z)z -1 ∞ 0 b 1 e -b1s R |ψ(x, y)|(b 2 |y/z| γ + b 1 )σ(y/z) -2 E[L y/z s (φ x )]dydsdz ≤ c supp(ψ ) R |ψ(x, y)|dy,
and ( 19) is proved for i = 0 with

c supp(ψ ) = sup y∈supp(ψ ),x∈X,z∈[ε,1-ε] b 1 (b 2 |y/z| γ + b 1 )σ(y/z) -2 z -1 ∞ 0 e -b1s E[L y/z s (φ x )]ds.
This last quantity is finite by Lemma 25. Following the same steps as for P 1 we get [START_REF] Guyon | Limit theorems for bifurcating Markov chains. Application to the detection of cellular aging[END_REF] for i = 1.

For the second estimate, we have

|P(ψ ⊗ ψ)(x)| ≤ 1 0 κ(z) ∞ 0 E ψ x, zφ x (t) ψ x, (1 -z)φ x (t) B(φ x (t))e -t 0 B(φx(s))ds dtdz ≤ P 0 ψ(x) sup y ψ(x, y)
and we conclude by applying [START_REF] Hairer | Yet another look at Harris' ergodic theorem for Markov chains[END_REF].

Completion of proof of Proposition 9. Without loss of generality, we may assume that ν(Qψ) = 0, the general case being obtained by considering the function ψ(x, y)ν(Qψ). Of course, the compact support property is lost by adding a constant and one has to be careful when revisiting the estimates of Step 2) to Step 4) below. They exhibit additional error terms that all have the right order using Lemma 26 and the fact that P1 = Q1 = 1.

By (ii) of Definition 8 we may (and will) assume that for some 0 ≤ ≤ 1 and some positive constants c 1 , c 2 that do not depend on n, we have

c 1 2 m ≤ G m ∩ U n ≤ c 2 2 m for every m = 1, . . . , n.
We first consider the case > 0. The case = 0 requires a slightly different method and will be handled in a second phase.

Step 1). We start with a standard preliminary decomposition, see for instance [START_REF] Valère Bitseki Penda | Deviation inequalities, moderate deviations and some limit theorems for bifurcating Markov chains with application[END_REF][START_REF] Valère Bitseki | Transportation and concentration inequalities for bifurcating Markov chains[END_REF], expanding the sum in u ∈ U n .

We have

E µ [M Un (ψ) 2 ] = |U n | -2 E µ n m=1 u∈Gm∩Un ψ(X u -, X u ) 2 ≤ |U n | -2 n m=1 E µ u∈Gm∩Un ψ(X u -, X u ) 2 1/2 2
by triangle inequality. Thus Proposition 9 amounts to control

E µ u∈Gm∩Un ψ(X u -, X u ) 2 = I m + II m ,
with

I m = E µ u∈Gm∩Un ψ(X u -, X u ) 2 , II m = E µ u,v∈Gm∩Un,u =v ψ(X u -, X u )ψ(X v -, X v ) ,
and the convention ∅ = 0.

Step 2). The control of the term I m is straightforward: by Lemma 26 we have

I 1 = |G 1 ∩ U 1 | µ(Qψ 2 ) ≤ c 2 2 c supp(ψ ) X×X ψ(x, y) 2 µ(dx)dy for m = 1, I m = |G m ∩ U m | µ(Q m ψ 2 ) ≤ c 2 2 m (c 2 supp(ψ ) |ψ 2 | 1 ∧ c supp(ψ ) |ψ 2 | 1 ) for m ≥ 2, therefore I m 2 m |ψ 2 | µ holds for every m ≥ 1. In the case ν(Qψ) = 0, we replace |ψ 2 | µ by |ψ 2 | µ+ν .
Step 3). We further decompose the main term II m = III m + IV m , having

III m = E µ w∈Gm-1∩Un,(w0,w1)∈U 2 n ψ(X w , X w0 )ψ(X w , X w1 ) , IV m = E µ u,v∈Gm-1∩Un,u =v ui,vj∈Un,i,j=0,1 ψ(X u , X ui )ψ(X v , X vj ) .
The control of III m is straightforward:

III m = E µ w∈Gm-1∩Un P(ψ ⊗ ψ)(X w ) = |G m-1 ∩ U n | µ Q m-1 P(ψ ⊗ ψ) .
In the same way as for the term I m , by Lemma 26, one readily checks that |III m | 2 (m-1) |ψ ψ| µ .

Step 4). We now turn to the main term IV m . Writing here u ∧ v for the most common recent ancestor of u and v, conditioning w.r.t. F |u∧v|+1 and using the conditional independence of (X u , X ui ) and (X v , X vj ) given F |u∧v|+1 thanks to the BMC property (3), we successively obtain

IV m = E µ u,v∈Gm-1∩Un,u =v ui,vj∈Un,i,j=0,1 E µ ψ(X u , X ui )ψ(X v , X vj ) F |u∧v|+1 = E µ u,v∈Gm-1∩Un,u =v ui,vj∈Un,i,j=0,1 E µ ψ(X u , X ui ) F |u∧v|+1 E µ ψ(X v , X vj ) F |u∧v|+1 = E µ u,v∈Gm-1∩Un,u =v ui,vj∈Un,i,j=0,1 E µ P i ψ(X u ) F |u∧v|+1 E µ P j ψ(X v ) F |u∧v|+1 = E µ u,v∈Gm-1∩Un,u =v ui,vj∈Un,i,j=0,1 Q m-2-|u∧v| P i ψ(X u * )Q m-2-|u∧v| P j ψ(X v * ) ,
where u * (respectively v * ) is the descendant of u ∧ v which is an ancestor of u (respectively v). Conditioning further w.r.t. F |u∧v| we obtain

IV m = E µ u,v∈Gm-1∩Un,u =v ui,vj∈Un,i,j=0,1 P Q m-2-|u∧v| P i ψ ⊗ Q m-2-|u∧v| P j ψ (X u∧v ) = u,v∈Gm-1∩Un,u =v ui,vj∈Un,i,j=0,1 µ Q |u∧v| P(Q m-2-|u∧v| P i ψ ⊗ Q m-2-|u∧v| P j ψ) = m-1 l=1 u,v∈Gm-1∩Un,|u∧v|=m-l-1 ui,vj∈Un,i,j=0,1 µ Q m-l-1 P(Q l-1 P i ψ ⊗ Q l-1 P j ψ) ,
obtaining the last term by rearranging the sum u, v ∈ G m-1 that expands over indexes |u|-|u∧v| = m-1-|u∧v| that vary from 1 to m-1. By Lemma 26 and Proposition 6 one obtains the following estimates for all i, j = 0, 1:

|µ Q m-2 P (P i ψ ⊗ P j ψ) | |ψ | 1 |ψ| ∧1 for l = 1,
and for l ≥ 2:

|µ Q m-l-1 P(Q l-1 P i ψ ⊗ Q l-1 P j ψ) | |ψ| 2 ∧1 ∧ ρ 2(l-1) |ψ | 2 1 µ Q m-l-1 P((1 + V ) ⊗ (1 + V )) .
In the case ν(Qψ) = 0, we replace |ψ| ∧1 by |ψ| ν . We claim that [START_REF] Hoang | Estimating the division kernel of a size-structured population[END_REF] µ Q m-l-1 P((1

+ V ) ⊗ (1 + V )) 1 + µ(V 2 )
and postpone the proof of (21) to Step 6 below. Notice also that for l = 1, . . . , m -1,

{u = v ∈ G m-1 ∩ U n , |u ∧ v| = m -l -1} 2 m × 2 l ,
where 2 m is an upper bound for the number of choices for u (the first descendant in generation m -1 of the ancestor from generation ml -1) and 2 l is the (order of the) number of choices of v (the second descendant, satisfying u ∧ v ∈ G m-l-1 ) in the worst case where there is a full subtree with l generations. It follows that for any p ≥ 1:

|IV m | 2 m |ψ | 1 |ψ| ∧1 + 2 m ∞ l=1 2 l |ψ| 2 ∧1 ∧ ρ 2(l-1) |ψ | 2 1 1 + µ(V 2 ) ≤ 2 m |ψ | 1 |ψ| ∧1 + 2 m |ψ| 2 ∧1 p l=1 2 l + |ψ | 2 1 1 + µ(V 2 ) ∞ l=p+1 2 -l (2ρ) 2l 2 m |ψ | 1 |ψ| ∧1 + 2 m |ψ| 2 ∧1 2 p + |ψ | 2 1 1 + µ(V 2 ) 2 -p
where we crucially used the fact that ρ ≤ 2 -1 . Then, taking the infimum over all p ≥ 1, we get

|IV m | 2 m |ψ | 1 |ψ| ∧1 + 2 m |ψ | 1 |ψ| ∧1 1 + µ(V 2 ) inf p≥1 |ψ| ∧1 |ψ | 1 2 p + |ψ | 1 |ψ| ∧1 2 -p . As |ψ| ∧1 ≤ |ψ | 1 , we get that inf p≥1 |ψ|∧1 |ψ |1 2 p + |ψ |1 |ψ|∧1 2 -p 1 and
|IV m | 2 ρm 1 + µ(V 2 ) |ψ | 1 |ψ| ∧1 .
Step

E µ u∈Gm∩Un ψ(X u -, X u ) 2 2 m |ψ 2 | µ + |ψ ψ| µ + 1 + µ(V 2 ) |ψ | 1 |ψ| ∧1 .
In the case ν(Qψ) = 0, we replace Step 6). It remains to establish [START_REF] Hoang | Estimating the division kernel of a size-structured population[END_REF]. We only sketch the argument which is similar to the proof of Proposition 23. First, one obtains

P((1 + V ) ⊗ (1 + V )) 1 + QV (x) + QV 2 (x),
and it follows that

µ(Q m-l-1 P (1 + V ) ⊗ (1 + V )) 1 + µ(Q m-l V ) + µ(Q m-l V 2 ) 1 + µ(V ) + µ(Q m-l V 2 )
by Proposition 23. Applying Itô's formula and using Assumptions 2 and 3 on can check that

QV 2 (x) 1 + V (x) 2 + QV (x) 1 + V (x) 2
by Proposition 23 again. We obtain (21) by integrating w.r.t. µ. Finally the case = 0 has to be treated separately mainly for notational reason, the proof following the same line as in the case > 0. We delay it until Appendix 6.3.

Proof of Theorem 12.

Preparations. We first establish local estimates on the invariant density ν.

Lemma 27. Work under Assumptions 2, 3 and 4. Let Q ∈ Q and let ν be the associated invariant density of Proposition 6. Let x 0 ∈ X. There exist positive constants c i = c i (x 0 , Q) and a bounded neighbourhood V x0 with non-empty interior such that

0 < c 1 ≤ inf x∈Vx 0 ν(x) ≤ sup x∈Vx 0 ν(x) ≤ c 2 . Moreover, 0 < inf Q∈Q c 1 (x 0 , Q) ≤ sup Q∈Q c 2 (x 0 , Q) < ∞. Proof. Let V x0 = [a, b] ⊂ X be a bounded neighbourhood of x 0 and V ε x0 = a/(1 -ε) ∧ a/ε, b/ε ∨ b/(1 -ε) . Let x ∈ V x0
. By Proposition 5, using Assumptions 2 and 3, we obtain

ν(x) = X ν(y)q(y, x)dy = X ν(y) 1 0 κ(z) z B(x/z)σ(x/z) -2 E ∞ 0 e -t 0 B(φy(s))ds dL x/z t (φ y ) dzdy ≤ X ν(y) 1 0 (b 2 |x/z| γ + b 1 ) κ(z) z σ -2 1 E ∞ 0 e -b1t dL
x/z t (φ y ) dzdy.

Noticing that for all z ∈ [ε, 1ε] and x ∈ V x0 , x/z ∈ V ε x0 and using Assumption 4, we get

ν(x) ≤ (b 2 |x| γ + b 1 )ε -(1+γ) σ -2 1 X ν(y) sup x∈V ε x 0 E ∞ 0 e -b1t dL x t (φ y ) dy = (b 2 |x| γ + b 1 )ε -(1+γ) σ -2 1 b 1 X ν(y) ∞ 0 e -b1t sup x∈V ε x 0 E L x t (φ y ) dtdy,
where the last equality comes from the integration by parts formula, see Appendix 6.4 for a detailed version. By Lemma 25, we have sup x∈V ε

x 0 E L x t (φ y ) 1 + t 3/2 uniformly over Q and the first part of the lemma follows. For the second part of the lemma, we have

ν(x) ≥ b 1 σ -2 2 X ν(y) inf x∈V ε x 0 E ∞ 0 e -b2 t 0 |φy(s)| γ ds-b1t dL x t (φ y ) dy ≥ b 1 σ -2 2 [-N,N ]∩X ν(y) inf x∈V ε x 0 E T 0 e -(b2M γ +b1)t dL x t (φ y )1 {sup t≤T |φy(t)|≤M } dy ≥ b 1 σ -2 2 e -(b2M γ +b1)T [-N,N ]∩X ν(y) inf x∈V ε x 0 E L x T (φ y )1 {sup t≤T |φy(t)|≤M } dy for arbitrary constants M, N, T > 0. Since E L x T (φ y )1 {sup t≤T |φy(t)|≤M } ↑ E L x T (φ y ) uniformly in (x, y) ∈ V x0 × [-N, N ] as M grows, pick M large enough so that for every y ∈ [-N, N ] ∩ X, we have inf x∈V ε x 0 E L x T (φ y )1 {sup t≤T |φy(t)|≤M } ≥ 1 2 inf x∈V ε x 0 E L x T (φ y ) .
Next, we use the fact that Assumption 2 implies that the law of the random variable φ y (t) admits a density ρ t (y, x) w.r.t. the Lebesgue measure and that this density is bounded away from zero on compact sets in (y, x), see for instance [START_REF] Dacunha-Castelle | Estimation of the coefficients of a diffusion from discrete observations[END_REF][START_REF] Genon | On the estimation of the diffusion coefficient for multi-dimensional diffusion processes[END_REF]. In turn E L x T (φ y ) = T 0 ρ t (y, x)dt ≥ τ T > 0 for some τ T depending also on M and N and we infer

ν(x) ≥ τ T 2 b 1 σ -2 2 e -(b2M γ +b1)T [-N,N ]∩X ν(y)dy
and we obtain the result by taking N sufficiently large. The proof is complete.

Completion of proof of Theorem 12.

Step 1). Write ν n (y 0 )ν(y 0 ) = I + II, with

I = 1 |U n | u∈Un G h (y 0 -X u ) -ν(QG h (y 0 -•)) and II = G h ν(y 0 ) -ν(y 0 ).
We plan to apply Proposition 9 to I with ψ(x, y) = ϕ(y) = G h (y 0y). By Lemma 27, ν is locally bounded and we check that

|ψ 2 | µ+ν X |G h (y 0 -y) 2 |dy h -1 R G(y) 2 dy h -1 , |ψ ψ| µ sup y |G h (y)| R |G h (y 0 -y)|dy h -1 , and |ψ | 1 |ψ| ∧1 X |G h (y 0 -y)|dy 2 1.
Therefore, by Proposition 9, we have

E µ [I 2 ] |U n | -1 h -1 and this term is of order |U n | -2β/(2β+1)
from the choice of h. For the term II, Lemma 27 and the representation ν(x) = X ν(y)q(y, x)dy show that ν ∈ H β (y 0 ) as soon as q ∈ H α,β (x 0 , y 0 ). Then, by classical kernel approximation (see e.g. Chapter 1 of the book by Tsybakov [START_REF] Alexandre | Introduction à l'estimation non-paramétrique[END_REF]) we have that II 2 h 2β since the order k of the kernel G satisfies k > β, and thus II 2 has the same order as I 2 from the choice of h.

Step 2). For the estimation of q(x 0 , y 0 ), write q n (x 0 , y 0 )q(x 0 , y 0 ) = I + II, with

I = M Un G ⊗2 h1,h2 (x 0 -•, y 0 -•) -ν(x 0 )q(x 0 , y 0 ) M Un G h (x 0 -•) ∨ n ,
and

II = q(x 0 , y 0 ) ν(x 0 ) -M Un G h (x 0 -•) ∨ n M Un G h (x 0 -•) ∨ n .
We have I ≤ III + IV, with

III = -1 n M Un G ⊗2 h1,h2 (x 0 -•, y 0 -•) -G ⊗2 h1,h2 ν(x 0 )q(x 0 , y 0 ) and IV = -1 n G ⊗2
h1,h2 ν(x 0 )q(x 0 , y 0 )ν(x 0 )q(x 0 , y 0 ) . We plan to apply Proposition 9 to bound III with ψ(x, y) = G h1,h2 (x 0x, y 0y). Using Lemma 27 and the fact that µ is absolutely continuous, we have |ψ| µ+ν |ψ| 1 . It readily follows that

|ψ 2 | µ+ν |G h1 (x 0 -•) 2 | 1 |G h2 (y 0 -•) 2 | 1 h -1 1 h -1 2 , |ψ ψ| µ |G h1 (x 0 -•) sup y |G h2 (y 0 -y)|G h1 (x 0 -•)G h2 (y 0 -•)| 1 = |G h1 (x 0 -•) 2 | 1 sup y |G h2 (y 0 -y)||G h2 (y 0 -•)| 1 h -1 1 h -1 2 ,
and

|ψ | 1 |ψ| 1 sup x |G h1 (x 0 -x)||G h2 (y 0 -•)| 2 1 |G h1 (x 0 -•)| 1 h -1 1 .
We conclude

E µ III 2 -2 n |U n | -1 h -1 1 h -1
2 , and this term has order -2 n |U n | -2s(α,β)/(2s(α,β)+1) from the choice of h 1 and h 2 . By kernel approximation and the fact that G has order k > max{α, β}, noting that (x, y) → µ(x)q(x, y) ∈ H α∧β,β , we have

|IV | h α∧β 1 + h β 2 -1 n |U n | -s(α,β)/(2s(α,β)+1) from the choice of h 1 , h 2 .
We turn to the term II. We plan to use

ν(x 0 ) -M Un G h (x 0 -•) ∨ n 2 ν(x 0 ) -M Un G h (x 0 -•) 2 + 1 M Un (G h (x0-•))< n .
Pick n large enough so that 0

< n ≤ τ (x 0 ) = 1 2 inf Q∈Q,x∈Vx 0 ν(x), a choice which is possible by Lemma 27. Since {M Un (G h (x 0 ) -•) < n } ⊂ {M Un (G h (x 0 -•)) -ν(x 0 ) < -τ (x 0 )}, we further infer E µ ν(x 0 ) -M Un G h (x 0 -•) ∨ n 2 ≤ E µ ν(x 0 ) -M Un G h (x 0 -•) 2 + P µ ν(x 0 ) -M Un G h (x 0 -•) ≥ τ (x 0 ) E µ ν(x 0 ) -M Un G h (x 0 -•) 2 .
Applying Step 1) of the proof, we derive

E µ II 2 -2 n |U n | -2β/(2β+1)
and this term has negligible order. The proof of Theorem 12 is complete.

5.5. Proof of Proposition 16. Let s(x) = x 0 exp -2 y 0 r(z) σ(z) 2 dz and m(x) = 2 σ(x) 2 s (x)
. Consider the infinitesimal generator L associated to the diffusion process [START_REF] Cappé | Inference in Hidden Markov Models[END_REF], written in its divergence form

Lf (x) = 1 m(x) d dx 1 s(x) d dx f (x) , f ∈ D(L),
with domain D(L) densely defined on twice continuously differentiable functions f satisfying the boundary condition f (0) = f (L) = 0. By Itô formula and Fubini's theorem, for f ∈ D(L), we have X f (y)q(x, y)dy = -

1 0 κ(z)E ∞ 0 f (zφ x (t)) d dt e -t 0 B(φx(s))ds dt dz = 1 0 κ(z)f z (x)dz + 1 0 κ(z)E ∞ 0 Lf z (φ x (t)) e -t 0 B(φx(s))ds dt dz,
where we set

f z (x) = f (zx) for z ∈ [ε, 1 -ε] since supp( κ) ⊂ [ε, 1 -ε] by Assumption 4. Pick f (x) = x 0 exp 2ε -1 y 0 e 2 uε -1 0 |r(v)|
σ(v) 2 dv s(u) -1 du dy, and note that

f (zx) = 2 εs(zx) exp 2 zxε -1 0 |r(v)| σ(v) 2 dv f (zx).
It follows that for z ≥ ε and every x ∈ X, we have ) be two functions in an orderly class B according to Definition 15 and write q B1 and q B2 for the associated transition densities. With no loss of generality, we may (and will) assume that B 1 (x) ≤ B 2 (x) for every x ∈ X. Assume that q B1 = q B2 . Since supp( κ) ⊂ [ε, 1ε], we have X f (y) q B1 (x, y)q B2 (x, y) dy

Lf z (x) = z m(x) zs(x)f (zx) -s (x)f (zx) s 2 (x) = zf (zx) m(x)s(x) 2 2zs(x) εs(zx) e 2 zxε -1 0 |r(v)| σ(v) 2 dv -e -2 x 0 r(v) σ(v) 2 dv > 0. Now let B 1 , B 2 : X → [0, ∞
= 1-ε ε κ(z)E ∞ 0 Lf z (φ x (t)) e -t 0 B1(φx(s))ds -e -t 0 B2(φx(s))ds dtdz = 0.
Our choice of f and the property B 1 ≤ B 2 implies that the integrand is non-negative. It follows that κ(z) e -t 0 B1(φx(s))dse -t 0 B2(φx(s))ds = 0 dzdt ⊗ P-a.s. Picking z such that κ(z) > 0, we obtain t 0 B 1 (φ x (s))ds = t 0 B 2 (φ x (s))ds P-a.s. for every t ≥ 0 by continuity of the integrand in t. By the occupation times formula, it follows that X B 1 (y) -B 2 (y) L y t (φ x )dy = 0, almost-surely, and by the ordering property, B 1 (y) = B 2 (y) for every y such that L y t (φ x ) > 0, i.e. for y ∈ [inf 0≤s≤t φ x (s), sup 0≤s≤t φ x (s)] → X as t → ∞. The proof of Proposition 16 is complete.

Proof of Theorem 18.

Preparation for the proof. We first establish uniform bounds for q ϑ (x, y). Remember that in the reflected case, we have X = [0, L] and supp(κ) ⊂ [ε, 1ε] under Assumption 4.

Lemma 28. Work under Assumptions 2, 4 and 17. For sufficiently small η > 0, we have:

0 < inf x∈X,y∈Xη,ϑ∈Θ q ϑ (x, y) ≤ sup x,y∈X,ϑ∈Θ q ϑ (x, y) < ∞,
where

X η = [0, (1 -ε)L -η].
Proof. The proof is close to that of Lemma 27. Let x ∈ X and y ∈ X η . We have

inf ϑ∈Θ q ϑ (x, y) ≥ b 3 σ -2 2 1-ε ε∨yL -1 κ(z) z E ∞ 0 e -b4t dL y/z t (φ x ) dz ≥ b 3 σ -2 2 b 4 1-ε ε∨yL -1 κ(z) z ∞ 0 e -b4t E L y/z t (φ x ) dtdz ≥ (1 -ε) -1 b 3 σ -2 2 b 4 η L ∞ 0 e -b4t inf x,y∈X E L y t (φ x ) dt
According to [START_REF] Cattiaux | Stochastic calculus and degenerate boundary value problems[END_REF], Section 5, proof of Lemma 5.37, the law of φ x (t) is absolutely continuous with density y → ρ t (x, y) that can be taken continuous and that satisfies inf x,y∈X ρ t (x, y) > 0 for every t > 0. Therefore inf

x,y∈X E L y t (φ x ) = inf
x,y∈X t 0 ρ s (x, y)ds > 0 and the result follows. The upper bound readily follows from

sup ϑ∈Θ q ϑ (x, y) ≤ b 4 σ -2 1 1-ε ε κ(z) z dz sup x,y∈X E ∞ 0 e -b3t dL y t (φ x ) ≤ ε -1 b 4 σ -2 1 sup x,y∈X E ∞ 0 e -b3t dL y t (φ x ) = ε -1 b 4 σ -2 1 b 3 sup x,y∈X ∞ 0 e -b3t E L y t (φ x ) dt
which is finite by Lemma 25.

Completion of proof of Theorem 18. This proof is classical (see for instance van der Vaart [START_REF] Van Der | Asymptotic statistics[END_REF] Theorem 5.14). We nevertheless give it for self-containedness. For a ∈ Θ, let

M(a, ϑ) = X ν ϑ (dx)
X log q a (x, y)q ϑ (x, y)dy.

First, a → M(a, ϑ) has a unique maximum at a = ϑ, as stems from the inequality log(x) ≤ 2( √ x-1)

for x ≥ 0. Indeed M(a, ϑ) -M(ϑ, ϑ) = X ν ϑ (dx)
X log q a (x, y) q ϑ (x, y) q ϑ (x, y)dy

≤ X ν ϑ (dx) X 2 q a (x, y) q ϑ (x, y)dy -2 ≤ - X ν ϑ (dx) X q a (x, y) -q ϑ (x, y) 2 dy ≤ 0.
Next, writing m U (x, y) = sup a∈U log q a (x, y), we prove that for every a = ϑ ∈ Θ, there exists a neighbourhood U a of a such that:

(22) ν ϑ Q ϑ m Ua < ν ϑ Q ϑ log q ϑ = M(ϑ, ϑ).
Pick a decreasing sequence of open balls (U (a)) ≥1 around a with vanishing diameters. For every x, y ∈ X we have m U (a) (x, y) ↓ log q a (x, y) by continuity of a → log q a (x, y) thanks to the continuity of B 0 according to Assumption 17. By Lemma 28, we also have

ν ϑ Q ϑ m U < ∞ for any U ⊂ Θ therefore ν ϑ Q ϑ m U l (a) ↓ ν ϑ Q ϑ log q a ) = M(a, ϑ) ≤ M(ϑ, ϑ)
by monotone convergence with equality only if a = ϑ, and this proves the existence of U a such that [START_REF] Hoffmann | Adaptive estimation in diffusion processes[END_REF] holds. We are now ready to prove the consistency result. For η > 0, the compact ball

C η (ϑ) = {a ∈ Θ, |a -ϑ| ≥ η }
can be covered by finitely many open neighbourhoods U a1 , . . . U ap with a i ∈ C η (ϑ) and such that [START_REF] Hoffmann | Adaptive estimation in diffusion processes[END_REF] holds for every U ai . For η > 0, let m (η) U (x, y) = sup a∈U log q a (x, y)1 {qa(x,y)≥η} .

Abbreviating L n (a, (X u ) u∈Un ) by L n (a), it follows that

|U n | -1 sup a∈C η (ϑ) log L n (a) ≤ max 1≤i≤p |U n | -1 u∈T n m (η) Ua i (X u -, X u ) → max 1≤i≤p ν ϑ Q ϑ m Ua i < M(ϑ, ϑ) (23)
in probability as n → ∞ and letting η → 0, as stems from Corollary 13 and the fact that sup x,y∈Xη m Ua i (x, y) < ∞ by Lemma 28. Finally, if ϑ n ∈ C η (ϑ), then, by definition of ϑ n , we have

|U n | -1 sup a∈C η (ϑ) log L n (a) ≥ |U n | -1 log L n ( ϑ n ) ≥ |U n | -1 log L n (ϑ) > M(ϑ, ϑ) -n ,
where n → 0 in probability, as follows from Corollary 13. We conclude the proof by noticing that

ϑ n ∈ C η (ϑ) ⊂ |U n | -1 sup a∈C η (ϑ)
L n (a) ≥ M(ϑ, ϑ)n and the fact that the probability of this last event converges to 0 by [START_REF] Hoffmann | Nonparametric estimation of the division rate of an age dependent branching process[END_REF] as n → ∞.

Proof of Theorem 22.

Preparation for the proof. We start by proving some useful estimates on the gradient and Hessian of log q ϑ . Let

Γ ϑ = ∇ ϑ log q ϑ = (∂ ϑ1 log q ϑ , . . . , ∂ ϑ d log q ϑ ) , Γ ϑ,i = ∂ ϑi log q ϑ , 1 ≤ i ≤ d.
|∂ ϑ Γ ϑ (x, y) i,j | < ∞, sup x∈X,y∈Xη,ϑ∈Θ ∂ 2 ϑ Γ ϑ (x, y) < ∞
where • corresponds to the operator norm for the Hessian ∂ 2 ϑ Γ ϑ (x, y). Proof. According to Lemma 28, since Γ ϑ (x, y) = ∂ ϑ q ϑ (x, y) q ϑ (x, y) componentwise, it suffices to show |∂ ϑi q ϑ (x, y)| 1 in order to establish the first bound. Recall that for (x, y)

∈ X × [0, (1 -ε)L], q ϑ (x, y) = 1 y/L κ(z) z B 0 (ϑ, y/z)σ(y/z) -2 E ∞ 0 e -t 0 B0(ϑ,φx(s))ds dL y/z t (φ x ) dz.
Taking the derivative with respect to ϑ i yields

∂ ϑi q ϑ (x, y) = 1 y/L κ(z) z ∂ ϑi B 0 (ϑ, y/z)σ(y/z) -2 E ∞ 0 e -t 0 B0(ϑ,φx(s))ds dL y/z t (φ x ) dz - 1 y/L κ(z) z B 0 (ϑ, y/z)σ(y/z) -2 E ∞ 0 e -t
(φ x ) = ∞ 0 (1 -b 3 (1 + t))e -b3t E[L y/z t (φ x )]dt,
where the last equality comes from the integration by parts formula (see Appendix 6.4). This last term is bounded by Lemma 25 and |∂ ϑi q ϑ (x, y)| 1 follows. We turn to the second bound: clearly, for 1 ≤ i, j ≤ d ∂ ϑ Γ ϑ (x, y) i,j = ∂ 2 ϑiϑj q ϑ (x, y)q ϑ (x, y) -∂ ϑi q ϑ (x, y)∂ ϑj q ϑ (x, y) q ϑ (x, y) 2

and thanks to Lemma 28 and the first bound, we only need to show |∂ 2 ϑiϑj q ϑ (x, y)| 1 in order to obtain the second bound. Define ω t (y, z, ϑ) = 1 [yL -1 ,1] (z) κ(z) zσ(y/z) 2 exp(-t 0 B 0 (ϑ, φ x (s))ds). We have

∂ 2 ϑiϑj q ϑ (x, y) = 1 0 ∂ 2 ϑiϑj B 0 (ϑ, y/z)E ∞ 0 ω t (y, z, ϑ)dL y/z t (φ x ) dz + 1 0 B 0 (ϑ, y/z)E ∞ 0 ω t (y, z, ϑ) t 0 ∂ ϑi B 0 (ϑ, φ x (s))ds t 0 ∂ ϑj B 0 (ϑ, φ x (s))ds dL y/z t (φ x ) dz - ( , )∈{(i,j),(j,i)} 1 0 ∂ ϑ B 0 (ϑ, y/z)E ∞ 0 ω t (y, z, ϑ) t 0 ∂ ϑ B 0 (ϑ, φ x (s))dsdL y/z t (φ x ) dz + 1 0 B 0 (ϑ, y/z)E ∞ 0 ω t (y, z, ϑ) t 0 ∂ 2 ϑiϑj B 0 (ϑ, φ x (s))dsdL y/z t (φ x ) dz
and we proceed in the same way as for the first estimate, using repeatedly Assumption 2, 17 and 19. The proof of the third bound is analogous.

Completion of proof of Theorem 22. This proof is classical (see for instance van der Vaart [START_REF] Van Der | Asymptotic statistics[END_REF] Theorem 5.41). We nevertheless give it for self-containedness. By definition of ϑ n and a Taylor expansion around ϑ, we have

0 = u∈U n Γ ϑn (X u -, X u ) = u∈U n Γ ϑ (X u -, X u ) + ∂ ϑ Γ ϑ (X u -, X u )( ϑ n -ϑ) + ( ϑ n -ϑ) T ∂ 2 ϑ Γ ϑn (X u -, X u )( ϑ n -ϑ) ,
for some ϑ n on the segment line between ϑ and ϑ n . Rearranging the sum and introducing the normalisation |U n | 1/2 , we derive

|U n | -1 u∈U n ∂ ϑ Γ ϑ (X u -, X u ) + |U n | -1 u∈U n ( ϑ n -ϑ) T ∂ 2 ϑ Γ ϑn (X u -, X u ) |U n | 1/2 ( ϑ n -ϑ) (24) = -|U n | -1/2 u∈U n Γ ϑ (X u -, X u ).
We plan to apply an extension of the central limit theorem for bifurcating Markov chain proved in Guyon for U n = T n , see [START_REF] Guyon | Limit theorems for bifurcating Markov chains. Application to the detection of cellular aging[END_REF] Corollary 24 on the right-hand side. It is not difficult to see that the result still holds if one replaces T n by an incomplete tree according to Definition 8. We omit the details. By Lemma 28 and 29 we have that Q ϑ (Γ ϑ,i Γ ϑ,j ) and Q ϑ (Γ ϑ,i Γ ϑ,j Γ ϑ,k Γ ϑ,l ) are bounded functions on X for all 1 ≤ i, j, k, l ≤ d. Moreover, we have ν ϑ (Q ϑ Γ ϑ,i ) = 0. Therefore [START_REF] Kutoyants | Statistical inference for ergodic diffusion processes[END_REF] |U

n | -1/2 u∈U n Γ ϑ (X u -, X u ) → N 0, Ψ(ϑ)
in distribution as n → ∞, where Ψ(ϑ) is the Fisher information matrix defined after Assumption 19. Next, since ∂ ϑ Γ ϑ is bounded by Lemma 29, we have ( 26)

|U n | -1 u∈U n ∂ ϑ Γ ϑ (X u -, X u ) → Ψ(ϑ)
in probability as n → ∞. Moreover, by Lemma 29, we have: sup x,y∈X,ϑ∈Θ ∂ 2 ϑ Γ ϑ (x, y) < ∞ and since ϑ nϑ converges to 0 by Theorem 18, it follows that ( 27)

|U n | -1 u∈U n ( ϑ n -ϑ) T ∂ 2 ϑ Γ ϑn (X u -, X u ) → 0
in probability as n → ∞ tends to infinity. Combining ( 25), ( 26) and ( 27) in [START_REF] Kimmel | Quasistationarity in a branching model of division-within-division[END_REF] we finally obtain

Ψ(ϑ)|U n | 1/2 ( ϑ n -ϑ) → N 0, Ψ(ϑ)
in distribution as n → ∞. We conclude thanks to the invertibility of Ψ(ϑ) granted by Assumption 20.

6. Appendix 6.1. Example of a model satisfying ρ < 1/2. We elaborate on Remark 7.

Lemma 30. Assume that i) φ x (t) si an Ornstein-Uhlenbeck process on X = R: we have r(x) = -βx and σ(x) = σ for every x ∈ X and some β, σ > 0, ii) the division rate is constant: we have B(x) = b for every x ∈ X and some b > 0, iii) the fragmentation distribution is uniform: we have κ

(z) = 1/(1 -2ε) on [ε, 1 -ε] for some ε > 0.
Then, Q admits an invariant probability distribution ν and for V (x) = x 2 , there exist C > 0 and ρ ∈ (0, 1) such that for every m ≥ 1, the bound

Q m ϕ -ν(ϕ) V ≤ Cρ m ϕ -ν(ϕ) V
holds as soon as |ϕ| V < ∞. Moreover, for b small enough, we have ρ < 1/2.

Proof. According to Proposition 23, the drift condition holds true. Next, we slightly modify the proof of Proposition 24.

Step 1). For large enough w > 0, we aim at finding λ > 1/2 and a probability measure µ on X such that inf {x,|x|≤w}

Q(x, A) ≥ λµ(A)
for every Borel set A ⊂ X. Let x ∈ [-w, w] and A ⊂ X be a Borel set. In this setting, we have

Q(x, A) = b 1 -2ε 1-ε ε ∞ 0 E 1 {zφx(t)∈A} e -bt dtdz.
Using successively Fubini's theorem and the occupation time formula, we get

Q(x, A) = b σ 2 (1 -2ε) 1-ε ε R 1 {zy∈A} E ∞ 0 e -bt dL y t (φ x ) dydz.
Integration by parts (see Appendix 6.4) yields

Q(x, A) = b 2 σ 2 (1 -2ε) 1-ε ε R 1 {zy∈A} ∞ 0 e -bt E L y t (φ x ) dtdydz. (28)
We next compute the expectation of the local time. We have

1 σ 2 E L y t (φ x ) = E lim ε↓0 1 ε t 0 1 {y≤φx(s)≤y+ε} ds = lim ε↓0 1 ε t 0 P y ≤ φ x (s) ≤ y + ε ds.
Since φ x (t) is an Ornstein-Uhlenbeck process, we have the representation

φ x (t) = σ √ 2β W x e 2βt e -βt ,
where W x is a Brownian motion starting from x. Then, where F (t, x) is the cumulative density function of W x (t). Therefore, combining [START_REF] Marguet | Uniform sampling in a structured branching population[END_REF] and [START_REF] Méléard | Modèles aléatoires en écologie et évolution. (French) [Random models in ecology and evolution[END_REF] we get

1 σ 2 E L y t (φ x ) = lim ε↓0 1 ε t 0 P y ≤ σ √ 2β W x e
Q(x, A) = b 2 1 -2ε √ 2β σ 1 √ 2π 1-ε ε R 1 {zy∈A} ∞ 0 e -bt t 0 e -1 2 xe -βs -y √ 2β σ 2 dsdtdydz.
Integrating by parts again and a change of variables yield

Q(x, A) = b 1 -2ε √ 2β σ 1 √ 2π 1-ε ε 1 z R 1 {u∈A} ∞ 0 e -bt e -1 2 xe -βt -u z √ 2β σ 2 dtdudz. Next, xe -βt -u z √ 2β σ 2 ≤ we -βt + |u| z √ 2β σ 2 for all x ∈ [-w, w], t ≥ 0 and z ∈ [ε, 1 -ε]. Finally, using Fubini's theorem, Q(x, A) ≥ 1 √ π R 1 {u∈A} f w (u)du, with f w (u) = b √ β σ 1-ε ε 1 z ∞ 0 e -bt e -1 2 we -βt + |u| z √ 2β σ 2 dt dz 1 -2ε .
We now construct a probability measure from f w . First,

R e -1 2 we -βt + |u| z √ 2β σ 2 du = 2 zσ √ β ∞ w √ 2 e -βt
e -y 2 dy.

Combining this with Fubini's theorem, we get

R f w (u)du = 2b ∞ 0 e -bt ∞ w √ 2 e -βt
e -y 2 dy dt.

Fubini's theorem again yields Step 2). Applying Theorem 1.2. in [START_REF] Hairer | Yet another look at Harris' ergodic theorem for Markov chains[END_REF], we obtain the exponential convergence of the tagged-chain at rate

R f w (u)du = 2b w √ 2 0 e -y 2
ρ = (1 -(λ -λ 0 )) ∨ 2 + wγv 0 2 + wγ ,
for any λ 0 ∈ (0, λ) and v 0 ∈ (v 1 + 2v 2 /w, 1), where γ = λ 0 /v 2 . We just proved that λ(w 0 , b 0 ) > 1/2 so that we can choose λ 0 ∈ (0, λ) such that 1λ + λ 0 < 1/2. Next, let η ∈ (0, 1) be such that

v 0 = η + (1 -η)(v 1 + 2v 2 /w). Then, R(w) = 2 + wγv 0 2 + wγ = 2 + wγη + (1 -η)wγv 1 + 2(1 -η)γv 2 2 + wγ is a decreasing function in w and lim w→∞ R(w) = η + (1 -η)v 1 .
Moreover, according to the proof of Proposition 23, v 1 = m(κ) = 1 3 (ε 2ε + 1) ≤ 1/3. Finally, we can choose η ∈ (0, 1) and w > 2v 2 /(1v 1 ) such that R(w) < 1/2 and we get the result.

Proof of Lemma 25.

Step 1). Fix δ > 0 and let K δ = {y ∈ X, inf z∈K |y -z| ≤ δ} denote the δ-enlargement of K. For x ∈ X, let

τ x = inf{t ≥ 0, φ x (t) ∈ K δ }, inf ∅ = ∞, and
φ K δ x (t) =    φ sup K δ (t -τ x ) + if x > sup K δ φ x (t) if x ∈ K δ φ inf K δ (t -τ x ) + if x < inf K δ .
For every y ∈ K, we have L y t (φ x ) = L y t (φ K δ x ), and by Itô-Tanaka's formula, it follows that

L y t (φ x ) = L y t (φ K δ x ) = φ K δ x (t) -y -|φ K δ x (0) -y| - t 0 sgn φ K δ x (s) -y dφ K δ x (s).
Assume first that x > sup K δ . Observing that L y t (φ x ) = 0 on {τ x ≥ t}, and that dφ K δ x (s) vanishes on [0, τ x ) on {τ x < t}, we readily have

L y t (φ x ) = φ K δ x (t) -y -| sup K δ -y| - t τx∧t sgn φ K δ x (s) -y dφ K δ x (s) = φ sup K δ (t -τ x ) + -y -| sup K δ -y| - (t-τx)+ 0 sgn φ sup K δ (s) -y dφ sup K δ (s). ( 30
)
We plan to bound each term separately.

Step 2). By Itô's formula, (φ sup K δ (t)y) 2 = (sup K δy) E φ sup K δ (t)y ≤ (sup K δy) 2 + tα(y).

Step 3). We are ready to control each term of [START_REF] Øksendal | Stochastic differential equations: an introduction with applications[END_REF]. We have Taking expectation and using the foregoing arguments, this last quantity is also of order 1 + t 3/2 and Lemma 25 is proved for x > sup K δ .

E
Step 4). If For the sake of readability, we denote by i this unique individual in G i U n . We follow the same steps as in the case > 0, slightly adapting the proof. In particular, the triangle inequality used in Step 1). in the case > 0 is not accurate enough when = 0.

Step 1'). E µ ψ(X i-1 , X i )ψ(X j-1 , X j ) .

Step 2'). The control of I is as before straightforward: using Lemma 26 we obtain as before I n|ψ 2 | µ .

Step 3'). By the Markov property

II = 2 n i=1 n j=i+1 E µ ψ(X i-1 , X i )Q j-i (X i ) .
We further decompose II = 2(III + IV ) having

III = n i=1 E µ ψ(X i-1 , X i )Q(X i ) , IV = n i=1 n j=i+2 E µ ψ(X i-1 , X i )Q j-i (X i ) .
Using Lemma 26, we get III n|ψ | 1 |ψ| µ . Moreover,

IV n|ψ| ∧1 n i=1 µ(Q i ψ) n|ψ| ∧1 |ψ | 1 (1 + µ(V ))ρ n ,
which yields the result.

Ψ(ϑ) = ν ϑ Q ϑ ∂ ϑ q ϑ q ϑ 2 = X ν ϑ (dx)
X ∂ ϑ q ϑ (x, y) 2 q ϑ (x, y) dy.

If A ⊂ X is a Borel set with Leb(A) > 0, we have ν ϑ (A) = X×X 1 A (y)q ϑ (x, y)ν ϑ (dx)dy ≥ inf

x,y q ϑ (x, y) Leb(A) > 0 since inf x,y∈X q ϑ (x, y) > 0 by Lemma 28. By continuity of y → ∂ ϑ q ϑ (x, y) on [0, L], it suffices then to show the existence x, y ∈ X such that ∂ ϑ q ϑ (x, y) > 0. For x, y ∈ X, we have ∂ ϑ q ϑ (x, y) = by the change of variable u = yz -1 , the occupation times formula, and the specific form of κ. For t ≥ 0, define

A t (x, y) = E 1 {y(1-ε) -1 ≤φx(t)≤yε -1 } 1 φ x (t) = yε -1 y(1-ε) -1 ρ t (x, z) dz z ,
for which a closed-form formula is known, see for instance [START_REF] Linetsky | On the transition densities for reflected diffusions[END_REF], Section 4.1, given by Let x ∈ [0, L] be such that g(n, x) = 0 for every n ≥ 1. Since x → g(n, x) is continuous on [0, L], there exists 0 < ε n < 1 2 such that g(n, x)g(n, z) > 0 for all z ∈ J(ε n , x) = [2ε n x, 2(1ε n )x]. Let N > 0 be such that for all z ∈ J(ε 1 , x): Finally, for ε > max{ε n , 1 ≤ n ≤ N }, picking y = 2ε(1ε)x yields [y(1ε) -1 , yε -1 ] = J(ε, x) ⊂ J(max{ε n , 1 ≤ n ≤ N }, x) so that ∂ ϑ q ϑ (x, y) > 0.

|R N (x, z)| =

Figure 1 .

 1 Figure 1. Example of a trajectory and its associated genealogy.

2 . 1 .

 21 A cell division model structured by a stochastic flow 2.Assumptions and well-posedness of the stochastic model.

  t. the Lebesgue measure on X×X. For a function ψ = X×X → R we set ψ (x) = sup y∈X |ψ(x, y)| and ψ (y) = sup x∈X |ψ(x, y)| and define |ψ| ∧1 = min X×X |ψ(x, y)|dxdy, X sup x∈X |ψ(x, y)|dy .

+ y 1 B

 1 y 0 , y 1 κ y 0 /(y 0 + y 1 ) y 0 (y 0 + y 1 ) σ(y 0 + y 1 ) 2 E ∞ 0 e -t 0 B(φx(s))ds dL y0+y1 t (φ x ) dy 0 dy 1 ,

5 ).

 5 Putting together the estimates obtained for I m in Step 2, III m in Step 3 and IV m in Step 4, and recalling II m = III m + IV m we eventually derive:

|ψ 2 |

 2 µ by |ψ 2 | µ+ν and |ψ| ∧1 by |ψ| ν as follows from Step 2 and 4. Taking square root, summing in 1 ≤ m ≤ n, taking square again and normalising by |U n | -2 which is of order 2 -2 n , we obtain Proposition 9.

Lemma 29 .

 29 Work under Assumptions 2, 4, 17 and 19. For every 1 ≤ i, j ≤ d and η > 0, we have sup x∈X,y∈Xη,ϑ∈Θ |Γ ϑ,i (x, y)| < ∞, sup x∈X,y∈Xη,ϑ∈Θ

  2βs e -βs ≤ y + ε ds

  dy. Finally, define the probability measure µ w (dy) = g w (y)dy on X by g w (y) = 2 b 0 > 0 and w 0 > 0 such that λ = λ(w 0 , b 0 ) > 1/2 and we thus have established Q(x, A) ≥ λµ(A), with λ > 1/2.

2 t 0 ( 1 R 2 ( 2 -|y|r 2 (r 1 |y|r 2 -|y|r 2 |z -y|( 1 +

 201222221 2 + I + II, withI = t 0 2(φ sup K δ (s)y)r(φ sup K δ (s)) + σ(φ sup K δ (s)) 2 ds, II = φ sup K δ (s)y)σ(φ sup K δ (s))dW s .First,I ≤ 2σ -2 (zy)r(z)L z t (φ sup K δ )dz + tσ 2 2by the occupation times formula and Assumption 2. Introduce |y| r2 = |y| ∨ r 2 , where r 2 is defined in Assumption 2. Since zy > 0 and r(z) < 0 for z > |y| r2 , we have∞ |y|r zy)r(z)L z t (φ x )dz < 0. Similarly -|y|r 2 -∞ (zy)r(z)L z t (φ x )dz < 0. It follows that R (zy)r(z)L z t (φ x )dz ≤ |y|r zy)r(z)L z t (φ x )dz ≤ |z|)L z t (φ x )dz ≤ r 1 (|y| r2y)(1 + |y| r2 ) R L z t (φ x )dz ≤ r 1 (|y| r2y)(1 + |y| r2 )t, therefore I ≤ 2σ -2 1 r 1 (|y| r2y)(1 + |y| r2 )t + σ 2 2 t = tα(y) say. Since E[II] = 0, we derive by Cauchy-Schwarz's inequality[START_REF] Valère | Autoregressive functions estimation in nonlinear bifurcating autoregressive models[END_REF]

  sup K δ (s)y)σ φ sup K δ (s) dW s .

6 . 3 .

 63 x < inf K δ , we apply the same arguments, replacing | sup K δ | by | inf K δ | with obvious changes. Likewise if x ∈ K δ we may replace | sup K δ | by max{| sup K δ |, | inf K δ |}. Proof of Proposition 9 in the case = 0. Without loss of generality, we assume that there is only one individual in each generation and thus |U n | = n.

E 2 =ψ(X m- 1 , X m ) 2 =

 212 µ [M Un (ψ) 2 ] = |U n | -2 E µ n m=1 u∈Gm∩Un ψ(X u -, X u ) |U n | -2 E µ n m=1 |U n | -2 (I + II),

6. 4 . 0 e -as dL x s = a ∞ 0 e= t 0 e -as dL x s -a t 0 e 0 e -as dL x s -aE ∞ 0 e 6 . 5 .

 400000065 Integration by parts formula. We prove in this section the following formula for the local time: for all a > 0 and x ∈ X, E ∞ -as E L x s ds.First, for t ≥ 0, the integration by part formula (see[33, Proposition 0.4.5]) yields e -at L x t -as L x s ds. Moreover, we have lim inf t→+∞ E e -at L x t = 0 ≥ E lim inf t→∞ e -at L x t ≥ 0, using Lemma 25 and Fatou's lemma. Finally 0 = E ∞ -as L x s ds , and the result follows by Fubini's theorem. Proof of Proposition 21. Remember that

0 ( 1 -( 1 -

 011 ϑt)e -ϑt dL u t (φ x ) φ x (t) (1ϑt)e -ϑt 1 {y(1-ε) -1 ≤φx(t)≤yε -1 } dt φ x ϑt)e -ϑt E 1 {y(1-ε) -1 ≤φx(t)≤yε -1 } 1 φ x (t) dt

= r 2 1 + π 2 n 2 /L 2 .e( 1 - 0 ( 1 -

 122101 It follows thatA t (x, y) = 2r 1 e 2r1x e 2r1L --a(n)t/2 a(n) g(n, x)I(n, y) with I(n, y) = yε -1y(1-ε) -1 e r1z g(n, z) dz z , and therefore ∂ ϑ q ϑ (x, y) ϑt)e -ϑt A t (x, y)dt ϑt)e -ϑt e -a(n)t/2 a(n) dt g(n, x)I(n, y)

  ∞ n=N +1 g(n, x)g(n, z) (ϑ + a(n)/2) 2 < g(1, x)g(1, z) (ϑ + a(1)/2) 2 ,which exists because by normal convergence of the above series. Then, for every z∈ J(max{ε n , 1 ≤ n ≤ N }, x) we have ∞ n=1 g(n, x)g(n, z) (ϑ + a(n)/2) 2 = N n=1 g(n, x)g(n, z) (ϑ + a(n)/2) 2 + R N (x, z) > g(1, x)g(1, z) (ϑ + a(n)/2) 2 -|R N (x, z)| > 0.

Table 1 .

 1 1 , h 2 . Results for B in B 1 and B 2 . For each parametric class of functions B 1 and B 2 , we display the results for ϑ = 2 and ϑ = 15.

	B ϑ Mean Std Dev. ϑ min ϑ max	∆ϑ
	B 0 2 1.9908	0.0845	1.8	2.2	0.05
	15 15.029	0.4763	14	16	0.25
	B 1 2 2.1392	0.3485	1.375	3	0.125
	15 15.023	0.6425	13.75 16.5 0.25

  φ sup K δ (tτ x ) +y ≤ | sup K δ -y| + E sup K δ (s) dW s ≤ | sup K δ -y| + r 1 E ≤ | sup K δ -y| + r 1 t + r 1 E ≤ | sup K δ -y| + r 1 t + r 1where we successively applied Assumption 2, Doob's inequality and[START_REF] Valère | Autoregressive functions estimation in nonlinear bifurcating autoregressive models[END_REF]. In the same way

		(t-τx)+			(t-τx)+
	0	0	r φ sup K δ (s) ds + E σ φ t 0 (1 + |φ sup K δ (s)|)ds + E sup 0 u≤t u σ φ sup K δ (s) dW s	2 1/2
			0	t	|φ sup K δ (s)|ds +	√	2σ 2 t
			t		(sup K δ ) 2 + sα(0)ds +	√	2σ 2 t
			0
	1 + t 3/2 ,
	(t-τx)+
	-

0 sgn φ sup K δ (s)y dφ sup K δ (s) ≤r 1 t 0 (1 + |φ sup K δ (s)|)ds + sup

Acknowledgements. We are grateful to V. Bansaye for helpful discussion and comments, as well the insightful input of two anonymous referees. A.M. acknowledges partial support by the Chaire Modélisation Mathématique et Biodiversité of Veolia Environnement -École Polytechnique -Museum National Histoire Naturelle -F.X. and by the French national research agency (ANR) via project MEMIP (ANR-16-CE33-0018).