Highly Influenced

# Sampling decomposable graphs using a Markov chain on junction trees

@inproceedings{Green2011SamplingDG, title={Sampling decomposable graphs using a Markov chain on junction trees}, author={Peter J. Green}, year={2011} }

- Published 2011

This paper makes two contributions to the computational geometry of decomposable graphs, aimed primarily at facilitating statistical inference about such graphs where they arise as assumed conditional independence structures in stochastic models. The first of these provides sufficient conditions under which it is possible to completely connect two disconnected cliques of vertices, or perform the reverse procedure, yet maintain decomposability of the graph. The second is a new Markov chain Monte… CONTINUE READING

#### From This Paper

##### Figures, tables, and topics from this paper.

15 Citations

12 References

Similar Papers