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

2017/10/10 by Stanley, Caprice, Sullivant, Seth
#60J10 #Combinatorics (math.CO) #FOS: Mathematics #Probability (math.PR)

paper · doi:10.48550/arxiv.1710.03845

Abstract

We study random walks on the integers mod G_n that are determined by an integer sequence \ G_n \_{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.

Related

• Mixing time of a matrix random walk generated by elementary transvections
• Cutoff Phenomenon and Limiting Profile of a Random Walk on the Symmetric Group
• On random walks and switched random walks on homogeneous spaces
• The random walk on upper triangular matrices over ℤ/m ℤ
• On the Mixing Time of Kac's Walk and Other High-Dimensional Gibbs\n Samplers with Constraints