On Mixing Behavior of a Family of Random Walks Determined by a Linear Recurrence
Abstract
We study random walks on the integers mod Gn that are determined by an integer sequence \ Gn \n ≥ 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.