Linear Recurrent Sequences, Markov Chains and Their Applications in Graph Theory

Abstract

After a brief review of the key theorems concerning recurrent sequences, we give an explicit computation of the inverse of the Vandermonde matrix. This will then be used to derive sub-exponential decay error terms in the ergodic theorem of Markov chains. Finally, we apply these results to give estimates for the diameters of directed graphs.