
















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 c_m(n) of monotone paths of length n in a strip of height m. In particular we compute the exponential growth constant of c_m(n) for arbitrary m, generalizing results of Williams for m=2, 3.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。