Coalescent simulation in continuous space: Algorithms for large neighbourhood size

J Kelleher, A M Etheridge, N H Barton

Research output: Contribution to journalArticlepeer-review


Many species have an essentially continuous distribution in space, in which there are no natural divisions between randomly mating subpopulations. Yet, the standard approach to modelling these populations is to impose an arbitrary grid of demes, adjusting deme sizes and migration rates in an attempt to capture the important features of the population. Such indirect methods are required because of the failure of the classical models of isolation by distance, which have been shown to have major technical flaws. A recently introduced model of extinction and recolonisation in two dimensions solves these technical problems, and provides a rigorous technical foundation for the study of populations evolving in a spatial continuum. The coalescent process for this model is simply stated, but direct simulation is very inefficient for large neighbourhood sizes. We present efficient and exact algorithms to simulate this coalescent process for arbitrary sample sizes and numbers of loci, and analyse these algorithms in detail.

Original languageEnglish
JournalTheoretical population biology
Publication statusPublished - 5 Jun 2014


Dive into the research topics of 'Coalescent simulation in continuous space: Algorithms for large neighbourhood size'. Together they form a unique fingerprint.

Cite this