When transition count for a Markov chain is a complete sufficient statistic

DOI10.1016/J.SPL.2005.09.010zbMath1131.62002OpenAlexW2005017078MaRDI QIDQ2493795

Adam Paszkiewicz

Publication date: 16 June 2006

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2005.09.010

zbMATH Keywords

Markov chaincomplete statisticrandom transition count

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Nonexistence of complete sufficient statistics for stationary k-state Markov chains, \(k\geq 3\)
• Admissible Run-Contingency Type Tests for Independence and Markov Dependence
• On tests for Markov dependence
• On Completeness of Random Transition Count for Markov Chains

This page was built for publication: When transition count for a Markov chain is a complete sufficient statistic