Finite-state Markov Chains

@inproceedings{Hill2010FinitestateMC,
  title={Finite-state Markov Chains},
  author={Theodore P. Hill},
  year={2010}
}
A sequence of real numbers (xn) is Benford if the significands, i.e. the fraction parts in the floating-point representation of (xn), are distributed logarithmically. Similarly, a discrete-time irreducible and aperiodic finite-state Markov chain with ∗ probability transition matrix P and limiting matrix P is Benford if every com­ n n+1 − P n) ponent of both sequences of matrices (P − P ∗) and (P is Benford or eventually zero. Using recent tools that established Benford behavior both for Newton… CONTINUE READING

Citations

Publications citing this paper.