%0 Journal Article
%T States recognition in random walk Markov chain via binary Entropy
%A Morteza Khodabin
%J Journal of Interpolation and Approximation in Scientific Computing
%D 2013
%I International Scientific Publications and Consulting Services (ISPACS)
%R 10.5899/2013/jiasc-00025
%X 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.
%K "">Markov chain
%K Shannon's entropy
%K Stirling's approximation"/>
%U http://www.ispacs.com/journals/jiasc/2013/jiasc-00025/article.pdf