39 citations · 67 across the 5 of their papers we have counts for
5 papers · 1 filter
Excited Random Walk in a Markovian Environment
Nicholas Travers
One dimensional excited random walk has been extensively studied for bounded, i.i.d. cookie environments. In this case, many important properties of the walk including transience o…
Transience, Recurrence and the Speed of a Random Walk in a Site-Based Feedback Environment
Ross G. Pinsky, Nicholas F. Travers
We study a random walk on which evolves in a dynamic environment determined by its own trajectory. Sites flip back and forth between two modes, and . consec…
Inversions and Longest Increasing Subsequence for -Card-Minimum Random Permutations
Nicholas F. Travers
A random -permutation may be generated by sequentially removing random cards from an -card deck . The permutation is simply the sequence of…
Exponential Bounds for Convergence of Entropy Rate Approximations in Hidden Markov Models Satisfying a Path-Mergeability Condition
Nicholas F. Travers
A hidden Markov model (HMM) is said to have path-mergeable states if for any two states i,j there exists a word w and state k such that it is possible to transition from both i and…
Equivalence of History and Generator Epsilon-Machines
Nicholas F. Travers, James P. Crutchfield
Epsilon-machines are minimal, unifilar presentations of stationary stochastic processes. They were originally defined in the history machine sense, as hidden Markov models whose st…