English

Mixing Time and Cutoff for a Random Walk on the Ring of Integers mod $n$

Probability 2016-02-26 v2

Abstract

We analyse a random walk on the ring of integers mod nn, which at each time point can make an additive `step' or a multiplicative `jump'. When the probability of making a jump tends to zero as an appropriate power of nn we prove the existence of a total variation pre-cutoff for this walk. In addition, we show that the process obtained by subsampling our walk at jump times exhibits a true cutoff, with mixing time dependent on whether the step distribution has zero mean.

Keywords

Cite

@article{arxiv.1407.3580,
  title  = {Mixing Time and Cutoff for a Random Walk on the Ring of Integers mod $n$},
  author = {Michael E. Bate and Stephen B. Connor},
  journal= {arXiv preprint arXiv:1407.3580},
  year   = {2016}
}

Comments

15 pages; accepted for publication in Bernoulli Journal