Nicolas Champagnat
email: nicolas.champagnat@inria.fr

Amaury Lambert
email: amaury.lambert@upmc.fr

Splitting trees with neutral Poissonian mutations II: Largest and Oldest families

Keywords: MSC 2000 subject classifications: Primary 60J80; secondary 92D10, 60J85, 60G70, 60G51, 60G55, 60K15 branching process -coalescent point process -splitting tree -Crump-Mode-Jagers

de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Introduction and motivation

We consider a general branching population, where individuals reproduce independently of each other, have i.i.d. lifetime durations with arbitrary distribution, and give birth at constant rate during their lifetime. We also assume that each birth gives rise to a single newborn. The genealogical tree associated with this construction is known as a splitting tree [START_REF] Geiger | Size-biased and conditioned random splitting trees[END_REF][START_REF] Geiger | Depth-first search of random trees, and Poisson point processes[END_REF][START_REF] Lambert | The contour of splitting trees is a Lévy process[END_REF]. The process (N t ; t ≥ 0) counting the population size is a non-Markovian birth-death process belonging to the class of general branching processes, or Crump-Mode-Jagers (CMJ) processes. Since births arrive singly and at constant rate, these processes are sometimes called homogeneous, binary CMJ processes.

Also, individuals are given a type, called allele or haplotype. They inherit their type at birth from their mother, and (their germ line) can change type throughout their lifetime, at the points of independent Poisson point processes with rate θ, conditional on lifetimes (neutral mutations). The type conferred by a mutation is each time an entirely new type, an assumption known as the infinitely-many alleles model.

We are interested in the so-called allelic partition (partition into types) of the population alive at time t. In [START_REF] Champagnat | Splitting trees with neutral Poissonian mutations I: Small families[END_REF][START_REF] Lambert | The allelic partition for coalescent point processes[END_REF], we obtained explicit formulae for the expected frequency spectrum of the allelic partition. The frequency spectrum is a convenient way of describing this partition without labelling types. It is defined as the sequence of numbers (A θ (k, t), k ≥ 0), where A θ (k, t) is the number of types carried by k individuals at time t. For example in [START_REF] Champagnat | Splitting trees with neutral Poissonian mutations I: Small families[END_REF], we have derived explicit formulae for the expectation of A θ (k, t) conditional on population size at t. From these formulae, using the theory of branching processes counted by random characteristics, we have specified the a.s. limit, as t → ∞, of the fraction of types carried by a fixed number k of individuals.

If we call clonal families, or simply families, the equivalence classes associated to identity by type (i.e., the components of the allelic partition), it is usual to call small families the families of sizes k = 1, 2, 3,... Here, large families will refer to families with most frequent (i.e., abundant) types having alive representatives, and old families to families having oldest types with alive representatives, where the age of a type is the time elapsed since its original mutation. In the present work, we are interested in the asymptotic behavior, as t → ∞, of the sizes and ages of large and of old families.

The most celebrated mathematical result regarding allelic partitions is Ewens' sampling formula, which provides the distribution of the frequency spectrum for the Kingman coalescent tree with neutral Poissonian mutations [START_REF] Ewens | Mathematical Population Genetics[END_REF]. It has notably been shown [START_REF] Donnelly | The ages of alleles and a coalescent[END_REF][START_REF] Durrett | Probability Models for DNA Sequence Evolution[END_REF] that under this model, the largest (resp. oldest) families converge, after being rescaled by the population size N , to the Poisson-Dirichlet (resp. GEM) distribution. We will see here, that, for example, the largest families are never of the order of N , but depending on how the Malthusian parameter α scales with the mutation rate θ, of the order of N 1-θ/α (case θ < α), order of (log N ) 2 (case θ = α), or order of log N (case θ > α). The first case (θ < α) shows more similarities with the frequency spectrum of the Beta-coalescent [START_REF] Berestycki | Beta-coalescents and continuous stable random trees[END_REF].

We refer the reader to [START_REF] Champagnat | Splitting trees with neutral Poissonian mutations I: Small families[END_REF] for more references on the topic of allelic partitions, especially regarding branching processes. For example, similar questions were studied for general CMJ processes, when mutations occur at birth, in the monography due to Z. Taïb [START_REF] Taïb | Branching processes and neutral evolution[END_REF]. These results rely heavily on the theory of branching processes counted by random characteristics, due to P. Jagers and O. Nerman [START_REF] Jagers | Convergence of general branching processes and functionals thereof[END_REF][START_REF] Jagers | The growth and composition of branching populations[END_REF][START_REF] Jagers | Limit theorems for sums determined by branching processes and other exponentially growing processes[END_REF][START_REF] Nerman | On the convergence of supercritical general (CMJ) branching processes[END_REF], and more specifically on time dependent random characteristics as developed in [START_REF] Jagers | Limit theorems for sums determined by branching processes and other exponentially growing processes[END_REF]. Z.

Taïb obtains results of convergence in distribution of the (correctly rescaled) point process of ages, similar to the results we obtain in Sections 4 and 5. However, the techniques of [START_REF] Taïb | Branching processes and neutral evolution[END_REF] do not apply to the case where mutations occur during individuals' lifetimes, since the genealogical tree of types is not the one of a CMJ process in this case.

One of the initial motivations of [START_REF] Champagnat | Splitting trees with neutral Poissonian mutations I: Small families[END_REF] and of the present work was the following model inspired from the works of P.C. Sabeti and her coauthors (see e.g. [START_REF] Sabeti | Detecting recent positive selection in the human genome from haplotype structure[END_REF]). Inside a large population, consider a subpopulation consisting of individuals carrying a specific selective gene called 'core haplotype' and thus experiencing demographic growth. The haplotypic structure of the subpopulation restricted to a portion of length L around the core haplotype on the chromosome carrying it, is assumed to be altered by recombination. As long as the total population is sufficiently large w.r.t. the growing subpopulation, each time a sequence belonging to (an individual in) this subpopulation recombines with another sequence, with high probability this sequence will be a new sequence belonging to the rest of the population. Therefore, the new sequence obtained after recombination can be treated as a mutant under the infinitely-many alleles model. In this setting, mutation rate is an increasing function of L. In [START_REF] Sabeti | Detecting recent positive selection in the human genome from haplotype structure[END_REF], a tree representation of the allelic partition as a function of L is given for each core haplotype in a given set of genes suspected to have been selected in humans. The tree obtained this way is called "recombination tree". An interesting question is to develop statistical methods allowing to detect positive selection from the knowledge of this tree. Here, we assume that our (sub)population grows at a Malthusian rate α (supercritical CMJ process). We are able to give the asymptotic distribution of the rightmost part of the frequency spectrum for a given mutation rate (this corresponds to fixing L in the recombination setting). Since θ can be seen as a death rate when restricting the count to individuals carrying the same allele, the phase transition at θ = α is intuitive. In the recombination tree, this phase transition should translate into a transition, at a certain locus length L 0 , from a small number of thick branches (L < L 0 ) to a large number of thin branches (L > L 0 ). We plan to extend this study to a full description of the structure of the recombination tree.

In the next section, we define rigorously the model and recall some chosen results from [START_REF] Champagnat | Splitting trees with neutral Poissonian mutations I: Small families[END_REF]. Section 3 is concerned with the asymptotic behavior, as t → ∞, of the expected sizes and ages of the most abundant/oldest families. Sections 4 and 5 deal with the joint convergence in distribution of these sizes and ages in the respective cases when clonal families are subcritical or critical. A final appendix is devoted to some technical lemmas for the control of moments of order 2 of largest sizes and ages.

2 Model, preliminary results and statement of the main results

Model

In this work, we consider genealogical trees satisfying the branching property and called splitting trees [START_REF] Geiger | Size-biased and conditioned random splitting trees[END_REF][START_REF] Geiger | Depth-first search of random trees, and Poisson point processes[END_REF]. Splitting trees are those random trees where individuals' lifetime durations are i.i.d. with an arbitrary distribution, but where birth events occur at Poisson times during each individual's lifetime. We call b this constant birth rate and we denote by V a r.v. distributed as the lifetime duration. Then set Λ(dr) := bP(V ∈ dr) a finite measure on (0, ∞] with total mass b called the lifespan measure. We will always assume that a splitting tree is started with one unique progenitor born at time 0.

The process (N t ; t ≥ 0) counting the number of alive individuals at time t is a homogeneous, binary Crump-Mode-Jagers process, which is not Markovian unless Λ has an exponential density or is a Dirac mass at {+∞}. In [START_REF] Lambert | The contour of splitting trees is a Lévy process[END_REF], it is shown that the genealogy of a splitting tree conditioned to be extant at a fixed time t is given by a coalescent point process, that is, a sequence of i.i.d. random variables H i , i ≥ 1, killed at its first value greater than t. In particular, conditional on N t = 0, N t follows a geometric distribution with parameter P(H ≥ t), where H is distributed as the H i . More specifically, for any 0 ≤ i < j ≤ N t -1, the coalescence time between the i-th individual alive at time t and the j-th individual alive at time t (i.e., the time elapsed since the common lineage to both individuals split into two distinct lineages) is the maximum of H i+1 , . . . , H j . The graphical representation in Figure 1 is straightforward. The common law of these so-called branch lengths is given by

P(H > s) = 1 W (s) , (2.1)
where the nondecreasing function W is such that W (0) = 1 and is characterized by its Laplace transform. More specifically, these branch lengths are the depths of the excursions of the jump contour process, say Y (t) , of the splitting tree truncated below level t. They are i.i.d. because Y (t) is a Markov process. Indeed, it is shown in [START_REF] Lambert | The contour of splitting trees is a Lévy process[END_REF] that Y (t) has the law of a Lévy process, say Y , with no negative jumps, reflected below t and killed upon hitting 0. The function W is called the scale function of Y , and is defined from the Laplace exponent ψ of Y :

ψ(x) = x - (0,+∞] 1 -e -rx Λ(dr) x ∈ R + . (2.2)
Let α denote the largest root of ψ. In the supercritical case (i.e. (0,∞] rΛ(dr) > 1), and in this case only, α is positive and called the Malthusian parameter, because the population size grows exponentially at rate α on the survival event. Then the function W is characterized by

∞ 0 e -xr W (r) dr = 1 ψ(x) x > α.
Actually, it is possible to show by path decompositions of the process Y that

W (x) = exp b x 0 dt P(J > t) , (2.3)
where J is the maximum of the path of Y killed upon hitting 0 and started from a random initial value, distributed as V . Note that since Y is also the contour process of a splitting tree, J has the law of the extinction time of the CMJ process N started from one individual. Throughout this work, we further assume that individuals independently experience mutations at Poisson times during their lifetime, that each new mutation event confers a brand new type (called haplotype, or allele) to the individual, and that a newborn holds the same type as her mother at birth time. The mutation rate is denoted by θ. From now on, P t (resp. P ⋆ ) will denote the conditional probability on survival up to time t (resp. on the survival event).

Expected frequency spectrum

Recall from the introduction that A θ (k, t) is the number of types carried by k individuals at time t. Also denote by Z 0 (t) the number of individuals carrying the ancestral type at time t.

In [START_REF] Champagnat | Splitting trees with neutral Poissonian mutations I: Small families[END_REF]Cor. 4.3], we obtained the following explicit formulae for the expected frequency spectrum in the population at time t:

E t A θ (k, t) = W (t) t 0 e -θx 1 W θ (x) 2 1 - 1 W θ (x) k-1 (θ dx + δ t (dx)), (2.4)
and

P t (Z 0 (t) = k) = W (t) e -θt W θ (t) 2 1 - 1 W θ (t) k-1 , (2.5)
and

W θ (x) := e -θx W (x) + θ x 0 W (y)e -θy dy, (2.6)
i.e. W ′ θ (x) = e -θx W ′ (x) ≥ 0 and W θ (0) = W (0) = 1. Note that W θ is the scale function associated to the clonal splitting tree [2, Thm.

3.1], i.e. ∞ 0 e -xr W θ (r)dr = 1 ψ θ (x) , x > α -θ,
where

ψ θ (x) := x - (0,+∞] (1 -e -rx )bP(V θ ∈ dr) = xψ(x + θ) x + θ , (2.7)
where V θ denotes the minimum of V and of an independent r.v. with parameter θ.

In addition, we were able to obtain the explicit expected age density of the frequency spectrum [2, Eq. (4.5)]: for all y < t, defining A θ (k, t, y; dy) as the number of haplotypes of age in the interval (y, y + dy) represented by exactly k alive individuals at time t, we have

E t A θ (k, t, y; dy) = θ dy W (t) e -θy W θ (y) 2 1 - 1 W θ (y) k-1 .
(2.8)

In [START_REF] Champagnat | Splitting trees with neutral Poissonian mutations I: Small families[END_REF], denoting by A θ (t) = k≥1 A θ (k, t) the total number of haplotypes at time t, we deduced from these expressions the a.s. large time convergence of the fraction A θ (k, t)/A θ (t). Recall that families with given size k = 1, 2, 3, ... are referred to as small families. Large families are those who have the largest sizes and old families are those whose original mutation is among the oldest. We are interested in the sizes and ages of large and of old families. For example, the size of the largest family is the largest k such that A θ (k, t) ≥ 1.

Statement of results

Recall that we always assume that the Malthusian parameter α is positive. The asymptotic size of the most frequent and oldest haplotypes strongly depends on the way α and the mutation rate θ compare. Since θ is an additional death rate for clonal families, the case α > θ corresponds to supercritical clonal families, the case θ = α corresponds to critical clonal families, and the case θ > α corresponds to subcritical clonal families.

In the whole paper, we are going to use the following notation: for all x, s > 0, define

• L t (x)
the number of haplotypes carried by at least (or exactly) x individuals alive at time t (L for large);

• O t (s) the number of haplotypes with alive representatives at time t older than s, i.e. whose original mutation has age greater than s (O for old);

• M t (x, s) the number of haplotypes carried by at least x individuals alive at time t and whose original mutation has age greater than s. By convention, we set M t (x, s) = M t (x, 0) = L t (x) when s < 0. For 0 ≤ s 1 ≤ s 2 , we also define

M t (x, s 1 , s 2 ) = M t (x, s 1 ) -M t (x, s 2 ),
the number of haplotypes carried by at least x individuals alive at time t, whose original mutation has age in (s 1 , s 2 ].

