On Mixing Behavior of a Family of Random Walks Determined by a Linear Recurrence

We study random walks on the integers mod $G_n$ that are determined by an integer sequence $\{G_n{\}}_{n\ge 1}$ generated by a linear recurrence relation. Fourier analysis provides explicit formulas to compute the eigenvalues of the transition matrices and we use this to bound the mixing time of the random walks.