Linear Recurrent Sequences, Markov Chains and Their Applications in Graph Theory
Combinatorics
2025-10-07 v1
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.
Cite
@article{arxiv.2510.03537,
title = {Linear Recurrent Sequences, Markov Chains and Their Applications in Graph Theory},
author = {Rebecca Carter and M. Ram Murty},
journal= {arXiv preprint arXiv:2510.03537},
year = {2025}
}
Comments
14 pages. Submitted to Linear Algebra and its Applications