Our convergence results are of two kinds: convergence in expectation of L t (x t ) and O t (s t ) for conveniently chosen x t and s t , which are directly obtained from (2.4), (2.5) and (2.8) (see Section 3), and convergence in distribution of the point process of (correctly rescaled) largest families or oldest families, which require to combine the previous equations with the theory of coalescent point processes [START_REF] Lambert | The contour of splitting trees is a Lévy process[END_REF][START_REF] Popovic | Asymptotic genealogy of a critical branching process[END_REF] (see Sections 4 and 5). We obtain different results depending on whether the clonal families are supercritical, subcritical or critical.

Supercritical clonal families

Our only result in the supercritical case (α > θ) is the following (Proposition 3.3): for all 0 ≤ a 0 < a 1 ≤ +∞ and c ≥ 0,

lim t→+∞ E t M t (ce (α-θ)t , t -a 1 , t -a 0 ) = α -θ α a 1 a 0
exp αy -cψ ′ θ (α -θ)e (α-θ)y (θdy + δ 0 (dy)), (2.9) where δ 0 denotes the Dirac measure at 0. Note that (2.7) yields

ψ ′ θ (α -θ) = (α -θ)ψ ′ (α) α .
This result means that the largest families at time t have a size of the order of e (α-θ)t , and that their age is of the order of t minus a constant, i.e. were born in the first moments of the population growth. In particular, the largest and oldest families are the same.

This result can be interpreted as follows: If N θ (t) denotes the size of a clonal family started at time 0 from one individual, then conditional on its survival at time t, N θ (t) e -(α-θ)t converges in distribution to an exponential r.v. with parameter ψ ′ θ (α -θ) [START_REF] Lambert | The contour of splitting trees is a Lévy process[END_REF]. If we restrict the limit in the last statement to its Dirac term, we recover the previous convergence stated for the ancestral type

lim t→+∞ P t (Z 0 (t) > ce (α-θ)t ) = α -θ α e -cψ ′ θ (α-θ) .
The prefactor α-θ α is the probability of survival of the ancestral family conditional on the survival of the whole population, which is the ratio of (α -θ)/b (survival probability of the ancestral family) with α/b (survival probability of the whole population).

In order to recover E t M t (ce (α-θ)t , t -a 1 , t -a 0 ), we need to integrate the mutation rate per branch θ dy against the expected number of individuals alive at time y having at least one alive (not necessarily clonal) descendant at time t, times the probability that the splitting tree spanned by one of these individuals has at least ce (α-θ)t clonal descendants, which is exactly P t-y (Z 0 (t -y) > ce (α-θ)t ) since this splitting tree is not extinct after t -y time units, which converges to

α -θ α e -cψ ′ θ (α-θ)e (α-θ)y
as t → +∞. Now, the number of individuals alive at time y having descendants at time t is given by the number of branches deeper than t -y in the coalescent point process, i.e. has a geometric distribution of parameter P(H > t | H > t -y) = W (t -y)/W (t). As will appear in Lemma 3.1 below, this quantity converges to e -αy as t → +∞, which completes the interpretation of each term of (2.9).

Using the theory of time-dependent random characteristics, Z. Taïb [START_REF] Taïb | Branching processes and neutral evolution[END_REF] was able to obtain more precise results (but without considering ages of haplotypes) in the case of CMJ processes where mutations occur at birth. In this case, using the notation α-θ for the (positive) Malthusian parameter clonal families (to be consistent with our notation), he obtained in Theorem (4.6) the convergence of the number of haplotypes carried by more than ce (α-θ)t individuals to a mixed Poisson r.v. with parameter Cw ∞ /αc α/(α-θ) where the constant C is explicit and w ∞ is the limit of N t e -αt when t → +∞, where N t is the population size at time t. This result is consistent with ours, although the precise value of the constant C is not the same.

Although not stated in [START_REF] Taïb | Branching processes and neutral evolution[END_REF], one can easily extend this result using [START_REF] Leadbetter | Extremes and related properties of random sequences and processes[END_REF]Thm. A.1.] to obtain the convergence in distribution on the event of non-extinction of the point measure η t (•), where η t ([a 0 , a 1 ]) is the number of haplotypes carried at time t by a number of individuals in [a 0 e (α-θ)t , a 1 e (α-θ)t ], towards a mixed Poisson point process (also known as Cox process) on R + with intensity measure

µ(dx) := Cw ∞ (α -θ)x 1+α/(α-θ) dx.
This is actually the kind of results that we are able to prove when mutations occur during the life of individuals and when clonal families are subcritical or critical (see below). Unfortunately, the method we develop in Section 4 does not apply to the supercritical case.

Subcritical clonal families

When α < θ, we prove in Proposition 3.4 that for all a ∈ R

lim t→+∞ E t O t αt θ + a = k e -θa
for an explicit constant k, and that the maximal size of families older than αt/θ + a is tight when t → +∞ for all a ∈ R. We also prove in Proposition 3.5 that for all c ∈ R,

E t L t (x t (c)) ∼ k ϕ(θ) c+{-xt(c)} , (2.10)
where {x} denotes the fractional part of the real number x, i.e. {x} = x -⌊x⌋ = x + ⌈-x⌉, where ⌊•⌋ (resp. ⌈•⌉) is the integer part (resp. ceiling) function, and

x t (c) = k ′ t -k ′′ log t + c and ϕ(θ) := 1 - ψ(θ) θ , (2.11)
for explicit constants k, k ′ , k ′′ . In addition, we prove that the age of these large families is of the order of log t/(θ -α). Hence the largest and oldest families are different in the subcritical case. Note that, both for large ages and large sizes, random fluctuations are of order 1 (the parameters a and c are not multiplied by a function of t). This explains why the right-hand side of (2.10), while remaining bounded, depends on t: on the one hand, the size of the largest families grows with time as x t (0) and has fluctuations of order 1; on the other hand the size of the largest families is an integer and hence L t (x t (c)) only depends on ⌈x t (c)⌉. Therefore, as a function of c, the right-hand side of (2.10) must only depend on ⌈x t (c)⌉, which is clear since c + {-x t (c)} = -x t (0) + ⌈x t (c)⌉.

This suggests that, given any sequence of times (t k ) k≥0 such that t k → +∞ and {x t k (0)} =: v does not depend on k, the r.v. L t k (x t k (c)) should converge in distribution, or that the r.v. X

(1)

t k -x t k (0),
where X

(1) t is the size of the largest family at time t, should converge in distribution to some r.v. with values in Z -v = {b -v, b ∈ Z}. This is what we prove in Section 4. For example, we shall state here Corollary 4.4.

Let us denote by X

(1) t ≥ X

(2) t ≥ . . . the ordered sequence of family sizes in the population at time t. Let also M(R) be the set of nonnegative σ-finite measures on R, finite on R + , and let us define the semi-vague topology on M(R) as the one induced by all maps of the form

ν ∈ M(R) → R u(x)ν(dx),
for all bounded continuous functions u such that, for some x 0 ∈ R, u(x) = 0 for all x ≤ x 0 . Then, Corollary 4.4 states that the sequence of point measures (Z k ) k≥0 on Z -v defined by

Z k := n≥1 δ X (n) t k -xt k (0)
converges in P ⋆ -distribution on M(R) equipped with the semi-vague topology to a mixed Poisson point measure on Z -{x t 0 (0)} with intensity measure

E k c∈Z-{xt 0 (0)} ϕ(θ) c δ c ,
where k is an explicit constant and the mixture coefficient E has exponential distribution with parameter 1.

We obtain similar results for the oldest families (Theorem 4.5): if

A (1) t ≥ A (2)
t ≥ . . . denotes the ordered sequence of family ages in the population at time t, the family of point measures (Z t , t ≥ 0) on R defined by

Z t := n≥1 δ A (n) t -αt/θ
converges in P ⋆ -distribution on M(R) equipped with the semi-vague topology to a mixed Poisson measure on R with intensity measure E k e -θa da,

where k is an explicit constant.

In the case of CMJ processes with mutations occuring at birth, Jagers and Nerman [10, Applic. C] and Taib [START_REF] Taïb | Branching processes and neutral evolution[END_REF]Prop. (4.2)] obtained similar results for the extremes of the empirical age distribution. Proposition (4.2) of [START_REF] Taïb | Branching processes and neutral evolution[END_REF] states the convergence of the point measure Z t on the event of non-extinction to a mixed Poisson measure on R with intensity measure w ∞ k ′ e -θa da.

(2.13)

As already noted, in the case of splitting trees, the distribution of w ∞ conditional on survival is exponential [START_REF] Lambert | The contour of splitting trees is a Lévy process[END_REF], so that (2.12) has the same form as (2.13), although the constant k ′ is different from k.

The technique used in [START_REF] Taïb | Branching processes and neutral evolution[END_REF] makes use of so-called individual time-dependent random characteristics: for any individual i in the population, we define a nonnegative random process, called random characteristic (χ ti (u), u ∈ R), assigning some score to the individual at age u, such that χ ti (u) = 0 for all u < 0. The random characteristic depends on an extra parameter t. We can then define the branching process counted with the time-dependent random characteristic χ t as

Z χt t := i χ ti (t -σ i ),
where the sum covers the set of all individuals which lived at some time in the population, and σ i is the birth date of individual i. In such situations, the results of [START_REF] Jagers | Limit theorems for sums determined by branching processes and other exponentially growing processes[END_REF] allow one to prove the convergence in distribution of Z χt t as t → +∞, under a set of assumptions, among which the more stringent is that the random characteristic is individual, i.e. that for all t ≥ 0, the random processes (ξ i , χ ti ) for i running in the set of all individuals in the population are i.i.d., where (ξ i (u), u ≥ 0) is the process counting the number of children of individual i before age u.

In [START_REF] Taïb | Branching processes and neutral evolution[END_REF], this method is applied to the population of haplotypes (i.e. individuals above have to be understood as haplotypes), defining for any haplotype i (a variant of) the time-dependent random characteristic χ ti (u) := ½ { αt θ +a≤u<λ i} , where λ i is the life length of haplotype i.

This method cannot be used when mutations occur during the life of individuals, since the age of this individual when the mutation occurs influences the distribution of the progeny of the new haplotype (except when lifetime durations are exponential r.v.), which contradicts the assumption that (ξ i , χ ti ) are i.i.d. One may think of defining another random characteristic based on individuals rather than haplotypes, counting the number of mutations experienced by each individual, which occured more than αt/θ+a time units ago and which has descendants living at present time. With this choice, the random characteristic does not depend on the age of the individual's mother. However, it depends on the whole progeny of the individual, so that (ξ i , χ i ) and (ξ i ′ , χ i ′ ) are independent only if the individuals i does not descend from i ′ and conversely. Therefore, the method of [START_REF] Taïb | Branching processes and neutral evolution[END_REF] cannot be applied to our case. Proposition (4.2) of [START_REF] Taïb | Branching processes and neutral evolution[END_REF] makes use of precise estimates on the tail distribution of the extinction time of a clonal family, which are well-known in this context. No results are given in [START_REF] Taïb | Branching processes and neutral evolution[END_REF] on the size of large families in the subcritical case, presumably because their method would require precise estimates on the tail distribution of the size of a clonal population at any time, which are to our knowledge not known in general for CMJ processes. In our case of splitting trees with mutations occurring during the life of individuals, our formulae (2.4) and (2.5) for the expected frequency spectrum are exact. This allows us to obtain precise estimates for the tail distribution of the size of a clonal population at some time, conditionally on the survival of the (clonal or not clonal) progeny of this population at time t. We are then able to deduce exact asymptotics for the tail distribution of the size of the largest family using a different method than in [START_REF] Taïb | Branching processes and neutral evolution[END_REF] (see the proof of Theorem 4.2).

We chose here to present results on largest and oldest haplotypes, but our method easily applies to intermediate regimes. For example, one can easily adapt our calculations to prove that, for all γ ∈ [0, 1] and c ∈ R,

E t M t x t (c), αγ θ t ∼ k ϕ(θ) c+{-xt(c)} ,
where

x t (c) = α(1 -γ)t -log ϕ(θ) + c.
Similarly, one can prove the convergence of the point measure of sizes of families older than (αγ/θ)t as t → +∞ and compute the limit as a mixed Poisson point measure.

Critical clonal families

When α = θ, we prove in Proposition 3.6 that, for all a ∈ R,

lim t→+∞ E t O t t - log t α + a = ke -αa
for an explicit constant k, and that the maximal size of families older than t -log t/α + a is tight as t → +∞ for all a ∈ R. As in the subcritical case, fluctuations are of order 1 here. We also prove in Proposition 3.7 that, for all c ∈ R,

lim t→+∞ E t L t (x t (c)) = k exp - 2ψ ′ (α) α c , where x t (c) = k ′ t 2 + k ′′ t log t + ct (2.14)
and the constants k, k ′ , k ′′ are explicit. In addition, we prove that the age of these large families is of the order of t/2. Here, since the fluctuations are of the order of t, the limit does not involve {-x t (c)} as in (2.10) We are then able to deduce from these estimates the convergence of correctly rescaled point measures of the size of the largest and the age of the oldest families (Theorems 5.1 and 5.3): using the same notation as in Section 2.3.2, the family of point measures (Z t , t ≥ 0) defined by

Z t := n≥1 δ X (n) t -x t (0) t
converges in P ⋆ -distribution on M(R) equipped with the semi-vague topology to a mixed Poisson measure on R with intensity measure

E k exp - 2ψ ′ (α) α c dc,
where the constant k is explicit. Note that this statement and the definition (2.14) are actually a little bit different than those of Sections 3.4 and 5.1. However, the results stated here can be proved by slightly modifying the proofs of Proposition 3.7 and Theorem 5.1. We have chosen to leave this to the interested reader.

Similarly, we obtain the convergence of the family of point measures (Z t , t ≥ 0) defined by

Z t := n≥1 δ A (n) t -t+ log t α to a mixed Poisson point measure on R with intensity measure E e -αa .
(2.15)

Again, in [START_REF] Jagers | Limit theorems for sums determined by branching processes and other exponentially growing processes[END_REF] and [START_REF] Taïb | Branching processes and neutral evolution[END_REF], a similar result is stated only for extreme ages. It takes the same form as our result with E replaced by w ∞ and with a different multiplicative constant in the intensity measure (2.15).

