Exact rates of convergeance for a branching particle approximation to the solution of the Zakai equation

Abstract

In Crisan, Gaines and Lyons [SIAM J. Appl. Probab. 58 (1998) 313--342] we describe a branching particle algorithm that produces a particle approximation to the solution of the Zakai equation and find an upper bound for the rate of convergence of the mean square error. In this paper, the exact rate of convergence of the mean square error is deduced. Also, several variations of the branching algorithm with better rates of convergence are introduced.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 41 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.