Random Markov processes for countable and uncountable alphabets

DOI10.1007/S11856-016-1407-5MaRDI QIDQ503232zbMATH OpenOpenAlexFDO

Authors Neal Bushaw, Karen Gunderson, Steven Kalikow

Publication date 11 January 2017

Published in Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11856-016-1407-5

zbMATH Keywords

stationary processescountable alphabetsrandom Markov processuncountable alphabets

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stationary stochastic processes (60G10)

Recommendations

• Random Markov processes and uniform martingales
• Random stationary processes
• Symbolic Markov Chains
• scientific article; zbMATH DE number 30695
• Constructive Markov chains indexed by \(\mathbb Z\)

Cites work

• scientific article; zbMATH DE number 3016023 (Why is no real title available?)
• scientific article; zbMATH DE number 3268302 (Why is no real title available?)
• scientific article; zbMATH DE number 3280242 (Why is no real title available?)
• An example of non-unique g -measures
• An outline of ergodic theory
• Chains with infinite connections: Uniqueness and Markov representation
• Countable state shifts and uniqueness of g -measures
• Estimation of General Stationary Processes by Variable Length Markov Chains
• Exponential inequalities for empirical unbounded context trees
• Finitarily deterministic generators for zero entropy systems
• Generators and strong generators in ergodic theory
• Gibbs states on the symbolic space over an infinite alphabet
• Infinite partitions and Rokhlin towers
• Nonuniqueness in \(g\)-functions
• On Finite Coding Factors of a Class of Random Markov Chains
• On a Class of Generalized Baker's Transformations
• Random Markov processes and uniform martingales
• Random stationary processes
• Strongly mixing g-measures
• Sur des chaînes à liaisons complètes
• Thermodynamic formalism for countable Markov shifts
• Variable length Markov chains

Cited in

(4)

• Random Markov processes and uniform martingales
• Doob-Martin compactification of a Markov chain for growing random words sequentially
• Random stationary processes
• A countably-valued sleeping stockbroker process

This page was built for publication: Random Markov processes for countable and uncountable alphabets

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