Large time asymptotics for the expected number of frequent or old haplotypes

Our goal here is to prove the convergence results on the expectation of L t (x t ) and O t (s t ) stated above, when clonal families are supercritical, subcritical or critical. We start with preliminary estimates on the scale functions W and W θ .

Preliminary results on scale functions

Lemma 3.1 The survival probability of the splitting tree is α/b, and the scale function W has the following asymptotic behavior

W (t)e -αt = 1 + O(e -γt ) ψ ′ (α)
as t → +∞, for some constant γ > 0.

Proof. The expression of the survival probability and the fact that W (t) ∼ e αt /ψ ′ (α) were already proved in [START_REF] Lambert | The contour of splitting trees is a Lévy process[END_REF]. In order to get the higher-order term, we use the fact that

P(J > t) = α b + O(e -γt ) (3.1)
as t → +∞, where J is the extinction time of the splitting tree started from one individual with random lifespan, distributed as V . Indeed, we know from [START_REF] Lambert | The contour of splitting trees is a Lévy process[END_REF] that the law

P ♮ := P(• | J < ∞)
is that of a subcritical splitting tree with lifespan measure e -αr Λ(dr). In particular, under P ♮ , the lifetime V of a single individual has exponential moments, and the first hitting time τ 0 of 0 by the contour process of the spliting tree also has exponential moments (because its Laplace exponent is the inverse of ψ ♮ (•) := ψ(• + α)). Since J ≤ τ 0 a.s., J has exponential moments, that is, there is some γ > 0 such that E ♮ (e 2γJ ) < ∞. As a consequence, also since α/b = P(J = ∞),

P(J > t) - α b = 1 - α b P ♮ (J > t) = O(e -γt ).
Therefore, it follows from (2.3) that

W (t)e -αt = exp - ∞ t (bP(J > x) -α)dx ψ ′ (α) ,
and the result then follows from (3.1). 2

From this result and the definition (2.6) of W θ , we can deduce the following lemma. We recall that

ψ θ (x) = xψ(x + θ) x + θ and ψ ′ θ (α -θ) = (α -θ)ψ ′ (α) α . Lemma 3.2 (i) Assume α > θ ≥ 0. Then W θ (t) ∼ e (α-θ)t ψ ′ θ (α -θ) as t → +∞. (ii) Assume 0 < α < θ. Then θ ψ(θ) -W θ (t) ∼ e -(θ-α)t |ψ ′ θ (α -θ)| (3.2)
as t → ∞, and

1 - 1 W θ (t) = ϕ(θ)(1 -ρ(t)),
where ϕ(θ) is defined in (2.11) and ρ(•) is a non-increasing function such that

ρ(t) ∼ ψ 2 (θ) θ 2 ϕ(θ)|ψ ′ θ (α -θ)| e -(θ-α)t (3.3) as t → ∞. (iii) Assume α = θ > 0. Then W α (t) = αt ψ ′ (α) + 1 ψ ′ (α) + α +∞ 0 W (y)e -αy - 1 ψ ′ (α) dy + o(1)
as t → +∞.

Proof. Points (i) and (iii) are easy consequences of Lemma 3.1 and the definition (2.6) of W θ . Point (i) can also be seen as a trivial corollary of Lemma 3.1 since when α > θ, W θ is the scale function of a supercritical splitting tree.

For Point (ii), by Tauberian theorems (see [START_REF] Lambert | The contour of splitting trees is a Lévy process[END_REF]), we have

W θ (t) → 1/ψ ′ θ (0) = θ/ψ(θ) as t → ∞. Since 1 ψ(θ) = ∞ 0 W (y)e -θy dy, (2.6) yields W θ (t) - θ ψ(θ) = e -θt W (t) -θ ∞ t W (
y)e -θy dy.

Since W (t) ∼ e αt /ψ ′ (α), we have

∞ t W (y)e -θy dy ∼ 1 ψ ′ (α) ∞ t
e -(θ-α)y dy as t → +∞. This entails (3.2). Since one has

ρ(t) = 1 ϕ(θ) 1 W θ (t) - ψ(θ) θ and 1 W θ (t) - ψ(θ) θ = θ ψ(θ) -W θ (t) W θ (t) θ ψ(θ)
, the proof of (ii) is easily completed. 2

The case of supercritical families (α > θ)

In the case of supercritical clonal families, the asymptotic expected number of frequent haplotypes can be explicitly computed. Note that in the next statement and elsewhere in the paper, the Dirac measure at time 0 corresponds to the contribution of the family carrying the ancestral type.

Proposition 3.3 Assume α > θ ≥ 0 and let 0 ≤ a 0 < a 1 ≤ +∞ and c ≥ 0. For all t ≥ 0, let

x t (c) = c exp((α -θ)t).
Then

lim t→+∞ E t [M t (x t (c), t -a 1 , t -a 0 )] = α -θ α a 1 a 0 exp αy -c ψ ′ θ (α -θ) e (α-θ)y (θ dy + δ 0 (dy)).
Proof. Using (2.5), (2.8) and Lemma 3.1, for all t ≥ a, we have

E t [M t (x t (c), t -a 1 , t -a 0 )] = +∞ k=⌈ce (α-θ)t ⌉ W (t) e -θt W θ (t) 2 1 - 1 W θ (t) k-1 ½ {a=0} + t-a 0 (t-a 1 )∨0 θW (t) e -θx W θ (x) 2 1 - 1 W θ (x) k-1 dx = ½ {a 0 =0} W (t) W θ (t) e -θt 1 - 1 W θ (t) ⌈ce (α-θ)t ⌉-1 + W (t) t-a 0 (t-a 1 )∨0 θ e -θx W θ (x) 1 - 1 W θ (x) ⌈ce (α-θ)t ⌉-1 dx ∼ 1 ψ ′ (α) a 1 ∧t a 0 e θy W θ (t -y)e -(α-θ)t exp (⌈ce (α-θ)t ⌉ -1) log(1 -1/W θ (t -y)) (θdy + δ 0 (dy)), (3.4)
where we recall that ⌈•⌉ is the ceiling function. Since W θ is nondecreasing and W θ (0) = 1, it follows from Lemma 3.2 (i) that there exists a constant C > 0 such that

1 C e (α-θ)t ≤ W θ (t) ≤ Ce (α-θ)t , ∀t ≥ 0.
Therefore, for all y ≥ 0, the quantity inside the integral in the r.h.s. of (3.4) is smaller than

C ′ e αy exp -C ′′ e (α-θ)y
for some constants C ′ , C ′′ > 0. Now, using Lemma 3.2 (i) again, for all y ≥ 0, the quantity inside the integral in the r.h.s. of (3.4) converges to

ψ ′ (α)(α -θ) α e αy exp -cψ ′ θ (α -θ)e (α-θ)y
when t → +∞. Proposition 3.3 then follows from the dominated convergence theorem. 2

The case of subcritical families (α < θ)

Our first result deals with ages and sizes of the oldest clonal families. Note that the scaling constant a varies in R.

Proposition 3.4 When α < θ, for any a ∈ R,

lim t→+∞ E t O t α t θ + a = ψ(θ) θψ ′ (α) e -θa . (3.5)
In addition, for any

x t → +∞ as t → +∞, lim t→+∞ E t M t x t , α t θ + a = 0. (3.6)
Proof. Using (2.5) and (2.8) as in the proof of Proposition 3.3, we have

E t [O t (αt/θ + a)] = W (t) t α t θ +a e -θx W θ (x) (θdx + δ t (dx)) ∼ ψ(θ)e αt ψ ′ (α) t α t θ +a e -θx dx + 1 θ δ t (dx) ,
where we used that W θ (x) → θ/ψ(θ) as x → +∞ (Lemma 3.2). Eq. (3.5) then easily follows.

Similarly,

E t [M t (x t , αt/θ + a)] = W (t) t α t θ +a e -θx W θ (x) 1 - 1 W θ (x) ⌈xt⌉-1 (θdx + δ t (dx)) ≤ 1 - 1 W θ (t) ⌈xt⌉-1 W (t) t α t θ +a e -θx W θ (x) (θdx + δ t (dx)),
since W θ is nondecreasing. Eq. (3.6) then follows from (3.5) and the fact that (1

-1/W θ (t)) ⌈xt⌉ → 0 as t → +∞, since W θ (t) → θ/ψ(θ) > 1. 2
Our next result gives the asymptotics of the expected number of large families (notice again that the scaling constant c varies in R) and states that their ages all are asymptotically equivalent to (θ -α) -1 log(t). We recall that ϕ(θ) < 1, so that | log ϕ(θ)| = -log ϕ(θ). Proposition 3.5 Assume α < θ. For all c ∈ R, let

x t (c) := αt -θ θ-α log t | log ϕ(θ)| + c.
Then, for all ε > 0,

E t [L t (x t (c))] ∼ E t M t x t (c), 1 -ε θ -α log t, 1 + ε θ -α log t ∼ A(θ) ϕ(θ) c-1+{-xt(c)} (3.7)
as t → +∞, where we recall that {•} is the fractional part function and

A(θ) := Γ θ θ-α ψ(θ) α |ψ ′ θ (α -θ)| α θ-α θ 2 αψ(θ) 2 ϕ(θ) | log ϕ(θ)| θ θ-α , (3.8)
where Γ(s) = ∞ 0 y s-1 e -y dy is the Gamma function.

Proof. Proceeding similarly as in the proof of Proposition 3.3, we deduce from Lemma 3.2 (ii) that

E t [L t (x t (c))] = W (t) ϕ(θ) ⌈xt(c)⌉-1 t 0 e -θx W θ (x) (1 -ρ(x)) ⌈xt(c)⌉-1 (θdx + δ t (dx)) ∼ t θ/(θ-α) ϕ(θ) c-1+{-xt(c)} ψ ′ (α) t 0 e -θx+(⌈xt(c)⌉-1) log(1-ρ(x)) W θ (x) (θdx + δ t (dx)) (3.9)
as t → +∞, where we used the relation

⌈x t (c)⌉ -1 = x t (0) + c -1 + {-x t (c)}. We will now abridge x t (c) into x t .
Let ε > 0. Let us first bound from above the previous integral restricted to the complement of 1-ε θ-α log t, 1+ε θ-α log t . On the one hand, using the inequality log(1 -ρ(x)) ≤ 0 and the fact that W θ (x) converges to a positive constant when x → +∞, we have for all ε > 0

+∞ 1+ε θ-α log t e -θx+(⌈xt⌉-1) log(1-ρ(x)) W θ (x) (θdx + δ t (dx)) ≤ C e -θt + e -θ 1+ε θ-α log t = o(t -θ θ-α ) as t → +∞.
On the other hand, since ρ(x) is non-increasing and using

(3.3), ρ(x) ≥ ρ( 1-ε θ-α log t) ≥ Ct -1+ε for all 0 ≤ x ≤ (1 -ε)/(θ -α) log t. Therefore, 1-ε θ-α log t 0 e -θx+(⌈xt⌉-1) log(1-ρ(x)) W θ (x) (θdx + δ t (dx)) ≤ C ′ 1-ε θ-α log t 0 e -θx e -C(⌈xt⌉-1)t -1+ε dx.
Since (⌈x t ⌉-1)t -1+ε ≥ C ′′ t ε for t large enough, we deduce that the previous integral is also o(t -θ θ-α ). In conclusion, E t [L t (x t (a))] and E t M t x t (a), 1-ε θ-α log t, 1+ε θ-α log t are both asymptotically equivalent to E t (ε), provided that E t (ε) is uniformly bounded from below, where

E t (ε) := ψ(θ) t θ/(θ-α) ϕ(θ) a-1+{-xt(a)} ψ ′ (α) 1+ε θ-α log t 1-ε θ-α log t e -θx+(⌈xt⌉-1) log(1-ρ(x)) dx. (3.10)
Note that, since W θ (x) → ψ(θ)/θ when x → +∞, the replacement of W θ (x) by its limit in the r.h.s. of (3.9) is justified. The proof of Proposition 3.5 will hence be completed if we can prove that

E t (ε) ∼ A(θ) ϕ(θ) c-1+{-xt(c)} .
This is the aim of the rest of the proof. Set

B := ψ 2 (θ) θ 2 ϕ(θ)|ψ ′ θ (α -θ)| , (3.11)
and we make the change of variable y := B(⌈x t ⌉ -1)e -(θ-α)x in (3.10):

E t (ε) ∼ ψ(θ) t θ/(θ-α) ϕ(θ) c-1+{-xt} ψ ′ (α)(θ -α)(B(⌈x t ⌉ -1)) θ/(θ-α) B(⌈xt⌉-1)t -1+ε B(⌈xt⌉-1)t -1-ε y θ/(θ-α)-1 exp (⌈x t ⌉ -1) log 1 -ρ log B(⌈xt⌉-1) y θ -α dy. (3.12)
Now, using Lemma 3.2 (ii) again, we have for all y > 0

ρ log B(⌈xt⌉-1) y θ -α ∼ Be log y B(⌈x t ⌉-1) = y ⌈x t ⌉ -1
as t → +∞. Therefore, the exponential in the r.h.s. of (3.12) converges for all y > 0 to e -y when t → +∞. In addition, using the inequalities log(1 -ρ(x)) ≤ -ρ(x) and ρ(x) ≥ Ce -(θ-α)x for all x large enough, we have

y θ θ-α -1 exp (⌈x t ⌉ -1) log 1 -ρ log B(⌈xt⌉-1) y θ -α ≤ y α θ-α e -Cy .
Since x t t -1-ε → 0 and x t t -1+ε → +∞ when t → +∞, Lebesgue's theorem finally yields

E t (ε) ∼ ψ(θ)ϕ(θ) c-1+{-xt} Γ( θ θ-α ) ψ ′ (α)(θ -α)B θ/(θ-α) t ⌈x t ⌉ -1 θ/(θ-α) ,
Remembering that x t ∼ αt/| log ϕ(θ)| as t → +∞ concludes the proof of Proposition 3.5. 2

The case of critical families (α = θ)

The following result gives the asymptotic expected number of old families and states that their sizes are tight.

Proposition 3.6 Assume α = θ > 0. For all a ∈ R, we have

lim t→+∞ E t O t t - log t α + a = e -αa α .
In e -αx dx + 1 αt .

