Papers
Topics
Authors
Recent
Search
2000 character limit reached

Every cutoff profile is possible

Published 27 Sep 2025 in math.PR | (2509.23069v1)

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.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up