Random Markov processes for countable and uncountable alphabets
From MaRDI portal
Publication:503232
DOI10.1007/S11856-016-1407-5zbMATH Open1396.60038OpenAlexW2529887806MaRDI QIDQ503232FDOQ503232
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
Recommendations
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stationary stochastic processes (60G10)
Cites Work
- Title not available (Why is that?)
- Nonuniqueness in \(g\)-functions
- Strongly mixing g-measures
- Thermodynamic formalism for countable Markov shifts
- An example of non-unique g -measures
- Generators and strong generators in ergodic theory
- Sur des chaînes à liaisons complètes
- Chains with infinite connections: Uniqueness and Markov representation
- Exponential inequalities for empirical unbounded context trees
- Random Markov processes and uniform martingales
- Gibbs states on the symbolic space over an infinite alphabet
- Countable state shifts and uniqueness of g -measures
- Variable length Markov chains
- Random stationary processes
- Finitarily deterministic generators for zero entropy systems
- Infinite partitions and Rokhlin towers
- 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
- Title not available (Why is that?)
- An outline of ergodic theory
- Title not available (Why is that?)
Cited In (4)
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)