The first limit easily follows. The second limit is obtained exactly as in the proof of Proposition 3.4. 2

The computations for the most frequent haplotypes are more involved. The following result gives the asymptotics of the expected number of large families and states that their ages are all asymptotically equivalent to t/2. Proposition 3.7 Assume α = θ > 0. For all c ∈ R, we define

x t (c) := α 2 4ψ ′ (α) t - log t 2α + c 2 .
Then, for all ε > 0,

lim t→+∞ E t [L t (x t (c))] = lim t→+∞ E t M t x t (c), 1 -ε 2 t, 1 + ε 2 t = 2π α e B-ψ ′ (α) 2 e -α c
, where

B = 1 + α +∞ 0 ψ ′ (α)W (y)e -αy -1 dy. (3.13)
Proof. Similarly as in the proof of Proposition 3.5, we have

E t [L t (x t (c))] ∼ e αt ψ ′ (α) t 0 e -αx W α (x) e (⌈xt(c)⌉-1) log 1-1 Wα(x) (αdx + δ t (dx)). (3.14)
Let ε > 0. Let us first bound from above the previous integral restricted to the complement of 1-ε 2 t, 1+ε 2 t . Fix η ∈ (0, 1). By Lemma 3.2 (iii), for all x large enough, 1 ≤ W α (x) ≤ αt ψ ′ (α)(1-η) . Hence, using the fact that x t (c) ∼ α 2 t 2 /4ψ ′ (α), for t sufficiently large,

t 1+ε 2 t e -αx W α (x) e (⌈xt(c)⌉-1) log 1-1 Wα(x) (αdx + δ t (dx)) ≤ t 1+ε 2 t e -αx-(⌈xt(c)⌉-1) (1-η)ψ ′ (α) αx (αdx + δ t (dx)) ≤ α t 1+ε 2 t e -α x+ (1-2η)t 2 4x
dx + e -αt(1+(1-2η)/4) .

The quantity inside the integral in the integral of the r.h.s. is maximal for x = (1 -2η) 1/2 t/2, which is outside the integration domain, so that

t 1+ε 2 t e -α x+ (1-2η)t 2 4x dx ≤ t exp -α t(1 + ε) 2 + t(1 -2η) 2(1 + ε) .
This last quantity is o(e -αt ) if one chooses η < ε 2 /2.

Using the fact that W α (x) is non-decreasing, larger than (or equal to) 1 and that e -αx ≤ 1, we have

log t 0 e -αx W α (x) e (⌈xt(c)⌉-1) log 1-1 Wα(x) αdx ≤ αe - ⌈x t (c)⌉-1
Wα(log t) log t.

Since x t (c) ∼ α 2 t 2 /4ψ ′ (α), using Lemma 3.2 (iii) again, for t large enough, the previous integral is smaller than α log(t) e -Ct 2 / log t = o(e -αt ), for a constant C > 0 independent of t.

Finally, using Lemma 3.2 (iii) similarly as above, for all η ∈ (0, 1), for t large enough,

1-ε 2 t log t e -αx W α (x) e (⌈xt(c)⌉-1) log 1-1 Wα(x) α dx ≤ α 1-ε 2 t log t e -α x+ (1-2η)t 2 4x
dx.

Taking η small enough so that (1 -η)

E t (ε) := αe αt ψ ′ (α) 1+ε 2 t 1-ε 2 t e -αx W α (x) e (⌈xt(c)⌉-1) log 1-1 Wα(x) dx.
Therefore, it only remains to prove that

lim t→+∞ E t (ε) = 2π α e B-ψ ′ (α) 2 e -α c .
Using the facts that W α (x) ∼ αx/ψ ′ (α) and that | log(1 -1/W α (x))| ≤ C/t for all x large enough, we have

E t (ε) ∼ e αt 1+ε 2 t 1-ε 2 t e -αx e xt(c) log 1-1 Wα(x) dx x , when t → +∞. It follows from Lemma 3.2 (iii) that log 1 - 1 W α (x) = - ψ ′ (α) αx + ψ ′ (α)(B -ψ ′ (α)/2) α 2 x 2 + o 1 x 2 (3.15)
as x → +∞. Therefore,

F (t) := x t (c) sup 1-ε 2 t≤x≤ 1+ε 2 t log 1 - 1 W α (x) + ψ ′ (α) αx - ψ ′ (α)(B -ψ ′ (α)/2) α 2 x 2 → 0
as t → +∞. Hence, using the facts that x t (c) ∼ α 2 t 2 4ψ ′ (α) and that x ∈ [ 1-ε 2 t, 1+ε 2 t], for t large enough,

2e -Cε (1 + ε)t e B-ψ ′ (α) 2 e αt 1+ε 2 t 1-ε 2 t e -αx-x t (c)ψ ′ (α) αx dx ≤ E t (ε) ≤ 2e Cε (1 -ε)t e B-ψ ′ (α) 2 e αt 1+ε 2 t 1-ε 2 t e -αx-x t (c)ψ ′ (α) αx dx, (3.16)
for a constant C independent of ε and t. Now, let us compute the asymptotic behavior of the integral involved in these inequalities: first, the change of variable x = β t y with

β t = x t (c)ψ ′ (α)/α yields 1+ε 2 t 1-ε 2 t e -αx-x t (c)ψ ′ (α) αx dx = β t 1+ε 2β t t 1-ε 2β t t e -αβt y+ 1 y dy.
Next, we introduce the new change of variable

y = 2 + z 2 + z √ z 2 + 4 2 .
This defines a C 1 -diffeomorphism from z ∈ (-∞, +∞) to y ∈ (0, +∞) such that

y + 1 y = 2 + z 2 .
Note that z > 0 if and only if y > 1, which means that

z = sgn(y -1) y + 1 y -2,
where sgn(x) = 1 if x ≥ 0 and -1 if x < 0. Since

β t = t -log t 2α + c 2 ∼ t 2 , (3.17)
the inequality (1 -ε)t/2β t < 1 < (1 + ε)t/2β t holds for t large enough, which yields

1+ε 2 t 1-ε 2 t e -αx-x t (c)ψ ′ (α) αx dx = β t (1+ε)t 2β t + 2β t (1+ε)t -2 -(1-ε)t 2β t + 2β t (1-ε)t -2 e -αβt(2+z 2 ) z + z 2 + 2 √ z 2 + 4 dz. Now, lim t→+∞ (1 -ε)t 2β t + 2β t (1 -ε)t -2 = ε √ 1 -ε and lim t→+∞ (1 + ε)t 2β t + 2β t (1 + ε)t -2 = ε √ 1 + ε . Since z + z 2 +2
√ z 2 +4 is C 1 in the neighborhood of 0, with value 1 at z = 0, we obtain

(1 -Cε)β t e -2αβt (1+ε)t 2β t + 2β t (1+ε)t -2 -(1-ε)t 2β t + 2β t (1-ε)t -2 e -αβtz 2 dz ≤ 1+ε 2 t 1-ε 2 t e -αx-x t (c)ψ ′ (α) αx dx ≤ (1 + Cε)β t e -2αβt (1+ε)t 2β t + 2β t (1+ε)t -2 - (1-ε)t 2β t + 2β t (1-ε)t -2
e -αβtz 2 dz 20 for t large enough. Making the last change of variable u = √ 2αβ t z finally yields

(1 -C ′ ε) πβ t α e -2αβt ≤ 1+ε 2 t 1-ε 2 t e -αx-x t (c)ψ ′ (α) αx dx ≤ (1 + C ′ ε) πβ t α e -2αβt
for t large enough. Combining this with (3.16), we obtain that, for all ε > 0 small enough, there exists t 0 > 0 such that, for all t > t 0 ,

(1 -C ′′ ε) 2 t e B-ψ ′ (α) 2 e αt πβ t α e -2αβt ≤ E t (ε) ≤ (1 + C ′′ ε) 2 t e B-ψ ′ (α) 2 e αt πβ t α e -2αβt ,
where the constant C ′′ is independent of ε and t. It then follows from (3.17) that

(1 -C ′′ ε) 2π α e B-ψ ′ (α) 2 e -αc ≤ E t (ε) ≤ (1 + C ′′ ε) 2π α e B-ψ ′ (α) 2 e -αc .
Since we have shown in the beginning of the proof that E t (ε) = E t (ε ′ ) + o(1) for all ε ′ < ε, the previous inequality applied to E t (ε ′ ) concludes the proof of Proposition 3.7. 2

4 Large or old families: convergence in distribution for subcritical clonal families

In all this section, we assume α < θ. Our goal is to compute the joint limiting distribution when t → +∞ of the sizes of the largest families living at time t, and of the ages of the oldest families living at time t. Before this, we give estimates on the second factorial moment of the number of large families, used repeatedly in the sequel.

A preliminary lemma

Let us recall that, under P t , we can adopt the representation of the genealogy at time t by the coalescent point process H 0 , H 1 , H 2 , . . ., where H 0 = +∞ and the (H i ; i ≥ 1) are i.i.d., killed at their first value (= H Nt ) larger than t. For all i ≥ 0, we call branch i the lineage represented by H i . For all t > 0, x ≥ 1, 0 ≤ s 1 < s 2 ≤ +∞, we define K t (x, s 1 , s 2 ) as the number of haplotypes carried by more than x individuals alive at time t, whose original mutation occurred on the ancestral lineage (branch 0), and has age in (s 1 , s 2 ] (or, equivalently, in (s 1 , s 2 ∧ t]).

Lemma 4.1 For all t > 0, x ≥ 1, 0 ≤ s 1 < s 2 ≤ t, we have E t [M t (x, s 1 , s 2 )(M t (x, s 1 , s 2 ) -1)] ≤ 2 E t K t (x, s 1 , s 2 ) 1 + 1 W (s 1 ) -1 W (t) 1 -1 W (t) E t N t × × b(1 + θ(s 2 -s 1 )) α 1 - 1 W θ (s 2 ) ⌈x⌉-1 e -θs 1 + s 1 0 θe -θz W θ (s 2 ) -W θ (s 1 -z) W θ (s 2 ) dz +4 1 W (s 1 ) -1 W (t) 1 -1 W (t) E t N t E t K t (⌈x/2⌉,
E t K t (x, s 1 , s 2 ) ≤ b α s 2 s 1 1 - 1 W θ (y) ⌈x⌉-1 e -θy + y 0 θe -θz W θ (y) -W θ (y -z) W θ (y) dz (θdy + δ t (dy)) (4.2) ≤ b α s 2 s 1 1 - 1 W θ (y) ⌈x⌉-1 (θdy + δ t (dy)). (4.3)
This lemma is proved in the Appendix.

Convergence in distribution of the size of the most frequent haplotype

Let us recall the notation

X (1) t ≥ X (2) t ≥ . . . ≥ X (k) t ≥ .
. . for the ordered sequence of sizes of all living families in the population at time t (with the convention that X (k) t = 0 when k is larger than the number of living haplotypes at time t). Our first goal is to prove the convergence in distribution of X (1) using only the exact formulae (2.4) and (2.5) and the coalescent point process construction of the genealogy of the splitting tree.

The general idea is the following one. We divide the population at time t into several subpopulations corresponding to distinct ancestors at a given time s, as shown in Fig. 2. This gives a sequence of sub-trees (T i ) 1≤i≤Nt,s , where N t,s is the number of individuals alive at time s having descendants at time t. These individuals are represented by crosses in Fig. 2. We choose s = s t in such a way that N t,st → ∞ and the event under consideration (here, the event that there exists a haplotype carried by more than x t individuals at time t) has a small probability in each sub-tree and are "nearly independent" (in a sense specified in the proofs below) in distinct sub-trees. The key argument of the proof, for which Lemma 4.1 is needed, consists in checking that, in each subtree, the unknown probability that there exists a haplotype satisfying the property under consideration (here, carried by more than x t individuals) is close to the expected number of such haplotypes, which is known explicitly. Here, this reads

P t [L t-st (x t ) ≥ 1] ∼ E t L t-st (x t ). Theorem 4.2 Assume α < θ. For all c ∈ R, let x t (c) := αt -θ θ-α log t | log ϕ(θ)| + c. (4.4)
Then P t (X (1) t < x t (c)) ∼ 1 1 + A(θ)ϕ(θ) c-1+{-xt(c)} as t → +∞, where A(θ) is defined in (3.8). Proof. Set F (t, x) := P t (X (1) t
≥ x) = P t [L t (x) ≥ 1], G(t, x) := E t [L t (x)]
and F (t, x, s)

:= P t [M t (x, s) ≥ 1].
We have for all s < t 0 ≤ F (t, x) -P t ∃i ∈ {1, . . . , N t,s } : T i contains a haplotype carried by more than x individuals ≤ F (t, x, t -s).

which also reads

0 ≤ F (t, x) -1 + E t [(1 -F (t -s, x)) Nt,s ] = F (t, x) - 1 1 + P(H > t | H > t -s) 1 F (t-s,x) -1 ≤ F (t, x, t -s), (4.5)
since N t,s is a geometric random variable of parameter P(H > t | H > t -s). In view of this, in order to find a non-trivial limit for F (t, x t ), we need to find s t and x t such that F (t, x t , t -s t ) = o(1) and F (t -s t , x t ) = o(1) and is asymptotically equivalent to

P(H > t | H > t -s t ) = W (t -s t )/W (t) ∼ e -αst (4.6)
as t → +∞. In order to find an explicit asymptotic equivalent of F (t -s t , x t ), we will compare it with G(t -s t , x t ). Let us check that the choice x t (c) in (4.4) for x t and

s t = s t (b) = t -b log t
satisfy the above properties for all b > 1/(θ -α).

On the one hand, the fact that F (t, x t (c), t -s t (b)) = o( 1) is an immediate consequence of Proposition 3.5, since b log t > (1 + ε) log t/(θ -α) for some ε > 0. On the other hand, we can compute an asymptotic equivalent of G(t -s t (b), x t (c)) following closely the computation of the proof of Proposition 3.5. Here are the main steps of the computation: we have

G(t -s t (b), x t (c)) = W (t -s t (b)) 1 - ψ(θ) θ ⌈xt(c)⌉-1 t-st(b) 0 e -θx W θ (x) (1 -ρ(x)) ⌈xt(c)⌉-1 (θdx + δ t-st(b) (dx)) ∼ e -αst(b) t θ/(θ-α) ϕ(θ) c-1+{-xt(c)} ψ ′ (α) t-st(b) 0 e -θx W θ (x) (1 -ρ(x)) ⌈xt(c)⌉-1 (θdx + δ t-st(b) (dx)).
It is easy to deduce from Lemma 3.2 (ii) that the contribution of the Dirac mass and of the integral on the interval [0, (1 -ε) log t/(θ -α)] for any fixed ε ∈ (0, 1) are both o(e -αst(b) ). Using the fact that W θ (x) → θ/ψ(θ) when x → +∞ and the change of variable y = B(⌈x t (c)⌉ -1)e -(θ-α)x , the contribution of the integral on the interval [(1 -ε) log t/(θ -α), b log t] is asymptotically equivalent to

ψ(θ)e -αst(b) ϕ(θ) c-1+{-xt(c)} ψ ′ (α)(θ -α) t B(⌈x t (c)⌉ -1) θ/(θ-α) B(⌈xt(c)⌉-1) t -(1-ε) B(⌈xt(c)⌉-1) t -b(θ-α) y α/(θ-α) exp   (⌈x t (c)⌉ -1) log   1 -ρ   log B(⌈xt(c)⌉-1) y θ -α       dy.
As in the proof of Proposition 3.5, Lebesgue's dominated convergence theorem then yields

G(t -s t (b), x t (c)) ∼ A(θ) ϕ(θ) c-1+{-xt(c)} P(H > t | H > t -s t (b)) (4.7)
as t → +∞, where we used the fact that x t (c)t -b(θ-α) → 0 when t → +∞ since b > 1/(θ -α). Now, it only remains to check that

G(t -s t (b), x t (c)) ∼ F (t -s t (b), x t (c)) (4.8) when t → +∞. Since for all t, x > 0 0 ≤ G(t, x) -F (t, x) = E t (L t (x)) -P t (L t (x) ≥ 1) ≤ E t [L t (x)(L t (x) -1)],
it is sufficient to prove that b) ). (4.9)

