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...
Main Authors: | Christine E. Heitsch, Prasad Tetali |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2011-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/2926/pdf |
Similar Items
-
(k − 2)-linear connected components in hypergraphs of rank k
by: Florian Galliot, et al.
Published: (2023-11-01) -
On Kerov polynomials for Jack characters (extended abstract)
by: Valentin Féray, et al.
Published: (2013-01-01) -
Enumeration of alternating sign matrices of even size (quasi)-invariant under a quarter-turn rotation
by: Jean-Christophe Aval, et al.
Published: (2009-01-01) -
Indecomposable permutations with a given number of cycles
by: Robert Cori, et al.
Published: (2009-01-01) -
Genus one partitions
by: Robert Cori, et al.
Published: (2014-01-01)