Random Markov processes for countable and uncountable alphabets

DOI10.1007/s11856-016-1407-5zbMath1396.60038MaRDI QIDQ503232

Neal Bushaw, Karen Gunderson, Steven Arthur 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 processes; countable alphabets; random Markov process; uncountable alphabets

Mathematics Subject Classification ID

60G10: Stationary stochastic processes

60J10: Markov chains (discrete-time Markov processes on discrete state spaces)

Cites Work

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