Cut-off phenomenon for the ax+b Markov chain over a finite field

Abstract

We study the Markov chain xn+1=axn+bn on a finite field Fp, where a ∈ Fp is fixed and bn are independent and identically distributed random variables in Fp. Conditionally on the Riemann hypothesis for all Dedekind zeta functions, we show that the chain exhibits a cut-off phenomenon for most primes p and most values of a ∈ Fp. We also obtain weaker, but unconditional, upper bounds for the mixing time.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…