On the Markov property of a finite hidden Markov chain (Q5937051): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lumpability and marginalisability for continuous-time Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Inference for Probabilistic Functions of Finite State Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Markovian Function of a Markov Chain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Continuous Time Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: On weak lumpability of denumerable Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3293720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite characterization of weak lumpable Markov processes. I: The discrete time case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite characterization of weak lumpable Markov processes. II: The continuous time case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A representation result for finite Markov chains / rank
 
Normal rank

Latest revision as of 17:12, 3 June 2024

scientific article; zbMATH DE number 1618409
Language Label Description Also known as
English
On the Markov property of a finite hidden Markov chain
scientific article; zbMATH DE number 1618409

    Statements

    On the Markov property of a finite hidden Markov chain (English)
    0 references
    0 references
    10 June 2002
    0 references
    The question of the conditions under which a hidden Markov chain itself exhibits Markovian behaviour is studied. The provided answer is based on two different approaches: 1) the authors use known results by Rubino and Sericola for deterministic functions of a Markov chain by considering a bivariate chain; 2) a method based on a recursive filtering formula for the underlying chain is proposed. The prediction problem is considered.
    0 references
    Markov chain
    0 references
    hidden Markov chain
    0 references
    recursive filtering
    0 references
    predictions
    0 references

    Identifiers