2015
DOI: 10.1214/ejp.v20-3281
|View full text |Cite
|
Sign up to set email alerts
|

Phase transitions in nonlinear filtering

Abstract: It has been established under very general conditions that the ergodic properties of Markov processes are inherited by their conditional distributions given partial information. While the existing theory provides a rather complete picture of classical filtering models, many infinite-dimensional problems are outside its scope. Far from being a technical issue, the infinite-dimensional setting gives rise to surprising phenomena and new questions in filtering theory. The aim of this paper is to discuss some eleme… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
11
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(11 citation statements)
references
References 52 publications
0
11
0
Order By: Relevance
“…While the above back-of-envelope computation provides a basic template for our approach, the rigorous implementation of these ideas requires the introduction of mathematical machinery that has not previously been applied in the study of nonlinear filtering. Just as in the case of the filter stability property (see [18] and the references therein), it is far from clear that any decay of correlations properties of the underlying model are inherited by the filter as we have taken for granted above: in fact, striking counterexamples show that such inheritance can fail in surprising ways [13]. More generally, the development of machinery for the local analysis of high-dimensional filtering problems forms an essential part of our proofs.…”
mentioning
confidence: 93%
See 1 more Smart Citation
“…While the above back-of-envelope computation provides a basic template for our approach, the rigorous implementation of these ideas requires the introduction of mathematical machinery that has not previously been applied in the study of nonlinear filtering. Just as in the case of the filter stability property (see [18] and the references therein), it is far from clear that any decay of correlations properties of the underlying model are inherited by the filter as we have taken for granted above: in fact, striking counterexamples show that such inheritance can fail in surprising ways [13]. More generally, the development of machinery for the local analysis of high-dimensional filtering problems forms an essential part of our proofs.…”
mentioning
confidence: 93%
“…[5]) are illsuited to the investigation of the much more delicate problems that arise in high dimension. We have recently begun to explore high-dimensional probabilistic phenomena in nonlinear filtering [13,18]. The present paper arose from the realization that such phenomena are not only of interest in their own right, but that they can provide mechanisms that enable the development and analysis of particle filtering algorithms in high dimension.…”
mentioning
confidence: 99%
“…Recently, a significant contribution to the study of smoothing probabilities (with continuous state space) was made by van Handel and his colleagues [39,42,41,40,4,43,37,38,35]. Again, most of the papers deals with HMM's, but in [37,38], also more general PMM's are considered.…”
Section: Relation With the Previous Workmentioning
confidence: 99%
“…Distinct clusters need not be disjoint and a cluster can consist of a single state. The cluster assumption states: There exists a cluster C ⊂ Y such that the sub-stochastic matrix P C = (p ij ) i,j∈C is primitive, that is P R C has only positive elements for some positive integer R. Thus the cluster assumptions implies that the Markov cain Y is aperiodic but not vice versa -for a counterexample consider a classical example appearing in [1] (Example 4.3.28) as well as in [3,35]. Let Y = {0, 1, 2, 3}, X = {0, 1} and let the Markov chain Y be be defined by Y k = Y k−1 + U k (mod 4), where {U k } is an i.i.d.…”
Section: Hidden Markov Modelmentioning
confidence: 99%
See 1 more Smart Citation