Markov chains, CAT(0) cube complexes, and enumeration: monotone paths in a strip mix slowly
Abstract
We prove that two natural Markov chains on the set of monotone paths in a strip mix slowly. To do so, we make novel use of the theory of non-positively curved (CAT(0)) cubical complexes to detect small bottlenecks in many graphs of combinatorial interest. Along the way, we give a formula for the number cm(n) of monotone paths of length n in a strip of height m. In particular we compute the exponential growth constant of cm(n) for arbitrary m, generalizing results of Williams for m=2, 3.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.