arXiv Analytics

Sign in

arXiv:math/0304056 [math.PR]AbstractReferencesReviewsResources

Stability of nonlinear filters in nonmixing case

Pavel Chigansky, Robert Liptser

Published 2003-04-04, updated 2005-04-06Version 2

The nonlinear filtering equation is said to be stable if it ``forgets'' the initial condition. It is known that the filter might be unstable even if the signal is an ergodic Markov chain. In general, the filtering stability requires stronger signal ergodicity provided by the, so called, mixing condition. The latter is formulated in terms of the transition probability density of the signal. The most restrictive requirement of the mixing condition is the uniform positiveness of this density. We show that it might be relaxed regardless of an observation process structure.

Comments: Published at http://dx.doi.org/10.1214/105051604000000873 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
Journal: Annals of Applied Probability 2004, Vol. 14, No. 4, 2038-2056
Categories: math.PR
Subjects: 93E11, 60J57
Related articles: Most relevant | Search more
arXiv:1107.2612 [math.PR] (Published 2011-07-13, updated 2017-10-25)
Commuting time geometry of ergodic Markov chains
arXiv:1912.06845 [math.PR] (Published 2019-12-14)
Mixing Time Estimation in Ergodic Markov Chains from a Single Trajectory with Contraction Methods
arXiv:1105.0914 [math.PR] (Published 2011-05-04, updated 2011-08-12)
Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets