Total variation and separation cutoffs are not equivalent and neither one implies the other

The cutoff phenomenon describes the case when an abrupt transition occurs in the convergence of a Markov chain to its equilibrium measure. There are various metrics which can be used to measure the distance to equilibrium, each of which corresponding to a different notion of cutoff. The most commonly used are the total-variation and the separation distances. In this note we prove that the cutoff for these two distances are not equivalent by constructing several counterexamples which display cutoff in total-variation but not in separation and with the opposite behavior, including lazy simple random walk on a sequence of uniformly bounded degree expander graphs. These examples give a negative answer to a question of Ding, Lubetzky and Peres.

[1]  H. Lacoin.  Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion , 2013, 1309.3873.

[2]  J. Hermon.  A technical report on hitting times, mixing and cutoff , 2015, 1501.01869.

[3]  Y. Peres,et al.  Characterization of cutoff for reversible Markov chains , 2014, SODA.

[4]  Guan-Yu Chen,et al.  Comparison of Cutoffs Between Lazy Walks and Markovian Semigroups , 2013, Journal of Applied Probability.

[5]  Allan Sly,et al.  Cutoff for the Ising model on the lattice , 2009, 0909.4320.

[6]  V. Climenhaga.  Markov chains and mixing times , 2013 .

[7]  Jorge Alberto Achcar,et al.  Markov Chain Models , 2012 .

[8]  Allan Sly,et al.  Explicit Expanders with Cutoff Phenomena , 2010, 1003.3515.

[9]  Allan Sly,et al.  Cutoff phenomena for random walks on random regular graphs , 2008, 0812.0060.

[10]  Guan-Yu Chen,et al.  The cutoff phenomenon for ergodic Markov processes , 2008 .

[11]  Jian Ding,et al.  Total variation cutoff in birth-and-death chains , 2008, 0801.2625.

[12]  James Allen Fill,et al.  The Passage Time Distribution for a Birth-and-Death Chain: Strong Stationary Duality Gives a First Stochastic Proof , 2007, 0707.4042.

[13]  Persi Diaconis,et al.  Separation cut-offs for birth and death chains , 2006, math/0702411.

[14]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[15]  Avi Wigderson,et al.  Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[16]  David J. Aldous,et al.  Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[17]  Miklós Ajtai,et al.  Recursive construction for 3-regular expanders , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[18]  Mark Jerrum,et al.  Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, WG.

[19]  N. Alon.  Eigenvalues and expanders , 1986, Comb..

[20]  Noga Alon,et al.  lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.

[21]  N. Alon,et al.  il , , lsoperimetric Inequalities for Graphs , and Superconcentrators , 1985 .

[22]  P. Flajolet.  On approximate counting , 1982 .

[23]  J. Keilson.  Markov Chain Models--Rarity And Exponentiality , 1979 .