Hostname: page-component-77f85d65b8-8v9h9 Total loading time: 0 Render date: 2026-03-27T09:33:51.875Z Has data issue: false hasContentIssue false

Computational Inference Beyond Kingman's Coalescent

Published online by Cambridge University Press:  30 January 2018

Jere Koskela*
Affiliation:
University of Warwick
Paul Jenkins*
Affiliation:
University of Warwick
Dario Spanò*
Affiliation:
University of Warwick
*
Postal address: Mathematics Institute, University of Warwick, Coventry CV4 7AL, UK. Email address: j.j.koskela@warwick.ac.uk
∗∗ Postal address: Department of Statistics, University of Warwick, Coventry CV4 7AL, UK.
∗∗ Postal address: Department of Statistics, University of Warwick, Coventry CV4 7AL, UK.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Full likelihood inference under Kingman's coalescent is a computationally challenging problem to which importance sampling (IS) and the product of approximate conditionals (PAC) methods have been applied successfully. Both methods can be expressed in terms of families of intractable conditional sampling distributions (CSDs), and rely on principled approximations for accurate inference. Recently, more general Λ- and Ξ-coalescents have been observed to provide better modelling fits to some genetic data sets. We derive families of approximate CSDs for finite sites Λ- and Ξ-coalescents, and use them to obtain ‘approximately optimal’ IS and PAC algorithms for Λ-coalescents, yielding substantial gains in efficiency over existing methods.

Information

Type
Research Article
Copyright
© Applied Probability Trust