Abstract The junction-tree representation provides an attractive structural property for organising a decomposable graph . In this study, we present two novel stochastic algorithms, referred to as the expander and collapser , sequential sampling of junction trees graphs. We show that recursive application expander, which expands incrementally underlying with one vertex at time, has full support...