States recognition in random walk Markov chain via binary Entropy

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 r-combinations from a set of m elements (C^{r} _{m}) via binary entropy is introduced.