A simple algorithm for checking compatibility among discrete conditional distributions
A distribution is said to be conditionally specified when only its conditional distributions are known or available. The very first issue is always compatibility: does there exist a joint distribution capable of reproducing all of the conditional distributions? We review five methods-mostly for two or three variables-published since 2002, and we conclude that these methods are either mathematically too involved and/or are too difficult (and in many cases impossible) to generalize to a high dimension. The purpose of this paper is to propose a general algorithm that can efficiently verify compatibility in a straightforward fashion. Our method is intuitively simple and general enough to deal with any full-conditional specifications. Furthermore, we illustrate the phenomenon that two theoretically equivalent conditional models can be different in terms of compatibilities, or can result in different joint distributions. The implications of this phenomenon are also discussed.
Year of publication: |
2011
|
---|---|
Authors: | Kuo, Kun-Lin ; Wang, Yuchung J. |
Published in: |
Computational Statistics & Data Analysis. - Elsevier, ISSN 0167-9473. - Vol. 55.2011, 8, p. 2457-2462
|
Publisher: |
Elsevier |
Keywords: | Connected site Consecutive site Full conditionals Support Odds Path |
Saved in:
Saved in favorites
Similar items by person
-
Compatibility of discrete conditional distributions with structural zeros
Wang, Yuchung J., (2010)
-
Jiang, Thomas J., (2004)
-
Distribution of functionals of a Ferguson–Dirichlet process over an n-dimensional ball
Dickey, James M., (2013)
- More ...