Add to ORKGWe present two examples of finite-alphabet, infinite excess entropy processes generated by stationary hidden Markov models (HMMs) with countable state sets. The first, simpler example is not ergodic, but the second is. These are the first explicit constructions of processes of this type. © 2014 by the authors
. By a result of F. Hofbauer [11], piecewise monotonic maps of the interval can be identified with ...
We consider a hidden Markov model with multiple observation processes, one of which is chosen at eac...
We introduce the minimal maximally predictive models ({\epsilon}-machines) of processes gen...
We present two examples of finite-alphabet, infinite excess entropy processes generated by stationar...
We present two examples of finite-alphabet, infinite excess entropy processes generated by ...
We show that it is possible to extend hidden Markov models to have a countably infinite number of hi...
We show that it is possible to extend hidden Markov models to have a countably infinite number of hi...
The duality between values and orderings is a powerful tool to discuss relationships between various...
Abstract—A recent result presented the expansion for the entropy rate of a hidden Markov process (HM...
In this paper we study ergodic theory of countable Markov shifts. These are dynamical systems define...
Hidden Markov chains are widely applied statistical models of stochastic processes, from fundamental...
Recently, the duality between values (words) and orderings (permutations) has been proposed by the a...
Countable state Markov shifts are a natural generalization of the well-known subshifts of finite typ...
Abstract—Consider a stationary discrete random process with alphabet size d, which is assumed to be ...
Renewal processes are broadly used to model stochastic behavior consisting of isolated even...
. By a result of F. Hofbauer [11], piecewise monotonic maps of the interval can be identified with ...
We consider a hidden Markov model with multiple observation processes, one of which is chosen at eac...
We introduce the minimal maximally predictive models ({\epsilon}-machines) of processes gen...
We present two examples of finite-alphabet, infinite excess entropy processes generated by stationar...
We present two examples of finite-alphabet, infinite excess entropy processes generated by ...
We show that it is possible to extend hidden Markov models to have a countably infinite number of hi...
We show that it is possible to extend hidden Markov models to have a countably infinite number of hi...
The duality between values and orderings is a powerful tool to discuss relationships between various...
Abstract—A recent result presented the expansion for the entropy rate of a hidden Markov process (HM...
In this paper we study ergodic theory of countable Markov shifts. These are dynamical systems define...
Hidden Markov chains are widely applied statistical models of stochastic processes, from fundamental...
Recently, the duality between values (words) and orderings (permutations) has been proposed by the a...
Countable state Markov shifts are a natural generalization of the well-known subshifts of finite typ...
Abstract—Consider a stationary discrete random process with alphabet size d, which is assumed to be ...
Renewal processes are broadly used to model stochastic behavior consisting of isolated even...
. By a result of F. Hofbauer [11], piecewise monotonic maps of the interval can be identified with ...
We consider a hidden Markov model with multiple observation processes, one of which is chosen at eac...
We introduce the minimal maximally predictive models ({\epsilon}-machines) of processes gen...