On filtering for a hidden Markov chain under square performance criterion (Q1592133)

From MaRDI portal
Revision as of 05:04, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On filtering for a hidden Markov chain under square performance criterion
scientific article

    Statements

    On filtering for a hidden Markov chain under square performance criterion (English)
    0 references
    4 October 2001
    0 references
    Let \(\theta(t)\) be a nonobservable Markov chain with discrete time and with a finite number of states \(\{a_1,\dots, a_n\}\). Let the conditional distribution of the observations \(X_t\in \mathbb{R}^d\) be \({\mathbf P}\{X_t\leq x\mid \theta(t)\}= F_{\theta(t)}(x)\), where \(F_{a_1}(x),\dots, F_{a_n}(x)\) are known distribution functions in \(\mathbb{R}^d\). The problem of filtering consists in the reconstruction of \(\theta(t)\) from the observations \(X_k\), \(k\leq t\). In the case of a Markov chain with rate transitions, an asymptotic formula for the mean-square error of the optimal filter is obtained.
    0 references
    Markov chain
    0 references
    filtering
    0 references
    rate transitions
    0 references
    asymptotic formula
    0 references
    mean-square error
    0 references
    0 references

    Identifiers