Meander Graphs

We consider a Markov chain Monte Carlo approach to the uniform sampling of meanders. Combinatorially, a meander $M = [A:B]$ is formed by two noncrossing perfect matchings, above $A$ and below $B$ the same endpoints, which form a single closed loop. We prove that meanders are connected under appropri...

Full description

Bibliographic Details
Published in:Discrete Mathematics & Theoretical Computer Science
Main Authors: Christine E. Heitsch, Prasad Tetali
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2011-01-01
Subjects:
noncrossing partitions
perfect matchings
markov chain monte carlo
combinatorial enumeration
[math.math-co] mathematics [math]/combinatorics [math.co]
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:https://dmtcs.episciences.org/2926/pdf

Internet

https://dmtcs.episciences.org/2926/pdf

Similar Items