|
|
States recognition in random walk Markov chain via binary EntropyKeywords: Markov chain &searchField=keyword">"">Markov chain , Shannon's entropy ,&searchField=keyword"> Stirling's approximation"/> Abstract: 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.
|
