Simple conditions for convergence of sequential Monte Carlo genealogies with applications

  title={Simple conditions for convergence of sequential Monte Carlo genealogies with applications},
  author={Suzie Brown and Paul A. Jenkins and A. M. Johansen and Jere Koskela},
  journal={arXiv: Computation},
Sequential Monte Carlo algorithms are popular methods for approximating integrals in problems such as non-linear filtering and smoothing. Their performance depends strongly on the properties of an induced genealogical process. We present simple conditions under which the limiting process, as the number of particles grows, is a time-rescaled Kingman coalescent. We establish these conditions for standard sequential Monte Carlo with a broad class of low-variance resampling schemes, as well as for… Expand

Figures from this paper

Conditional sequential Monte Carlo in high dimensions
The iterated conditional sequential Monte Carlo (i-CSMC) algorithm from Andrieu, Doucet and Holenstein (2010) is an MCMC approach for efficiently sampling from the joint posterior distribution of theExpand


Asymptotic genealogies of interacting particle systems with an application to sequential Monte Carlo
The tractable n-coalescent can be used to predict the shape and size of SMC genealogies, as it is illustrated by characterising the limiting mean and variance of the tree height. Expand
Sequential Monte Carlo samplers
We propose a methodology to sample sequentially from a sequence of probability distributions that are defined on a common space, each distribution being known up to a normalizing constant. TheseExpand
Robustness results for the coalescent
A variety of convergence results for genealogical and line-of-descendent processes are known for exchangeable neutral population genetics models. A general convergence-to-the-coalescent theorem isExpand
Particle Markov chain Monte Carlo methods
Markov chain Monte Carlo and sequential Monte Carlo methods have emerged as the two main tools to sample from high dimensional probability distributions. Although asymptotic convergence of MarkovExpand
The n-coalescent is a continuous-time Markov chain on a finite set of states, which describes the family relationships among a sample of n members drawn from a large haploid population. ItsExpand
Replica Conditional Sequential Monte Carlo
We propose a Markov chain Monte Carlo (MCMC) scheme to perform state inference in non-linear non-Gaussian state-space models. Current state-of-the-art methods to address this problem rely on particleExpand
Smoothing With Couplings of Conditional Particle Filters
This work combines a generic debiasing technique for Markov chains, with a Markov chain Monte Carlo algorithm for smoothing, and establishes the validity of the proposed estimators under mild assumptions. Expand
Variance estimation in the particle filter
This paper concerns numerical assessment of Monte Carlo error in particle filters. We show that by keeping track of certain key features of the genealogical structure arising from resamplingExpand
Elements of Sequential Monte Carlo
This tutorial reviews sequential Monte Carlo, a random-sampling-based class of methods for approximate inference, and discusses the SMC estimate of the normalizing constant, how this can be used for pseudo-marginal inference and inference evaluation. Expand
Exact coalescent for the Wright-Fisher model.
  • Yun-Xin Fu
  • Biology, Medicine
  • Theoretical population biology
  • 2006
It is shown that the Kingman coalescent differs from the exact coalescent by: (1) shorter waiting time between successive coalescent events; (2) different probability of observing a topological relationship among sequences in a sample; and (3) slightly smaller tree length in the genealogy of a large sample. Expand