Enumerating the junction trees of a decomposable graph

Journal of Computational and Graphical Statistics

Volumn 18, Issue 4, 2009, Pages 930-940

  Thomas, Alun ^a   Green, Peter J ^b  

^a UNIVERSITY OF UTAH SCHOOL OF MEDICINE   (United States)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Chordal graphs; Graphical models; Markov chain Monte Carlo methods; Triangulated graphs

Indexed keywords

EID: 72449152648     PISSN: 10618600     EISSN: None     Source Type: Journal    
DOI: 10.1198/jcgs.2009.07129     Document Type: Article

References (18)

1. Broder, A. Z., and Mayr, E. W. (1997), "Counting Minimum Weight Spanning Trees," Journal of Algorithms, 24, 171-176.
2. Cayley, A. (1889), "A Theorem on Trees," Quarterly Journal of Mathematics, 23, 376-378.
3. Coppersmith, D., andWinograd, S. (1990), "Matrix Multiplication via Arithmetic Progressions," Journal of Symbolic Computation, 9, 251-280.
4. Giudici, P., and Green, P. J. (1999), "Decomposable Graphical Gaussian Model Determination," Biometrika, 86, 785-801.
5. Golumbic, M. C. (1980), Algorithmic Graph Theory and Perfect Graphs, New York: Academic Press.
6. Hastings, W. K. (1970), "Monte Carlo Sampling Methods Using Markov Chains and Their Applications," Biometrika, 57 (1), 97-109.
7. Jensen, F. V. (1988), "Junction Trees and Deomposable Hypergraphs," technical report, Judex Datasystemer, Aalborg, Denmark.
8. Jones, B., Carvalho, C., Dobra, A., Hans, C., Carter, C., and West, M. (2005), "Experiments in Stochastic Compuation for High-Dimensional Graphical Models," Statistical Science, 20, 388-400.
9. Kirkpatrick, S., Gellatt, C. D., Jr., and Vecchi, M. P. (1982), "Optimization by Simmulated Annealing," Technical Report RC 9353, IBM, Yorktown Heights.
10. Lauritzen, S. L. (1996), Graphical Models, Oxford: Clarendon Press.
11. Metropolis, N., Rosenbluth, A.W., Rosenbluth, M. N., and Teller, A. H. (1953), "Equations of State Calculations by Fast Computing Machines," Journal of Chemistry and Physics, 21, 1087-1091.
12. Moon, J. W. (1970), "Enumerating Labelled Trees," in Graph Theory and Theoretical Physics, ed. F. Harary, London: Academic Press.
13. Prüfer, H. (1918), "Neuer beweis eines satzes uber permutationen," Archiv fur Mathematik und Physik, 27, 142-144.
14. Strassen, V. (1969), "Gaussian Elimination Is Not Optimal," Numerical Mathematics, 13, 354-356.
15. Tarjan, R. E., and Yannakakis, M. (1984), "Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs," SIAM Journal of Computing, 13, 566-579.
16. Thomas, A. (2005), "Characterizing Allelic Associations From Unphased Diploid Data by Graphical Modeling," Genetic Epidemiology, 29, 23-35.
17. - (2009), "Estimation of Graphical Models Whose Conditional Independence Graphs Are Interval Graphs and Its Application to Modeling Linkage Disequilibrium," Computational Statistics and Data Analysis, 53, 1818-1828.
18. Thomas, A., and Camp, N. J. (2004), "Graphical Modeling of the Joint Distribution of Alleles at Associated Loci," American Journal of Human Genetics, 74, 1088-1101.