2000 character limit reached
Every cutoff profile is possible (2509.23069v1)
Published 27 Sep 2025 in math.PR
Abstract: We introduce fruit-inosculated-tree Markov chains. These chains have easily tunable parameters and are a good source of examples. In particular, we prove that every cutoff profile is possible, with any cutoff time and window size.
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.