On Completeness of Random Transition Count for Markov Chains

DOI10.1515/JAA.2006.249zbMath1141.62301OpenAlexW2120273038MaRDI QIDQ5296471

No author found.

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

Markov chainsufficient statisticminimal sufficient statisticcomplete statisticrandom transition count

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

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

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