Hostname: page-component-5db58dd55d-htx7c Total loading time: 0 Render date: 2026-06-01T15:23:05.064Z Has data issue: false hasContentIssue false
  • English
  • Français

Conditional Independences among Four Random Variables I*

Published online by Cambridge University Press:  12 September 2008

F. Matúš  and
M. Studený
F. Matúš
Affiliation:
Institute of Information Theory and Automation, Pod vodárenskou věží 4, 182 08 Prague, Czech Republic e-mail: matus@utia.cas.cz, studeny@utia.cas.cz
M. Studený
Affiliation:
Institute of Information Theory and Automation, Pod vodárenskou věží 4, 182 08 Prague, Czech Republic e-mail: matus@utia.cas.cz, studeny@utia.cas.cz
Get access Rights & Permissions [Opens in a new window]

Abstract

The conditional independences within a system of four discrete random variables are studied simultaneously. The problem of where independences can occur at the same time, called the problem of probabilistic representability, is attacked by an analysis of cones of polymatroids. New results on the cone of all polymatroids satisfying Ingleton inequalities imply a substantial reduction of the problem and an explicit description of the remaining open cases.†

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 4 , Issue 3 , September 1995 , pp. 269 - 278
Copyright
Copyright © Cambridge University Press 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1]Birkhoff, G. (1984) Lattice Theory. Nauka, Moscow. (Russian translation)Google Scholar
[2]Fujishige, S. (1978) Polymatroidal dependence structure of a set of random variables. Infor. Control 39 55–72.Google Scholar
[3]Ingleton, A. W. (1971) Conditions for representability and transversality of matroids. Proc. Fr. Br. Conf. Springer-Verlag, LNCS 211, 62–67.Google Scholar
[4]Leichtweiss, K. (1980) Konvexe Mengen. VEB Deutscher Verlag der Wissenschaften.Google Scholar
[5]Matúš, F. (1992) Ascending and descending conditional independence relations. Trans. 11th Prague Conf. Infor. Theory, Statistical Decision Functions and Random Processes, Academia, Prague, Vol. B, 181–200.Google Scholar
[6]Matúš, F. (1992) On equivalence of Markov properties over undirected graphs. J. Appl. Prob. 29 745–749.Google Scholar
[7]Matúš, F. (1994) Probabilistic conditional independence structures and matroid theory: background. Int. J. General Syst. 22 185–196.Google Scholar
[8]Matúš, F. (1994) Extreme convex set functions with many nonnegative differences. Discrete Mathematics 135 177–191.Google Scholar
[9]Nguyen, H. Q. (1986) Semimodular functions. In: White, N. (ed.), Theory of Matroids, Cambridge University Press.Google Scholar
[10]Pearl, J. (1988) Probabilistic Reasoning in Intelligent Systems. Morgan Kaufman.Google Scholar
[11] Studený, M. (1989) Multiinformation and the problem of characterization of conditional independence relations. Problems of Control and Infor. Theory. 18 3–16.Google Scholar
[12]Studený, M. (1992) Conditional independence relations have no finite complete characterization. Trans. 11th Prague Conf. on Information Theory. Academia, Prague, Vol. B, 377–396.Google Scholar
[13]Studený, M. (1994) Structural semigraphoids. Int. J. General Syst. 22 207–217.Google Scholar
[14]Studený, M. (1994) Description of structures of stochastic conditional independence by means of faces and imsets (in three parts). Int. J. General Syst. 23 123–137, 207–219, 323–347.Google Scholar
[15]Welsh, D. J. A. (1976) Matroid Theory. Academic Press.Google Scholar