Continuity properties of a factor of Markov chains
classification
🧮 math.PR
keywords
chainmarkovalphabetchainsconditionsconsidercontinuitycontinuous
read the original abstract
Starting from a Markov chain with a finite alphabet, we consider the chain obtained when all but one symbol are undistinguishable for the practitioner. We study necessary and sufficient conditions for this chain to have continuous transition probabilities with respect to the past.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.