Enumerating the decomposable neighbors of a decomposable graph under a simple perturbation scheme

Computational Statistics and Data Analysis

Volumn 53, Issue 4, 2009, Pages 1232-1238

  Thomas, Alun ^a   Green, Peter J ^b  

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

^b UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; MARKOV PROCESSES; PROBABILITY DISTRIBUTIONS;

MARKOV CHAIN MONTE CARLO METHODS (MCMC); POSTERIOR DISTRIBUTIONS;

MONTE CARLO METHODS;

EID: 58549118244     PISSN: 01679473     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.csda.2008.10.029     Document Type: Article

References (13)

1. Deshpande, A., Garofalakis, M.N., Jordan, M.I., 2001. Efficient stepwise selection in decomposable models. In: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence. pp. 128-135
2. Dobra A., Hones B., Hans C., Nevins J., and West M. Sparse graphical models for exploring gene expression data. Journal of Multivariate Analysis 90 (2003) 196-212
3. Frydenberg M., and Lauritzen S.L. Decomposition of maximum likelihood in mixed interaction models. Biometrika 76 (1989) 539-555
4. Giudici P., and Green P.J. Decomposable graphical Gaussian model determination. Biometrika 86 (1999) 785-801
5. Hastings W.K. Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57 1 (1970) 97-109
6. Højsgaard S., and Thiesson B. BIFROST - Block recursive models Induced From Relevant knowledge, Observations, and Statistical Techniques. Computational Statistics and Data Analysis 19 (1995) 155-175
7. Jones B., Carvalho C., Dobra A., Hans C., Carter a.C., and West M. Experiments in stochastic computation for high-dimensional graphical models. Statistical Science 20 (2005) 388-400
8. Kirkpatrick, S., Gellatt, C.D. Jr., Vecchi, M.P., 1982. Optimization by simulated annealing. Technical Report RC 9353, IBM, Yorktown Heights
9. Lauritzen S.L. Graphical Models (1996), Clarendon Press
10. Metropolis N., Rosenbluth A.W., Rosenbluth M.N., and Teller A.H. Equations of state calculations by fast computing machines. Journal of Chemistry and Physics 21 (1953) 1087-1091
11. Tarjan R.E., and Yannakakis M. Simple linear-time algorithms to test the chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal of Computing 13 (1984) 566-579
12. Thomas A. Characterizing allelic associations from unphased diploid data by graphical modeling. Genetic Epidemiology 29 (2005) 23-35
13. Thomas A., and Camp N.J. Graphical modeling of the joint distribution of alleles at associated loci. American Journal of Human Genetics 74 (2004) 1088-1101