2006
DOI: 10.1016/j.spa.2006.03.004
|View full text |Cite
|
Sign up to set email alerts
|

Computable infinite-dimensional filters with applications to discretized diffusion processes

Abstract: Let us consider a pair signal-observation ((x n , y n ), n ≥ 0) where the unobserved signal (x n ) is a Markov chain and the observed component is such that, given the whole sequence (x n ), the random variables (y n ) are independent and the conditional distribution of y n only depends on the corresponding state variable x n . The main problems raised by these observations are the prediction and filtering of (x n ). We introduce sufficient conditions allowing to obtain computable filters using mixtures of dis… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
20
0

Year Published

2007
2007
2024
2024

Publication Types

Select...
7

Relationship

3
4

Authors

Journals

citations
Cited by 20 publications
(21 citation statements)
references
References 13 publications
1
20
0
Order By: Relevance
“…Following Chaleya-Maurel and Genon-Catalot [11], we observe that X n is the square of the Euclidean norm of a -dimensional vector whose components are linear autoregressive processes of order 1. The stationary distribution is a Gamma distribution with parameter /2 and | |/ 2 0 so that…”
Section: Cox-ingersoll-ross Processmentioning
confidence: 98%
“…Following Chaleya-Maurel and Genon-Catalot [11], we observe that X n is the square of the Euclidean norm of a -dimensional vector whose components are linear autoregressive processes of order 1. The stationary distribution is a Gamma distribution with parameter /2 and | |/ 2 0 so that…”
Section: Cox-ingersoll-ross Processmentioning
confidence: 98%
“…In Section 2, we briefly recall some properties of the Wright-Fisher diffusion. In Section 3, we recall the filtering-prediction algorithm and the sufficient conditions of [2] to obtain computable filters. Section 4 contains our main results.…”
Section: Dx(t) = [−δX(t) + δ (1 − X(t))]dt + 2[x(t)(1 − X(t)mentioning
confidence: 99%
“…Evidently, the difficulty is to find models satisfying these conditions. Examples are given in [2] where the hidden Markov process (x(t n )) is a discretization of a diffusion process. Here, we study another diffusion process.…”
Section: Sufficient Conditions For Computable Filtersmentioning
confidence: 99%
See 1 more Smart Citation
“…Unfortunately, except for very few models, such as the Kalman filter or some other models (for instance, those presented in [3]), these recursions rapidly lead to intractable computations and exact formulae are out of reach. Moreover, the standard Monte-Carlo methods fail to provide good approximations of these distributions (see e.g.…”
Section: Introductionmentioning
confidence: 99%