2000 character limit reached
Computing cutoff times of birth and death chains (1502.00361v1)
Published 2 Feb 2015 in math.PR
Abstract: Earlier work by Diaconis and Saloff-Coste gives a spectral criterion for a maximum separation cutoff to occur for birth and death chains. Ding, Lubetzky and Peres gave a related criterion for a maximum total variation cutoff to occur in the same setting. Here, we provide complementary results which allow us to compute the cutoff times and windows in a variety of examples.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.