On Completeness of Random Transition Count for Markov Chains

DOI10.1515/JAA.2006.249MaRDI QIDQ5296471zbMATH OpenOpenAlexFDO

Authors

Publication date 1 August 2007

Published in Journal of Applied Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/jaa.2006.249

zbMATH Keywords

complete statisticMarkov chainminimal sufficient statisticrandom transition countsufficient statistic

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Sufficient statistics and fields (62B05)

Recommendations

• On completeness of random transition counts for Markov chains. II
• When transition count for a Markov chain is a complete sufficient statistic
• Complete sufficient statistics for Markov chains
• On the completeness of Markovian plans of discrete-time random walks with sparse matrix of transition probabilities
• scientific article; zbMATH DE number 3913492

Cites work

• Admissible Run-Contingency Type Tests for Independence and Markov Dependence
• On tests for Markov dependence

Cited in

(5)

• When transition count for a Markov chain is a complete sufficient statistic
• Complete sufficient statistics for Markov chains
• On completeness of random transition counts for Markov chains. II
• On the completeness of Markovian plans of discrete-time random walks with sparse matrix of transition probabilities
• Information asymmetry of positive and negative observations in medical diagnostics

This page was built for publication: On Completeness of Random Transition Count for Markov Chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5296471)