## Abstract

To deal with the compatibility issue of full conditional distributions of a (discrete) random vector, a graphical representation is introduced where a vertex corresponds to a configuration of the random vector and an edge connects two vertices if and only if the ratio of the probabilities of the two corresponding configurations is specified through one of the given full conditional distributions. Compatibility of the given full conditional distributions is equivalent to compatibility of the set of all specified probability ratios (called the ratio set) in the graphical representation. Characterizations of compatibility of the ratio set are presented. When the ratio set is compatible, the family of all probability distributions satisfying the specified probability ratios is shown to be the set of convex combinations of k probability distributions where k is the number of components of the underlying graph.

Original language | English |
---|---|

Pages (from-to) | 1-9 |

Number of pages | 9 |

Journal | Journal of Multivariate Analysis |

Volume | 124 |

DOIs | |

State | Published - Feb 2014 |

## Keywords

- Connected graph
- Full conditional
- Graph theory
- Primary
- Secondary
- Spanning tree