國立清華大學 數學系

Abstract: When a population grows old, it is always interesting to know what happened to it in the past. The coalescence problem provides a way to understand the ancestry of the individuals in the population. Here, we pick some individuals at random from the current generation by simple random sampling without replacement and trace their lines of descent backward in time till they meet for the first time. We call the common ancestor of these chosen individuals at the coalescent time their most recent common ancestor. The coalescence problem is to investigate the limit behaviors of some characteristics of this most recent common ancestor such as the generation number and the type in a population with various types of individuals. Tea Time: 3:30PM, R707