Subgraph Approximations for Directed Graphical Models

  • Constantin T. Yiannoutsos
  • Alan E. Gelfand
Conference paper


Graphical Models provide a powerful tool for the formulation of general statistical models. In a previous paper, (Yiannoutsos and Gelfand, 1991), the authors argued that sampling-based techniques provide a unified approach for the analysis of graphical models under general distributional specifications. These techniques include both noniterative and iterative Monte Carlo.

Our concern here is with moderate to large possibly highly connected graphical models whose size and complexity may prohibit analysis within a reasonable time frame. Typically in large systems however, interest focuses on the behavior of only a few critical nodes. Our proposal is to develop, for a particular node, an approximating subgraph which contains virtually as much information about the variable as the full network, but by virtue of its reduced size, enables rapid computational investigation. We provide an illustration using a 40-node graph. Though this is not as large as we would envision in practice, it is convenient in permitting full model calculations to enable assessment of our approximations.


Source Node Graphical Model Conditional Distribution Linear Chain Critical Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Darroch, J. N., Lauritzen, S. L. and Speed, T. P. (1980). Markov fields and log-linear interaction models for contingency tables. The Annals of Statistics 8, 522–539.MathSciNetMATHCrossRefGoogle Scholar
  2. DeGroot, M. H. and Goel, P. K. (1986) Information and Bayesian hierarchical models. Unpublished Manuscript.Google Scholar
  3. Devroye, L. (1986) Non-Uniform Random Number Generation. Springer-Verlag, New York.Google Scholar
  4. Gelfand, A. E. and Smith A. F. M. (1990). Sampling based approaches to calculating marginal densities. Journal of the American Statistical Association 85, 398–409MathSciNetMATHCrossRefGoogle Scholar
  5. Geweke, J. (1989). Bayesian inference in econometric models using Monte Carlo simulation. Econometrica 57, 1317–1339.MathSciNetMATHCrossRefGoogle Scholar
  6. Henrion, M. (1988). Propagating uncertainty in Bayesian networks by probabilistic logic sampling. In Uncertainty in Artificial Intelligence, Vol. 2, J. Lemmer, and L. N. Kanal (Eds.). North-Holland: Amsterdam, 149–164.Google Scholar
  7. Lauritzen, S. L. (1990a). Propagation of probabilities, means and variances in mixed graphical association models. Research Report 90–18, Aalborg University.Google Scholar
  8. Lauritzen, S. L. (1990b). Mixed graphical association models, Scandinavian Journal of Statistics 16, 273–306.MathSciNetGoogle Scholar
  9. Lauritzen, S. L. and Spiegelhalter, D. J. (1988). Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society, Series B 50, 57–224.MathSciNetGoogle Scholar
  10. Muller, P. (1992). A generic approach to posterior integration and Gibbs sampling. Journal of American Statistical Association, (to appear).Google Scholar
  11. Oh, M.-S., and Berger, J. O. (1992). Adaptive imputation sampling in Monte Carlo integration. Journal of Statistical Computing and Simulation, (to appear).Google Scholar
  12. Pearl, J. (1987). Evidential reasoning using stochastic simulation of causal models. Artificial Intelligence 32, 247–257.MathSciNetCrossRefGoogle Scholar
  13. Rubin, D. (1988). Using the SIR algorithm to simulate posterior distributions. In Bayesian Statistics 3, Eds. J. Bernardo et al. Oxford University Press, 395–402.Google Scholar
  14. Shachter, R. D. and Peot, M. A. (1989). Evidential reasoning using likelihood weighting. Artificial Intelligence, (submitted).Google Scholar
  15. Smith, A. F. M. and Gelfand, A. E. (1992). Bayesian statistics without tears: a sampling-resampling perspective. The American Statistician 46, 84–88.MathSciNetCrossRefGoogle Scholar
  16. Tierney, L. (1991). Markov chains for exploring posterior distributions. Technical Report No. 560, School of Statistics, University of Minnesota.Google Scholar
  17. Wakefield, J., Gelfand, A. E., and Smith, A. F. M. (1991). Efficient computation of random variates via the ratio-of-uniforms method. Statistics and Computing 1, 129–134.CrossRefGoogle Scholar
  18. West, M. (1992). Approximating posterior distributions by mixtures. In Bayesian Statistics 4, Eds. J. Bernardo et al. Oxford University Press, 505–524.Google Scholar
  19. Whittaker, J. (1990). Graphical Models in Applied Multivariate Statistics. John Wiley and Sons, New York.MATHGoogle Scholar
  20. Yiannoutsos, C. T. and Gelfand, A. E. (1991). Simulation approaches for calculations in directed graphical models. Technical Report No. 91–23, Department of Statistics, University of Connecticut.Google Scholar

Copyright information

© Springer-Verlag New York, Inc. 1994

Authors and Affiliations

  • Constantin T. Yiannoutsos
    • 1
  • Alan E. Gelfand
    • 1
  1. 1.The University of ConnecticutUSA

Personalised recommendations