States recognition in random walk Markov chain via binary Entropy
M. Khodabin · Journal of Interpolation and Approximation in Scientific Computing · 2013
In this paper, a new method for specification of recurrence or transient of states in one and two dimensional simple random walk based on upper and lower bounds of {\it r}-combinations from a set of m elements $(C^{m}_{r})$ via binary entropy is introduced.