E t L t-st(b) (x t (c)) L t-st(b) (x t (c)) -1 = o (G(t -s t (b), x t (c))) = o(e -αst(
Taking s 1 = 0 and s 2 = t -s t (b) in Lemma 4.1 (4.1) yields

E t L t-st(b) (x t (c)) L t-st(b) (x t (c)) -1 ≤ 2E t K t-st(b) (x t (c))(1 + E t N t-st(b) )× × b(1 + θ(t -s t (b))) α 1 - 1 W θ (t -s t (b)) ⌈xt(c)⌉-1 + 4E t N t-st(b) E t K t-st(b) (x t (c)/2) ,
where we used the notation K s (x) := K s (x, 0, s). Using the inequality E t K s (x) ≤ E t L s (x) = G(s, x) and the estimates

E t N t-st(b) = 1 P(H > t -s t (b)) = W (t -s t (b)) ∼ e α(t-st(b)) ψ ′ (α) , (4.10) 1 - 1 W θ (t -s t (b)) ⌈xt(c)⌉-1 ≤ ϕ(θ) ⌈xt(c)⌉-1 ≤ Ce -αt t θ/(θ-α) ,
and

G(t -s t (b), x t (c)/2) ∼ 2 θ/(θ-α) A(θ) ϕ(θ) c/2-1+{-xt(c)/2} e -α(st(b)-t/2) t -θ/2(θ-α) ,
which can be proved following the same computation as above, we finally obtain for t large enough

E t L t-st(b) (x t (c)) L t-st(b) (x t (c)) -1 ≤ C G(t -s t (b), x t (c)) e α(t-st(b)) log t e -αt t θ/(θ-α) + e 2α(t-st(b)) e -α(st(b)-t/2) t -θ/2(θ-α) ,
which entails (4.9) and concludes the proof of Theorem 4.2. 2

Joint convergence in law of the sizes of the most abundant families

The general idea of the previous argument can be summarized as follows: we construct a random number N t,st of i.i.d. random variables X 1 , . . . , X Nt,s t -the sizes of the most frequent haplotype in each sub-tree-such that X

(1) t = max{X 1 , . . . , X Nt,s t } with high probability. Our previous result then corresponds to a classical argument of extreme value theory, which is known to extend easily to compute the extremes statistics and the joint law of the largest random variables among X 1 , . . . , X Nt,s t . The object of this subsection is to prove that this argument is valid in our situation. Theorem 4.3 Assume α < θ and recall the definition of x t (c) in (4.4). For all n ∈ N, k 1 , . . . , k n ∈ Z + and c 1 , . . . , c n such that c i ≥ c i+1 + 1 for all i ∈ {1, . . . , n -1}, we have, as t → +∞,

P t L t (x t (c 1 )) = k 1 , L t (x t (c 2 )) -L t (x t (c 1 )) = k 2 , . . . , L t (x t (c n )) -L t (x t (c n-1 )) = k n ∼ k 1 + . . . + k n k 1 , . . . , k n τ t (c 1 ) k 1 (τ t (c 2 ) -τ t (c 1 )) k 2 . . . (τ t (c n ) -τ t (c n-1 )) kn (1 + τ t (c n )) k 1 +...+kn+1 , (4.11) with τ t (c) := A(θ)ϕ(θ) c-1+{-xt(c)}
for all c ∈ R, where the constant A(θ) is defined in (3.8).

Proof. Let us denote by

≤ P t [M t (x t (c n ), t -s t (b)) ≥ 1] = F (t, x t (c n ), t -s t (b)) = o(1).
Now, for all fixed t ≥ 0, using the notation X 1 , . . . , X Nt,s t introduced above, we define for all a ∈ R S t (a) = #{i ≤ N t,st : X i ≥ a}.

Defining

C(t, b; c 1 , . . . , c n ; k 1 , . . . , k n ) := S t (x t (c 1 )) = k 1 , S t (x t (c 2 )) -S t (x t (c 1 )) = k 2 , . . . , S t (x t (c n )) -S t (x t (c n-1 )) = k n ,
we have

P t (B(t, b; c 1 , . . . , c n ; k 1 , . . . , k n )) -P t (C(t, b; c 1 , . . . , c n ; k 1 , . . . , k n )) ≤ P t ∃i ≤ N t,st(b) : T i contains at least 2 haplotypes carried by more than x t (c n ) individuals ≤ k≥1 P(H > t | H > t -s t (b)) P(H ≤ t | H > t -s t (b)) k-1 k E t L t-st(b) (x t (c n ))(L t-st(b) (x t (c n )) -1) = E t L t-st(b) (x t (c n ))(L t-st(b) (x t (c n )) -1) P(H > t | H > t -s t (b)) ,
where we used the fact that N t,st(b) has geometric distribution with parameter P(H > t | H > t -s t (b)). Equations (4.6) and (4.9) then yield

P t (A(t; c 1 , . . . , c n ; k 1 , . . . , k n )) -P t (C(t, b; c 1 , . . . , c n ; k 1 , . . . , k n ) = o(1).
Next, P t (C(t, b; c 1 , . . . , c n ; k 1 , . . . , k n )) can be computed using standard extreme value techniques: conditioning on N t,st(b) and considering all the possible ways to realize this event, we have

P t (C(t, b; c 1 , . . . , c n ; k 1 , . . . , k n )) = k≥k 1 +...+kn P(H > t | H > t -s t (b)) P(H ≤ t | H > t -s t (b)) k-1 k k 1 , . . . , k n × P t X 1 , . . . , X k 1 ≥ x t (c 1 ) > X k 1 +1 , . . . , X k 1 +k 2 ≥ x t (c 2 ) > . . . ≥ x t (c n ) > X k 1 +...+kn+1 , . . . , X k = k≥k 1 +...+kn P(H > t | H > t -s t (b)) P(H ≤ t | H > t -s t (b)) k-1 k 1 + . . . + k n k 1 , . . . , k n k k 1 + . . . + k n × F (t -s t (b), x t (c 1 )) k 1 [F (t -s t (b), x t (c 2 )) -F (t -s t (b), x t (c 1 ))] k 2 × . . . . . . × [F (t -s t (b), x t (c n )) -F (t -s t (b), x t (c n-1 ))] kn [1 -F (t -s t (b), x t (c n ))] k-k 1 -...-kn .
The equation

k≥m k m x k-m = 1 (1 -x) m+1 , ∀x ∈ (-1, 1), m ∈ N yields P t (C(t, b; c 1 , . . . , c n ; k 1 , . . . , k n )) = P(H > t | H > t -s t (b))P(H ≤ t | H > t -s t (b)) k 1 +...+kn-1 [P(H > t | H > t -s t (b)) + F (t -s t (b), x t (c n ))P(H ≤ t | H > t -s t (b))] k 1 +...+kn+1 × k 1 + . . . + k n k 1 , . . . , k n F (t -s t (b), x t (c 1 )) k 1 [F (t -s t (b), x t (c 2 )) -F (t -s t (b), x t (c 1 ))] k 2 × . . . . . . × [F (t -s t (b), x t (c n )) -F (t -s t (b), x t (c n-1 ))] kn ,
and Theorem 4.3 then follows from (4.6), (4.7) and (4.8). 2

In order to state our next result, we define the number t n by the equation x tn (0) = n. In view of (4.4), this equation has a unique solution t n if n is large enough, say larger than n 0 . In addition,

t n ∼ | log ϕ(θ)| (θ -α) θ n,
and hence t n → +∞ as n → +∞. We also recall the notation M(R) for the set of nonnegative σ-finite measures on R, finite on R + , and the definition of the semi-vague topology as the one induced by all maps of the form

ν ∈ M(R) → R u(x)ν(dx),
for all continuous bounded function u on R such that there exists x 0 ∈ R such that u(x) = 0 for all x ≤ x 0 . Note that this topology is stronger than the usual vague topology, but weaker than the usual weak topology. Corollary 4.4 Assume α < θ. Then, the sequence of point measures (Z n ) n≥n 0 on Z, defined by

Z n := k≥1 δ X (k)
tn -n , converges as n → +∞ in P ⋆ -distribution on the set M(R) equipped with the semi-vague topology to a mixed Poisson point measure on Z with intensity measure

EA(θ) ψ(θ) θ c∈Z ϕ(θ) c-1 δ c ,
where the mixture coefficient E has exponential distribution with parameter 1.

The proof of such results is quite standard (cf. [START_REF] Kallenberg | Random Measures[END_REF] in the general context of point measures and [START_REF] Leadbetter | Extremes and related properties of random sequences and processes[END_REF] more specifically on extreme values). However, we shall give a proof for sake of completeness and because of the specificity of the semi-vague topology.

Note that one can also easily obtain the convergence, in the sense of finite-dimensional distributions, of any finite sequence of translated extreme family sizes towards the corresponding sequence of extreme points of the limit point measure in the previous result. We shall not prove this, but instead we refer to [START_REF] Leadbetter | Extremes and related properties of random sequences and processes[END_REF] for the proof of similar standard results.

Proof. Let us first prove the convergence in distribution when M(R) is equipped with the vague topology. This amounts to prove the joint convergence in distribution of the random variables L tn (n+i)-L tn (n+i+1)) = L tn (x tn (i))-L tn (x tn (i+1)), giving the number of haplotypes represented by exactly n + i individuals at time t n , for b ≤ i ≤ a for all a < b in Z. Fix b < a in Z and k b , . . . , k a in Z + . On the one hand, we claim that

lim n→+∞ P tn (L tn (n + i) -L tn (n + i + 1) = k i , ∀b ≤ i ≤ a) = lim n→+∞ k≥0 P tn (L tn (x tn (i)) -L tn (x tn (i + 1)) = k i , ∀b ≤ i ≤ a and L tn (x tn (a + 1)) = k) = k≥0 k a + . . . + k b + k k a , . . . , k b , k τ tn (a + 1) k (τ tn (a) -τ tn (a + 1)) ka . . . (τ tn (b) -τ tn (b + 1)) k b (1 + τ t (b)) k+k b +...+ka+1 = k a + . . . + k b k a , . . . , k b [A(1 -ϕ)] ka+...+k b ϕ (a-1)ka+...+(b-1)k b [1 + A(ϕ b-1 -ϕ a )] ka+...+k b +1 ,
where we used the fact that, for all x ∈ Z and n ≥ n 0 ,

τ tn (x) = Aϕ x-1 with A = A(θ) and ϕ = ϕ(θ) := 1 - ψ(θ) θ .
This is an immediate consequence of Theorem 4.3, provided we can justify the exchange of the sum over k and the limit n → +∞, i.e. that we can control the remainder of the series uniformly over n ≥ n 0 . The following inequality, making use of Proposition 3.5, solves this question: for all N ∈ N,

P tn (L tn (x tn (i)) -L tn (x tn (i + 1)) = k i , ∀b ≤ i ≤ a and L tn (x tn (a + 1)) ≥ N ) ≤ P tn (L tn (x tn (a + 1)) ≥ N ) ≤ E tn L tn (x tn (a + 1)) N ≤ 1 N sup t≥0 E t L t (x t (a + 1)) ≤ C N
for some constant C > 0.

On the other hand, assume that E is an exponential random variable with parameter 1, and (P x ) x∈Z is a sequence of r.v. with P x distributed as a mixed Poisson with parameter EA(1 -ϕ)ϕ x-1 and such that the r.v. (P x ) x∈Z are independent conditionally on E. Then,

P(P i = k i , ∀b ≤ i ≤ a) = ∞ 0 dx e -x e -A(1-ϕ)x a m=b ϕ m-1 (xA(1 -ϕ)) ka+...+k b ϕ (a-1)ka+...+(b-1)k b k a ! . . . k b ! = [A(1 -ϕ)] ka+...+k b ϕ (a-1)ka+...+(b-1)k b k a ! . . . k b ! [1 + A(1 -ϕ) a m=b ϕ m-1 ] ka+...+k b +1 ∞ 0 y ka+...+k b e -y dy = k a + . . . + k b k a , . . . , k b [A(1 -ϕ)] ka+...+k b ϕ (a-1)ka+...+(b-1)k b [1 + A(ϕ b-1 -ϕ a )] ka+...+k b +1 ,
where we used the change of variable y = x(1 + A(1 -ϕ) a m=b ϕ m-1 ). Observing that P tn converges to P ⋆ for the total variation norm, this ends the proof of Corollary 4.4 when M(R) is equipped with the vague topology.

To complete the proof of Corollary 4.4, since all the point measures Z n have support in Z, we need to check that, for any continuous bounded function f on R and any sequence (u(k)) k∈Z such that u(k) = 0 for all k ≤ k 0 for some k 0 ∈ Z,

lim n→+∞ E tn f Z u(x)Z n (dx) = E f k>k 0 u(k)P k .
Note first that the sum in the r.h.s. is almost surely finite since, conditional on E, this is a sum of independent r.v. with only finitely many of them being non-zero by Borel-Cantelli's lemma.

Next, fix ε > 0 and let a and T be large enough so that

τ tn (a) 1 + τ tn (a) = Aϕ a-1 1 + Aϕ a-1 ≤ Aϕ a-1 ≤ ε,
and, by Theorem 4.2, sup

t≥T P t X (1) t ≥ x t (a) ≤ 2ε.
Then, for all n such that t n ≥ T ,

E tn f Z u(x)Z n (dx) -E tn f a k=k 0 +1 u(k) L tn (x tn (k)) -L tn (x tn (k + 1)) ≤ 4ε f ∞ .
The first step of the proof then yields

E tn f Z u(x)Z n (dx) -E f a k=k 0 +1 u(k)P k ≤ (4 f ∞ + 1)ε
for all n large enough. Since

P(∃k ≥ a : P k ≥ 1) ≤ k≥a P(P k ≥ 1) = k≥a (1 -e -Aϕ k-1 ) ≤ A k≥a ϕ k-1 ≤ ε 1 -ϕ ,
we finally obtain

E tn f Z u(x)Z n (dx) -E f k>k 0 u(k)P k ≤ (4 f ∞ + 1 + (1 -ϕ) -1 )ε,
which ends the proof of Corollary 4.4. 2

Convergence in distribution of the ages of oldest families

The previous method can easily be extended to prove the convergence of the ages of the oldest families. Let us recall the notation A

(1)

t ≥ A (2) t ≥ . . . ≥ A (k) t ≥ .
. . for the ordered sequence of ages of all alive families at time t (with the convention that A (k) t = 0 when k is larger than the number of alive families at time t). For all n ∈ N, k 1 , . . . , k n ∈ Z + and a 1 > a 2 > . . . > a n , we have

lim t→+∞ P t O t (x t (a 1 )) = k 1 , O t (x t (a 2 )) -O t (x t (a 1 )) = k 2 , . . . , O t (x t (a n )) -O t (x t (a n-1 )) = k n = θψ ′ (α) ψ(θ) k 1 + . . . + k n k 1 , . . . , k n e -θk 1 a 1 (e -θa 2 -e -θa 1 ) k 2 . . . (e -θan -e -θa n-1 ) kn θψ ′ (α) ψ(θ) + e -θan k 1 +...+kn+1
. (4.12)

In addition, the family of M(R)-valued random variables (Z t , t ≥ 0), defined for all t ≥ 0 by

Z t := k≥1 δ A (k) t -αt θ ,
converges as t → +∞ in P ⋆ -distribution in M(R) equipped with the semi-vague topology to a mixed Poisson point measure on R with intensity measure

E ψ(θ) ψ ′ (α) e -θa da, (4.13)
where the mixture coefficient E has exponential distribution with parameter 1.

The proof follows closely the lines of those of Theorems 4.2 and 4.3 and Corollary 4.4. As a first step, we prove the following lemma. Lemma 4.6 With the same notation as in Theorem 4.5, we have for all a ∈ R lim t→+∞

P t A (1) t ≤ αt θ + a = 1 1 + ψ(θ) θψ ′ (α) e -θa .
Proof. The proof of this lemma is similar to the one of Theorem 4.2. Defining for all t, x ≥ 0

F (t, x) = P t (A (1)
t ≥ x) = P t [O t (x) ≥ 1] and G(t, x) = E t [O t (x)],
we have for all x < s < t 0 ≤ F (t, x) -P t ∃i ∈ {1, . . . , N t,s } : T i contains at time t a haplotype older than x = F (t, x) -1

1 + P(H > t | H > t -s) 1 F (t-s,x) -1 ≤ F (t, t -s) ≤ G(t, t -s). (4.14)
Defining

s t (b) = bt with b ∈ (0, 1 -α/θ),
following the proof of Proposition 3.4, one easily checks that G(t, t -s t (b)) = o(1) and

G(t -s t (b), x t (a)) ∼ ψ(θ) θψ ′ (α) e -θa-αst(b) , (4.15)
where we stick to the notation x t (a) = αt θ + a. Then Lemma 4.6 follows from (4.6) and the fact that

G(t -s t (b), x t (a)) ∼ F (t -s t (b), x t (a))
as t → ∞. To prove this last equation, it is sufficient to prove that

E t [O t-st(b) (x t (a))(O t-st(b) (x t (a)) -1)] = o(e -αst(b) ), (4.16)
as in (4.9). Now, we observe that and, by Lemma 3.2 (ii), for a constant C that may change from line to line,

P(H > s | H ≤ t) = 1 W (s) -1 W (t) 1 -1 W (t) ∼ 1 W (s) ∼ ψ ′ (α)e -αs when s, t → +∞ with t -s → +∞ (4.
e -θxt(a) + 0 θe -θz W θ (t -s t (b)) -W θ (x t (a) -z) W θ (t -s t (b)) dz = e -θxt(a) + xt(a) 0 θe -θz W θ (x t (a) -z)ϕ(θ)[ρ(x t (a) -z) -ρ(t -s t (b))]dz ≤ e -θxt(a) + C xt(a) 0 e -θz e -(θ-α)(xt(a)-z) dz ≤ Ce -(θ-α)xt(a) .
Combining these two facts with (4.10) and Lemma 4.1 (4.1) in which we take x = 1, s 1 = x t (a) and s 2 = t -s t (b), we have

E t O t-st(b) (x t (a)) O t-st(b) (x t (a)) -1 ≤ CE t K t-st(b) (1, x t (a), t-s t (b)) 1 + e -αxt(a) e α(t-st(b)) × × (1 + t)e -(θ-α)xt(a) + e -αxt(a) e α(t-st(b)) E t K t-st(b) (1, x t (a), t -s t (b)) . (4.18)
Here, in contrast with the proof of Theorem 4.2, the bound K s (1, x, s) ≤ O s (x) is not sufficient to obtain the desired result. Instead, we use Lemma 4.1 (4.2):

E t K t-st(b) (1, x t (a), t -s t (b)) ≤ b α t-st(b) xt(a)
e -θy + y 0 θe -θz W θ (y -z)ϕ(θ)[ρ(y -z) -ρ(y)]dz (θdy + δ t-st(b) (dy)).

Hence, by Lemma 3.2 (ii) again,

E t K t-st(b) (1, x t (a), t -s t (b)) ≤ C t-st(b) xt(a)
e -θy + y 0 e -(θ-α)(y-z) e -θz dz (θdy + δ t-st(b) (dy))

≤ C t-st(b) xt(a)
e -(θ-α)y (θdy + δ t-st(b) (dy))

≤ Ce -(θ-α)xt(a) .

Together with (4.18), this yields

E t O t-st(b) (x t (a)) O t-st(b) (x t (a)) -1 ≤ C(a)e -αst(b) te -(1-α/θ)αt + e -αbt = o(e -αst(b) ),
where the constant C(a) depends on a but not on t. This concludes the proof of Lemma 4.6. 2

Proof of Theorem 4.5 Equation (4.12) can be deduced from Lemma 4.6 exactly as Theorem 4.3 was deduced from Theorem 4.2. We leave the details to the reader. In view of (4.12), the computation in the proof of Corollary 4.4 immediately proves (replacing τ tn (a) with ψ(θ) θψ ′ (α) e -αa ) that, for all a 1 > a 2 > . . . > a n , the random vector

O t (x t (a 2 )) -O t (x t (a 1 )), . . . , O t (x t (a n )) -O t (x t (a n-1 ))
converges in distribution as t → +∞ to a vector whose coordinates are independent conditionally on E and have mixed Poisson distributions with mixture coefficient E and parameters E ψ(θ) θψ ′ (α) (e -θa 2 -e -θa 1 ), . . . , E ψ(θ) θψ ′ (α) (e -θan -e -θa n-1 ).

It is then standard to deduce the convergence in distribution of Z t to P on M(R) equipped with the vague topology (cf. e.g. [START_REF] Kallenberg | Random Measures[END_REF]Thm. 4.7]). The semi-vague topology can then be handled similarly as in the proof of Corollary 4.4. Again, we leave the details to the reader. 2

5 Large or old families: convergence in distribution for critical clonal families

The method that we used in the previous section can also be applied to the case where α = θ. All the proofs are similar, and we will only give details at places where the proofs differ. We use the same notation as in the previous section.

Frequent haplotypes

Theorem 5.1 Assume α = θ. For all c ∈ R, let

x t (c) = α 2 4ψ ′ (α) t - log t 2α + c 2 .
For all n ∈ N, k 1 , . . . , k n ∈ Z + and c 1 > c 2 > . . . > c n , we have

lim t→+∞ P t L t (x t (c 1 )) = k 1 , L t (x t (c 2 )) -L t (x t (c 1 )) = k 2 , . . . , L t (x t (c n )) -L t (x t (c n-1 )) = k n = α 2π e -B+ ψ ′ (α) 2 k 1 + . . . + k n k 1 , . . . , k n e -αk 1 c 1 (e -αc 2 -e -αc 1 ) k 2 . . . (e -αcn -e -αc n-1 ) kn α 2π e -B+ ψ ′ (α) 2 + e -αcn k 1 +...+kn+1
, where the constant B is defined in (3.13). In addition, the family of M(R)-valued random variables (Z t , t ≥ 0), defined for all t ≥ 0 by

Z t := k≥1 δ X (k) t - α 2 √ ψ ′ (α) (t-log t 2α )
, converges as t → +∞ in P ⋆ -distribution in M(R) equipped with the semi-vague topology to a mixed Poisson point measure on R with intensity measure

E √ 2πα e B-ψ ′ (α) 2 e -αc dc, (5.1)
where the mixture coefficient E has exponential distribution with parameter 1.

The proof of this result is exactly the same as for Theorems 4.3 and 4.5, provided we can prove the following lemma.

Lemma 5.2 With the same notation as in Theorem 5.1, for all c ∈ R,

lim t→+∞ P t (X (1) t < x t (c)) = 1 1 + 2π α e B-ψ ′ (α) 2 e -αc .
Proof. The proof of this result is similar to the one of Theorem 4.2. Fix ε > 0. We first observe that Proposition 3.7 implies that

P t M t x t (c), 0, 1 -ε 2 t ≥ 1 ≤ E t M t x t (c), 0, 1 -ε 2 t = o(1),
and thus

P t (X (1) t ≥ x t (c)) = P t M t x t (c), 1 -ε 2 t ≥ 1 + o(1)
, so that it is enough for us to study P t (M t (x t (c), s

t ) ≥ 1), where we put s

(1)

t := 1 -ε 2 t.
Defining

F (t, x) = P t [M t (x, s (1)
t ) ≥ 1], G(t, x) = E t [M t (x, s (1)
t )] and F (t, x, s)

= P t [M t (x, s) ≥ 1],
we can make the same computation as in the proof of Theorem 4.2 to show that (4.5) holds true if t -s > s By Proposition 3.7, we immediately have F (t, x t (c), t -s t (b)) = o(1). We observe that

G(t -s t (b), x t (c)) = W (t -s t (b)) t-st(b) s (1) t e -αx W α (x) e (⌈xt(c)⌉-1) log(1-1/Wα(x)) (αdx + δ t-st(b) (dx)).
Using the inequality log(1 -x) ≤ -x, Lemma 3.2 (iii) entails that the contribution of the Dirac mass is

O 1 t e -xt(c)/Wα(t-st(b)) .
Fix η ∈ (0, 1). Using the expression of x t (c) and the fact that 1/W α (t) ≥ (1 -η)ψ ′ (α)/(αt) for t large enough, this last quantity is

O e - α(1-η) 4(1-b) t t -1-1-η 4(1-b) = o e -αst(b) ,
where the last equality is valid if one chooses η < (1 -2b) 2 . Hence

G(t -s t (b), x t (c)) = W (t -s t (b)) t-st(b)
s

(1) t e -αx W α (x) e (⌈xt(c)⌉-1) log(1-1/Wα(x)) αdx + o e -αst(b) . Now, the integral in the r.h.s. is exactly the same as in (3.14), except for the interval of integration. We actually proved in the proof of Proposition 3.7 that, since (1-b) > 1/2, this integral is equivalent to

1+ε 2 t 1-ε 2 t
e -αx W α (x) e (⌈xt(c)⌉-1) log(1-1/Wα(x)) αdx,

which is itself equivalent to 1 W (t) 2π α e B-ψ ′ (α) 2 e -αc .
Therefore,

G(t -s t (b), x t (c)) ∼ e -αst(b) 2π α e B-ψ ′ (α) 2 e -αc , (5.2)
and, recalling that (4.5) holds (with our current notation), the proof of Lemma 5.2 will be completed if we can prove that

G(t -s t (b), x t (c)) ∼ F (t -s t (b), x t (c))
as t → +∞. Again, this is implied by the estimate

E t [M t-st(b) (x t (c), s (1)
t )(M t-st(b) (x t (c), s

t ) -1)] = o(e -αst(b) ), (5.3) which we now prove. Applying Lemma 4.1 (4.1) with x = x t (c), s 1 = s

t and s 2 = t -s t (b), and combining the result with (4.17) and the fact that, for all s ≤ t,

e -αs + s 0 αe -αz W α (t) -W α (s -z) W α (t) dz ≤ e -αs + s 0 αe -αz = 1,
we obtain

E t [M t-st(b) (x t (c), s (1)
t )(M t-st(b) (x t (c), s

t ) -1)]

≤ C E t K t-st(b) (x t (c), s (1)
t , t -s t (b)) 1 + e -αs (1) t e α(t-st(b)) ×

(1 + t) 1 - 1 W α (t -s t (b)) ⌈xt(c)⌉-1 + e -αs (1) t e α(t-st(b)) E t K t-st(b) x t (c) 2 , s (1)
t , t -s t (b) . (5.4)

Fix again η ∈ (0, 1). Using the inequality log(1 -x) ≤ -x and Lemma 3.2 (iii), we have for t large enough,

1 - 1 W α (t -s t (b)) ⌈xt(c)⌉-1 ≤ C exp - α 2 4ψ ′ (α) t 2 - t log t α + 2ct (1 -η)ψ ′ (α) α(t -s t (b)) ≤ C exp - α(1 -η) 4(1 -b) t t 1/2 ,
where we used the inequality 1/(1 -b) < 2 to upper bound the exponent of t in the last inequality. Using Lemma 4.1 (4.3), this last inequality yields

E t K t-st(b) (x t (c), s (1)
t , t -s t (b)) ≤ b α t-st(b) s (1) t 1 - 1 W α (y) ⌈xt(c)⌉-1 (αdy + δ 0 (dy)) ≤ b α 1 - 1 W α (t -s t (b)) ⌈xt(c)⌉-1 t-st(b) s (1) t
(αdy + δ 0 (dy))

≤ C exp - α(1 -η) 4(1 -b) t t 3/2 .
Similarly,

E t K t-st(b) (x t (c)/2, s (1)
t , t -s t (b)) ≤ b α 1 - 1 W α (t -s t (b)) ⌈xt(c)/2⌉-1 t-st(b) s (1) t
(αdy + δ 0 (dy))

≤ C exp - α(1 -η) 8(1 -b) t t 5/4 .
Combining the previous inequalities with (5.4), we finally obtain

E t [M t-st(b) (x t (c), s (1)
t )(M t-st(b) (x t (c), s

t ) -1)]

≤ C t 3 e -αst(b) exp -αt 1 -ε 2 + 1 -η 4(1 -b) -1 × exp -αt 1 -η 4(1 -b) + exp -αt b + 1 -ε 2 + 1 -η 8(1 -b) - 1
.

Remember now that ε and η are free parameters in (0, 1). We may assume that they are linked to b by the equation

1 -η 4(1 -b) = 1 -ε 2 , or b = 1 2 - ε -η 2(1 -ε) which is always possible since b < 1/2. This yields E t [M t-st(b) (x t (c), s (1) t )(M t-st(b) (x t (c), s (1) t ) -1)] ≤ C t 3 e -αst(b) exp -αt 1 -3ε 2 + exp -αt 1 4 - ε -η 2(1 -ε) - 7ε 4
.

Taking b close enough to 1/2 allows to take both ε and η as close to 0 as desired. Therefore, (5.3) is proved and the proof of Lemma 5.2 is completed. 2

Old haplotypes

Theorem 5.3 Assume α = θ and define for all a ∈ R

x t (a) = t - log t α + a.
For all n ∈ N, k 1 , . . . , k n ∈ Z + and a 1 > a 2 > . . . > a n , we have

lim t→+∞ P t O t (x t (a 1 )) = k 1 , O t (x t (a 2 )) -O t (x t (a 1 )) = k 2 , . . . , O t (x t (a n )) -O t (x t (a n-1 )) = k n = α k 1 + . . . + k n k 1 , .
. . , k n e -αk 1 a 1 (e -αa 2 -e -αa 1 ) k 2 . . . (e -αan -e -αa n-1 ) kn (α + e -αan ) k 1 +...+kn+1 . (5.5)

In addition, the family of M(R)-valued random variables (Z t , t ≥ 0), defined for all t ≥ 0 by

Z t := k≥1 δ A (k) t -t+ log t α ,
converges as t → +∞ in P ⋆ -distribution in M(R) equipped with the semi-vague topology to a mixed Poisson point measure on R with intensity measure E e -θa da,

where the mixture coefficient E has exponential distribution with parameter 1.

Again, this result follows from the next lemma exactly as Theorem 4.5 followed from Lemma 4.6.

Lemma 5.4 For all a ∈ R lim t→+∞

P t A (1) t ≤ t - log t α + a = 1 1 + 1 α e -αa .
Proof. We define F (t, x) and G(t, x) exactly as in the proof of Lemma 4.6 and we put

s t (b) = b α log t with b ∈ (0, 1).
With this new notation, (4.14) holds true and Proposition 3.6 implies that G(t, t -s t (b)) = o(1). In addition, one checks exactly as in the proof of Proposition 3.6 that

G(t -s t (b), x t (a)) ∼ e -αa α e -αst(b)
when t → +∞. The proof will then be completed if we can prove (4.16). We first observe that W ′ α (x) = e -αx W ′ (x) is bounded thanks to (2.3). Therefore, by Lemma 3.2 (iii),

e -αxt(a) + xt(a) 0 αe -αz W α (t -s t (b)) -W α (x t (a) -z) W α (t -s t (b)) dz ≤ C te -αt + xt(a) 0 e -αz t -s t (b) -x t (a) + z t -s t (b) dz ≤ C log t t .
Combining this inequality with (4.17) and Lemma 4.1 (4.1) in which we take x = 1, s 1 = x t (a) and Using again the fact that W ′ α (x) is bounded and that 1/W α (y) ≤ C/y for all y large enough, we deduce that

s 2 = t -s t (b) yields E t O t-st(b) (x t (a)) O t-st(b) (x t (a)) -1 ≤ CE t K t-st(b) (1, x t (a), t -s t (b)) 1 + e α(t-st(b)-xt(a)) × (1 + log t) log t t + e α(t-st(b)-xt(a)) E t K t-st(b) (1, x t (a), t -s t (b)) . ( 5
E t K t-st(b) (1, x t (a), t -s t (b)) ≤ t-st(b) xt(a) (αdy + δ t-st(b) (dy)) e -αy + C y y 0 ze -αz dz ≤ C t-st(b) xt(a) 1 y (αdy + δ t-st(b) (dy)) ≤ C log t t .
Therefore, it follows from (5.7) that

E t O t-st(b) (x t (a)) O t-st(b) (x t (a)) -1 ≤ C e -αst(b) log t (log t) 2 t + log t t b = o(e -αst(b) ).
This completes the proof of Lemma 5.4. 2

A ij = A ij (t, x, s 1 , s 2 ) := {R ij t ≥ x, ℓ ij ∈ [s 1 , s 2 )}, we have M t (x, s 1 , s 2 ) = 0≤j≤M 0 ½ A 0j + 1≤i<Nt 1≤j≤M i ½ A ij , K t (x, s 1 , s 2 ) = 0≤j≤M 0 ½ A 0j and K ′ t (x, s 1 , s 2 ) = 0≤j≤M ′ 0 ½ A 0j .
Therefore, by construction of the coalescent point process,

E t M t (x, s 1 , s 2 ) = E t K t (x, s 1 , s 2 ) + i≥1 j≥1 P t (A ij , i < N t , j ≤ M i ) = E t K t (x, s 1 , s 2 ) + i≥1 j≥1 P t (A ij , j ≤ M i | i < N t )P t (i < N t ) = E t K t (x, s 1 , s 2 ) + i≥1 j≥1 P t (A 0j , j ≤ M ′ 0 )P t (i < N t ) = E t K t (x, s 1 , s 2 ) + (E t N t -1)E t K ′ t (x, s 1 , s 2 ). Now, M t (x, s 1 , s 2 )(M t (x, s 1 , s 2 ) -1) = 2 0≤k<j≤M 0 ½ A 0k ½ A 0j + 2 Nt-1 i=1 1≤k<j≤M i ½ A ik ½ A ij + 2 M 0 k=0 Nt-1 i=1 M i j=1 ½ A 0k ½ A ij + 2 1≤l<i<Nt M l k=1 M i j=1 ½ A lk ½ A ij .
Hence, using a similar computation as above,

E t M t (x, s 1 , s 2 )(M t (x, s 1 , s 2 ) -1) = E t K t (x, s 1 , s 2 )(K t (x, s 1 , s 2 ) -1) + 2 i≥1 k≥1 j>k P t (A 0k ∩ A 0j , j ≤ M ′ 0 )P t (i < N t ) + 2 k≥0 i≥1 j≥1 P t (A 0k ∩ A ij , k ≤ M 0 , i < N t , j ≤ M i ) + 2 l≥1 k≥1 i>l j≥1 P t (A 0k ∩ A (i-l)j , k ≤ M ′ 0 , i -l < N t , j ≤ M i-l )P t (l < N t ) = E t K t (x, s 1 , s 2 )(K t (x, s 1 , s 2 ) -1) + (E t N t -1)E t K ′ t (x, s 1 , s 2 )(K ′ t (x, s 1 , s 2 ) -1) + 2 k≥0 i≥1 j≥1 P t (A 0k ∩ A ij , k ≤ M 0 , i < N t , j ≤ M i ) + 2(E t N t -1) k≥1 i≥1 j≥1 P t (A 0k ∩ A ij , k ≤ M ′ 0 , i < N t , j ≤ M i ).
Then, denoting ρ k the index of the ⌈x⌉-th individual carrying the type of interval I 0k (:= +∞ if there is no such individual), i,j,k

P t (α ik ∩ A 0k ∩ A ij ∩ B ijk ) ≤ E t   0≤k≤M 0 i≥1 ½ ℓ 0k ∈[s 1 ,s 2 ) ½ ρ k ≤i<Nt   E t j≤M ′ 0 ½ A 0j = E t   0≤k≤M 0 ½ ℓ 0k ∈[s 1 ,s 2 ) (N t -ρ k ) +   E t K ′ t (x, s 1 , s 2 ).
Now, the lack of memory property of geometric distributions yields

E t   0≤k≤M 0 ½ ℓ 0k ∈[s 1 ,s 2 ) (N t -ρ k ) +   = k≥0 E t (N t -ρ k | k ≤ M 0 , ℓ 0k ∈ [s 1 , s 2 ), ρ k < ∞) P t (k ≤ M 0 , ℓ 0k ∈ [s 1 , s 2 ), ρ k < ∞) = (E t N t ) k≥0 P t (k ≤ M 0 , A 0k ) = (E t N t )(E t K t (x, s 1 , s 2 )), which entails (A.2).
Next, let us proceed with (A.4) and let σ k denote the label of the first branch with length greater than ℓ 0(k+1) . Observe that conditionally on ℓ 0(k+1) , A 0k is independent of the branch lengths occurring before σ k , and further, the events {i ≤ σ k } = {max j≤i-1 H j ≤ ℓ 0(k+1) }, {H i ≤ ℓ 0(k+1) , j ≤ M i , A ij } and {k ≤ M 0 , A 0k } are independent. As a consequence,

P t (γ ik ∩ A 0k ∩ A ij ∩ B ijk ) = P t (i < σ k , k ≤ M 0 , A 0k , j ≤ M i , A ij ) = P t (i ≤ σ k , k ≤ M 0 , A 0k , H i ≤ ℓ 0(k+1) , j ≤ M i , A ij ) = E t (P t (i ≤ σ k | ℓ 0(k+1) )P t (A 0k , k ≤ M 0 | ℓ 0(k+1) )P t (H i ≤ ℓ 0(k+1) , j ≤ M i , A ij | ℓ 0(k+1) )) ≤ E t (P t (i ≤ σ k , A 0k , k ≤ M 0 | ℓ 0(k+1) )P t (j ≤ M i , A ij | ℓ 0(k+1) )) = E t (P t (i ≤ σ k , A 0k , k ≤ M 0 | ℓ 0(k+1) )P t (j ≤ M i , A ij )) = P t (j ≤ M ′ 0 , A 0j )P t (i ≤ σ k , A 0k , k ≤ M 0 ).
As a consequence, since σ k and {k ≤ M 0 , A 0k } are independent conditionally on ℓ 0(k+1) , i,j,k ) the event that there exists at least ⌈x/2⌉ individual with label smaller (resp. larger ) than i descending clonally from the time interval I 0k and that ℓ 0k ∈ [s 1 , s 2 ). Then

P t (γ ik ∩ A 0k ∩ A ij ∩ B ijk ) ≤ (E t K ′ t (x, s 1 , s 2 )) k≥0 E t   i≤σ k ½ k≤M 0 ,A 0k   = (E t K ′ t (x, s 1 , s 2 )) k≥0 E t P t (k ≤ M 0 , A 0k | ℓ 0(k+1) )E t (σ k | ℓ 0(k+1) ) ≤ (E t K ′ t (x,
P t (β ik ∩ A 0k ∩ A ij ∩ B ijk ) ≤ P t (β ik ∩ A ′(i) 0k ∩ A ij ∩ B ijk ) + P t (β ik ∩ A ′′(i) 0k ∩ A ij ∩ B ijk ).
Let us deal with the first term of the right-hand side of this last inequality. Exactly as in the proof of (A.2), As for the second term, we need to define J i the unique integer satisfying ℓ 0(J i +1) < max 1≤j≤i H j ≤ ℓ 0J i (J i := +∞ on {i ≥ N t } and J i = k on β ik ). Then i,j,k

P t (β ik , k ≤ M 0 , A ′(i) 0k , j ≤ M i , A ij , i < N t ) ≤ P t (k ≤ M 0 , A ′(i) 0k , j ≤ M i , A ij , i < N t ) = P t (k ≤ M 0 , A ′(i) 0k , i < N t )P t (A ij , j ≤ M i | i < N t ) = P t (k ≤ M 0 , A ′(i) 0k , i < N t )P t (A 0j , j ≤ M ′ 0 ),
P t (β ik ∩ A ′′(i) 0k ∩ A ij ∩ B ijk ) = i,j P t (A ′′(i) 0J i , A ij , j ≤ M i , i < N t ). (A.10)
Set also ℓ * i := ℓ iM i the age of the oldest mutation on branch H i (ℓ * i = 0 if M i = 0). Then conditional on {i < N t } and on the value of ℓ * i , the numbers of clonal descendants R ij t of the interval I ij and the number, say K (i) , of haplotypes whose last mutation is older than ℓ * i and s 1 , younger than s 2 , and occurred on lineage 0, and with more than ⌈x/2⌉ alive clonal descendants with labels larger than i, are independent, so that

P t (A ′′(i) 0J i , A ij , j ≤ M i , i < N t ) ≤ P t (K (i) ≥ 1, A ij , j ≤ M i , i < N t ) = E t (½ i<Nt P t (K (i) ≥ 1 | i < N t , ℓ * i )P t (A ij , j ≤ M i | i < N t , ℓ * i )
) ≤ E t (½ i<Nt P t (K t (⌈x/2⌉, s 1 , s 2 ) ≥ 1)P t (A ij , j ≤ M i | i < N t , ℓ * i )) = P t (K t (⌈x/2⌉, s 1 , s 2 ) ≥ 1)P t (A ij , j ≤ M i | i < N t )P t (i < N t ) (A.11)

≤ (E t K t (⌈x/2⌉, s 1 , s 2 ))P t (A 0j , j ≤ M ′ 0 )P t (i < N t ). (A.12)

We finally obtain i,j,k

P t (β ik ∩ A ′′(i) 0k ∩ A ij ∩ B ijk ) ≤ (E t N t )(E t K t (⌈x/2⌉, s 1 , s 2 ))(E t K ′ t (x, s 1 , s 2 )),
which completes the proof of (A.6) by summing the last inequality and inequality (A.9).

The proof of (A.7) is very similar, but needs further explanation. Let us define the events A ′(i) 0k

and A ′′(i) 0k similarly as above, with the additional condition that ℓ 0k ≤ H ′ . Then, we first prove that i,j,k

P t (β ik ∩ A ′(i) 0k ∩ A ij ∩ B ′ ijk ) ≤ (E t N t )(E t K ′ t (⌈x/2⌉, s 1 , s 2 ))(E t K ′ t (x, s 1 , s 2 ))
following the very same computation as for (A.9). Next, we observe that P t (A ′′(i) 00 ) = 0 since H ′ < t a.s. and ℓ 00 = t. Therefore, (A.10) also holds true with our new definition of A ′′(i) 0k . Thus, defining K (i) as the number of haplotypes whose last mutation is older than ℓ * i and s 1 , younger than s 2 and H ′ , and occurred on lineage 0, and with more than ⌈x/2⌉ alive clonal descendants with labels larger than i, the computation of (A.12) is true, provided that K t (⌈x/2⌉, s 1 , s 2 ) is replaced by K ′ t (⌈x/2⌉, s 1 , s 2 ). We then obtain i,j,k

P t (β ik ∩ A ′′(i) 0k ∩ A ij ∩ B ′ ijk ) ≤ (E t N t )(E t K ′ t (⌈x/2⌉, s 1 , s 2 ))(E t K ′ t (x, s 1 , s 2 )),
and the proof of (A.7) is completed. 2 Lemma 4.1 follows from the combination of the previous lemma with the following estimates on K ′ t (x, s 1 , s 2 ) and K t (x, s 1 , s 2 ).

Lemma A.2 For all t > 0, x ≥ 1, 0 ≤ s 1 < s 2 ≤ t, we have is the number of individuals alive at time t (including this progenitor if b ≥ t) descending from those daughters (including the daughters themselves) of the progenitor who were born during the time interval (a, b), and that still carry the same type that the progenitor carried at time a. Since W θ is the scale function associated with the clonal reproduction process, for all k ≥ 0,

E t K ′ t (x, s 1 , s 2 ) ≤ 1 W (s 1 ) -1 W (t)
P(R (a,b) t = k) = P(N θ t-a = k | ζ = b -a) = P(N θ t-a = 0 | ζ = b -a)P(N θ t-a = k | N θ t-a = 0) = 1 -½ t>b W θ (t -b) W θ (t -a) 1 - 1 W θ (t -a) k-1 1 W θ (t -a) , (A.17)
where N θ is the population size process of a clonal splitting tree and ζ is the lifetime of the progenitor. (This result is actually Eq. (5.3) of [START_REF] Champagnat | Splitting trees with neutral Poissonian mutations I: Small families[END_REF].) Note that, by construction of the splitting tree, replacing in the definition of R . By lineage alive on the time interval (a, b), we mean here a finite sequence of individuals (i k ) 1≤k≤K such that individual i 1 was alive at time a, individual i K was alive at time b, and for all 1 ≤ k ≤ K -1, individual i k+1 was born from individual i k at some time a k such that a 1 > a and a K-1 < b. By clonal lineage alive on the time interval (a, b) we mean in addition that for all 1 ≤ k ≤ K, individual i k experienced no mutation during the time interval (a k-1 , a k ), where a 0 = a and a K = b. Now, by definition of K t (x, s 1 , s 2 ), we have

E t K t (x, s 1 , s 2 ) = k≥0 E t ½ ℓ 0k ∈[s 1 ,s 2 ] P t R 0k t ≥ x | ℓ 0j , j ≥ 0 ,
where

P t R 0k t ≥ x | ℓ 0j , j ≥ 0 = P R 0k t ≥ x, N t ≥ 1 | ℓ 0k , ℓ 0(k+1) P(N t ≥ 1) ≤ b α P R 0k t ≥ x, N t ≥ 1 | ℓ 0k , ℓ 0(k+1) ,

Figure 1 :

 1 Figure 1: A coalescent point process.

Theorem 4 . 5

 45 Assume α < θ and define for all a ∈ R x t (a) = αt θ + a.

17

 17

  )

( 1 )

 1 t . So let us defines t (b) = bt,where b ∈ (0, 1/2).

. 7 )

 7 By Lemma 4.1 (4.2), we haveE t K t-st(b) (1, x t (a), t-s(b)) ≤ b α t-st(b) xt(a)(αdy+δ t-st(b) (dy)) e -αy + y 0 αe -αz W α (y) -W α (y -z) W α (y) dz .

  individuals alive at time t descending clonally from the time interval (a, b). More specifically, given a progenitor individual alive on the time interval (a, b) and experiencing no mutation between times a and b, R

  alive on the time interval (a, b) by a clonal lineage alive on the time interval (a, b), does not change anything to the distribution of R

  addition, for all x t → +∞, Proof. Using Lemma 3.2 (iii), a similar computation as for Proposition 3.4 yields E t [O t (t -log t/α + a)] ∼ e αt

	t t-log t α +a	e -αx x	(dx +	1 α	δ t (dx)) ∼	e αt t	t t-log t α +a
	lim t→+∞	E t M t x t , t -	log t α	+ a	= 0.

  1/2 t/2 > t(1 -ε)/2, the previous quantity can be bounded from above by αte -αt 2 (1-ε+ 1-2η 1-ε ) = o(e -αt ) if one takes again η < ε 2 /2. In conclusion, E t [L t (x t (c))] and E t M t x t (c), 1-ε 2 t, 1+ε 2 t are both asymptotically equivalent to E t (ε), provided that E t (ε) is uniformly bounded from below, where

  A(t; c 1 , . . . , c n ; k 1 , . . . , k n ) the event in the probability in the l.h.s. of(4.11). Using the notation of the proof of Theorem 4.2, for all b > 1/(θ-α), we define B(t, b; c 1 , . . . , c n ; k 1 , . . . , k n ) the event that among the sub-trees T 1 , . . . , T N t,s t (b) , there are exactly k i haplotypes carried by a number of living individuals at time t belonging to [x t (c i+1 ), x t (c i )) for all 0 ≤ i ≤ n -1, with the convention c 0 = +∞. Then P t (A(t; c 1 , . . . , c n ; k 1 , . . . , k n )) -P t (B(t, b; c 1 , . . . , c n ; k 1 , . . . , k n )

  s 1 , s 2 )) P t (k ≤ M 0 , A 0k | ℓ 0(k+1) )E t (N t ) = (E t K ′ t (x, s 1 , s 2 ))(E t K t (x, s 1 , s 2 ))(E t N t ),which is (A.4).Finally, let us turn to (A.6). Denote by A

	′(i) 0k (resp. A ′′(i) 0k

k≥0 E t

  ∩ A ij ∩ B ijk ) ≤ (E t N t )(E t K t (⌈x/2⌉, s 1 , s 2 ))(E t K ′ t (x, s 1 , s 2 )).(A.9)

and we finally get i,j,k

P t (β ik ∩ A ′(i) 0k

  θe -θz W θ (s 2 ) -W θ (s 1 -z) W θ (s 2 ) dz . (A.16)Proof. With the notation of the proof of Lemma A.1, we haveE t K ′ t (x, s 1 , s 2 ) = (A 0k , k ≤ M 0 , H ′ ≥ ℓ 0k ) ≤ k≥1 P t (A 0k , k ≤ M 0 )P(H ′ ≥ s 1 ) ≤ E t K t (x, s 1 , s 2 )P(H ≥ s 1 | H < t),which is inequality (A.13). Similarly,E t K ′ t (x, s 1 , s 2 )(K ′ t (x, s 1 , s 2 ) -1) = 2 k≥1 j>k P t (A 0k , A 0j , j ≤ M ′ 0 ) (A 0k , A 0j , j ≤ M 0 )P(H ′ ≥ s 1 ) ≤ E t [K t (x, s 1 , s 2 )(K t (x, s 1 , s 2 ) -1]P(H ≥ s 1 | H < t),which is inequality (A.15). For the two other inequalities, let us define R

	s 2 s 1 × 1 -1 -	1 W θ (y) 1 W θ (s 2 )	⌈x⌉-1 ⌈x⌉-1 k≥1 = k≥1 j>k e -θy + e -θs 1 + P t (A 0k , k ≤ M ′ s 1 0 0 ) P t ≤ P
			k≥1

1 -1 W (t) E t K t (x, s 1 , s 2 ), (A.13) E t K t (x, s 1 , s 2 ) ≤ b α y 0 θe -θz W θ (y) -W θ (y -z) W θ (y)

dz (θdy +δ t (dy)), (A.14)

E t K ′ t (x, s 1 , s 2 )(K ′ t (x, s 1 , s 2 ) -1) ≤ 1 W (s 1 ) -1 W (t) 1 -1 W (t) E t K t (x, s 1 , s 2 )(K t (x, s 1 , s 2 ) -1), (A.15) E t K t (x, s 1 , s 2 )(K t (x, s 1 , s 2 ) -1) ≤ 2b α (E t K t (x, s 1 , s 2 )) (1 + θ(s 2 -s 1 ))× t

Acknowledgments. This work was funded by project MANEGE 'Modèles Aléatoires en Écologie, Génétique et Évolution' 09-BLAN-0215 of ANR (French national research agency).

A Proof of Lemma 4.1

Recall the notation introduced in Section 4.1.

As seen in the proof of Theorem 4.2, this result (and actually all the results of Sections 4 and 5) are consequences of estimates of the form P t (M t (x t , s t ) ≥ 1) ∼ E t M t (x t , s t ) as t → +∞, for convenient choices of x t and s t . We chose to prove this result using the inequality 0 ≤ E t M t (x t , s t ) -P t (M t (x t , s t ) ≥ 1) ≤ E t [M t (x t , s t )(M t (x t , s t ) -1)],

i.e. proving that E t [M t (x t , s t )(M t (x t , s t ) -1)] = o (E t M t (x t , s t )) .

Such results are obtained using Lemma 4.1, which is an immediate consequence of the following two lemmas.

We need to define the random variable K ′ t (x, s 1 , s 2 ) by slightly modifying the definition of K t (x, s 1 , s 2 ): introducing an independent random variable H ′ distributed as

is the number of haplotypes carried by more than x individuals alive at time t, whose last mutation occurred on branch 0, and is older than s 1 and younger than s 2 ∧ H ′ .

As a first step, we compute an upper bound of

Proof. We let M i be the number of mutations on branch i (this branch has length H i ), considering only the mutations younger than t when i = 0. For all j ≤ M i , we define ℓ ij the duration elapsed since the j-th oldest mutation on branch i, with ℓ i(M i +1) = 0, ℓ i0 = H i and ℓ 00 = t. We also define M ′ 0 as the smallest k ≥ 1 such that ℓ 0k ≤ H ′ (and M ′ 0 = 0 there is no such k ≥ 1). For 0 ≤ j ≤ M i , denote by R ij t the number of individuals alive at time t descending clonally from the time interval

) on branch i. More specifically, for a progenitor individual alive on the time interval (a, b) and experiencing no mutation between times a and b, we refer to 'clonal descendants from the time interval (a, b)' as those individuals alive at t (including possibly the progenitor) descending from those daughters of the progenitor who were born during the time interval (a, b), and that still carry the same type the progenitor carried at time a. Using the notation For short, we write

where

. Now for any positive integers i, k, define the three following events

We are going to state and prove six inequalities, where the left-hand side is obtained by intersecting each event

ijk with each of the preceding ones α ik , β ik , γ ik , and summing over i, j ≥ 1 and k ≥ 0 for the events involving B ijk , and k ≥ 1 for the events involving B ′ ijk .

i,j,k

Combining these six equations with (A.1) and with the inequalities K t (x, s 1 , s 2 ) ≤ K t (⌈x/2⌉, s 1 , s 2 ) and K ′ t (x, s 1 , s 2 ) ≤ K ′ t (⌈x/2⌉, s 1 , s 2 ) yields the inequality given in the lemma. We are going to detail the proof of the inequalities (A.2), (A.4) and (A.6) (in this order). The other inequalities can be proved using the same computations. Let us start with (A.2). Hereafter we denote by A (i) 0k the event {I 0k has more than x clonal descendants within {0, . . . , i -1} and ℓ 0k ∈ [s 1 , s 2 )}.

since P(N t ≥ 1) ≥ P(N s ≥ 1, ∀s ≥ 0) and the survival probability of the splitting tree is α/b. Now, the event {N t ≥ 1, R 0k t ≥ x} is the event where N t ≥ 1 and the clonal lineage on branch 0 on the time interval (t -ℓ 0k , t -ℓ 0(k+1) ) has more than x clonal descendants alive at time t. Therefore,

Now, for all k ≥ 0, t -ℓ 0k is distributed as the minimum of t and a sum of k i.i.d. exponential random variables of parameter θ, and t -ℓ 0(k+1) as the minimum of t and the sum of t -ℓ 0k and an exponential random variable of parameter θ, independent of t -ℓ 0k . Therefore, it follows from (A.17) that

Equation (A.14) then follows from the changes of variables z ′ = z -y and y ′ = t -y, and the identity 1 = e -θy + y 0 θe -θz dz. Finally, let us turn to (A.16): first,

). Therefore, using (A.18) as before,

where the last indicator comes from the fact that 1 -1/W θ (ℓ 0k ) = 0 when ℓ 0k = 0. Now, on the event {ℓ 0k > 0}, one has ℓ 0n = t -E 1 -. . .