On a Markov chain related to the individual lengths in the recursive construction of Kingman's coalescent

Abstract: Kingman's coalescent is a widely used process to model sample genealogies in population genetics. Recently there have been studies on the inference of quantities related to the genealogy of additional individuals given a known sample. This paper explores the recursive (or sequential) construction which is a natural way of enlarging the sample size by adding individuals one after another to the sample genealogy via individual lineages to construct the Kingman's coalescent. Although the process of successively added lineage lengths is not Markovian, we show that it contains a Markov chain which records the information of the successive largest lineage lengths and we prove a limit theorem for this Markov chain.