On the uniform generation of modular diagrams

Fenix W. D. Huang, Christian M. Reidys

In this paper we present an algorithm that generates $k$-noncrossing, $\sigma$-modular diagrams with uniform probability. A diagram is a labeled graph of degree $\le 1$ over $n$ vertice…