Complete sufficient statistics for Markov chains

DOI10.26485/0459-6854/2017/67.1/2MaRDI QIDQ4645537zbMATH OpenOpenAlexFDO

Authors Agnieszka Palma

Publication date 10 January 2019

Published in Bulletin de la Société des Sciences et des Lettres de Łódź. Série: Recherches sur les Déformations (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26485/0459-6854/2017/67.1/2

zbMATH Keywords

complete statisticMarkov chainminimal sufficient statisticrandom transition count

Mathematics Subject Classification ID

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

Recommendations

• When transition count for a Markov chain is a complete sufficient statistic
• On Completeness of Random Transition Count for Markov Chains
• On completeness of random transition counts for Markov chains. II
• A complete sufficient statistic for finite-state Markov processes with application to source coding
• A Markov chain of order s with r partial connections and statistical inference on its parameters

Cited in

(6)

• When transition count for a Markov chain is a complete sufficient statistic
• Summary Statistics for Endpoint-Conditioned Continuous-Time Markov Chains
• scientific article; zbMATH DE number 3940342 (Why is no real title available?)
• A complete sufficient statistic for finite-state Markov processes with application to source coding
• On completeness of random transition counts for Markov chains. II
• On Completeness of Random Transition Count for Markov Chains

This page was built for publication: Complete sufficient statistics for Markov chains

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