pith. sign in

arxiv: 1709.06771 · v1 · pith:BNGOLG4Xnew · submitted 2017-09-20 · 🧮 math.PR

A Central Limit Theorem for Fleming-Viot Particle Systems with Hard Killing

classification 🧮 math.PR
keywords killingparticlelimitcentralfleming-viothardmarkovprocess
0
0 comments X
read the original abstract

Fleming-Viot type particle systems represent a classical way to approximate the distribution of a Markov process with killing, given that it is still alive at a final deterministic time. In this context, each particle evolves independently according to the law of the underlying Markov process until its killing, and then branches instantaneously on another randomly chosen particle. While the consistency of this algorithm in the large population limit has been recently studied in several articles, our purpose here is to prove Central Limit Theorems under very general assumptions. For this, we only suppose that the particle system does not explode in finite time, and that the jump and killing times have atomless distributions. In particular, this includes the case of elliptic diffusions with hard killing.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.