Skip to main content
SpringerLink
Log in

Conditional independence structures examined via minors

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

The notion of minor from matroid theory is adapted to examination of classes of conditional independence structures. For the classes of semigraphoids, pseudographoids and graphoids, finite sets of their forbidden minors are found. The separation graphoids originating from simple undirected graphs and triangulated graphs are characterized in this way neatly as well. Semigraphoids corresponding to the local Markov property of undirected graphs and to the d-separation in directed acyclic graphs are discussed. A new class of semimatroids, called simple semimatroids, is introduced and an infinite set of its forbidden minors constructed. This class cannot be characterized by a finite number of axioms. As a consequence, the class of all semimatroids and the classes of conditional independence structures of stochastic variables and of linear subspaces have infinite sets of forbidden minors and have no finite axiomatization. The closure operator of semimatroids is examined by linear programming methods. All possibilities of conditional independences among disjoint groups of four random variables are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S.A. Andersson and M.D. Perlman, Lattice models for conditional independence in a multivariate normal distribution, The Annals of Statistics 21 (1993) 1318–1358.

    MATH  MathSciNet  Google Scholar 

  2. Z. Ann, D.A. Bell and J.G. Hughes, On the axiomization of conditonal independence, Int. J. of Systems and Cybernetics (Kybernetes) 21 (1992) 48–58.

    Google Scholar 

  3. G. Birkhoff, Lattice Theory (Nauka, Moscow, 1984) (Russian translation).

    Google Scholar 

  4. L.M. de Campos, Independency relationships and learning algorithms for singly connected networks, University of Granada, Tech. Report of DECSAI-960204 (1996).

  5. L.M. de Campos, Characterizations of decomposable dependency models, University of Granada, Tech. Report of DECSAI-960225 (1996).

  6. V. Chvátal, Linear Programming (W.H. Freeman and Comp., New York, 1983).

    Google Scholar 

  7. J.N. Darroch, S.L. Lauritzen and T.P. Speed, Markov fields and log-linear interaction models for contingency tables, The Annals of Statistics 8 (1980) 522–539.

    MATH  MathSciNet  Google Scholar 

  8. A.P. Dawid, Conditional independence in statistical theory (with discussion), J. Roy. Statist. Soc., Series B 41 (1979) 1–31.

    MATH  MathSciNet  Google Scholar 

  9. S. Fujishige, Polymatroidal dependence structure of a set of random variables, Information and Control 39 (1978) 55–72.

    Article  MATH  MathSciNet  Google Scholar 

  10. D. Geiger, Graphoids: a qualitative framework for probabilistic inference, Ph.D. Dissertation, Computer Science Department, University of California, Los Angeles (1990).

    Google Scholar 

  11. D. Geiger and J. Pearl, On the logic of influence diagrams, in: Proc. 4th Workshop on Uncertainty in AI, Minneapolis, MN (1988) pp. 136–147.

  12. D. Geiger and J. Pearl, Logical and algorithmic properties of conditional independence, Technical Report R-97, Cognitive Systems Laboratory, University of California, Los Angeles (1988).

    Google Scholar 

  13. D. Geiger and J. Pearl, Logical and algorithmic properties of conditional independence and graphical models, The Annals of Statistics 21 (1993) 2001–2021.

    MATH  MathSciNet  Google Scholar 

  14. V.P. Grishukin, On the extremality of the rank function of a connected semimodular lattice, Amer. Math. Soc. Transl. 158 (1994) 31–36.

    Google Scholar 

  15. A.W. Ingleton, Conditions for representability and transversality of matroids, in: Proc. Fr. Br. Conf., Springer Lecture Notes 211 (1970) pp. 62–67.

  16. D.E. Knuth, The asymptotic number of geometries, J. Comb. Th. (A) 16 (1974) 398–400.

    Article  MATH  MathSciNet  Google Scholar 

  17. J.T.A. Koster, Markov properties of nonrecursive causal models, Ann. Statist. 24 (1996) 2148–2177.

    Article  MATH  MathSciNet  Google Scholar 

  18. S.L. Lauritzen, Lectures on Contingency Tables, 3rd ed. (University of Aalborg Press, Aalborg, 1989).

    Google Scholar 

  19. S.L. Lauritzen, Graphical Models (Oxford University Press, Oxford, 1996).

    Google Scholar 

  20. S.L. Lauritzen, A.P. Dawid, B.N. Larsen and H.G. Leimer, Independence properties of directed Markov fields, Networks 20 (1990) 491–505.

    MATH  MathSciNet  Google Scholar 

  21. F. Matúš, Ascending and descending conditional independence relations, in: Transactions of the 11th Prague Conference on Information Theory, Statistical Decision Functions and Random Processes, Vol. B (Academia, Prague (also Kluwer, Dordrecht), 1992) pp. 189–200.

    Google Scholar 

  22. F. Matúš, On equivalence of Markov properties over undirected graphs, Journal of Applied Probability 29 (1992) 745–749.

    Article  MathSciNet  Google Scholar 

  23. F. Matúš, Probabilistic conditional independence structures and matroid theory: background, Int. J. of General Systems 22 (1994) 185–196.

    Google Scholar 

  24. F. Matúš, Extreme convex set functions with many nonnegative differences, Discrete Mathematics 135 (1994) 177–191.

    Article  MathSciNet  Google Scholar 

  25. F. Matúš, Conditional independences among four random variables II, Combinatorics, Probability and Computing 4 (1995) 407–417.

    MathSciNet  Google Scholar 

  26. F. Matúš, Conditional independences among four random variables III (1997), submitted to Combinatorics, Probability and Computing.

  27. F. Matúš and M. Studený, Conditional independences among four random variables I, Combinatorics, Probability and Computing 4 (1995) 269–278.

    MathSciNet  Google Scholar 

  28. M. Mouchart and J.M. Rolin, A note on conditional independence with statistical applications, Statistica 44 (1984) 557–584.

    MATH  MathSciNet  Google Scholar 

  29. H.Q. Nguyen, Semimodular functions, in: Theory of Matroids, ed. N. White (Cambridge University Press, Cambridge, London, 1996).

    Google Scholar 

  30. R.N. Oliver and J.Q. Smith, Influence Diagrams, Belief Nets and Decision Analysis (Wiley, Chichester, 1990).

    Google Scholar 

  31. J.G. Oxley, Matroid Theory (Oxford University Press, Oxford, New York, Tokyo, 1992).

    Google Scholar 

  32. J. Pearl, Probabilistic Reasoning in Intelligent Systems (Morgan Kaufmann, San Mateo, CA, 1988).

    Google Scholar 

  33. J. Rosenmüller and H.G. Weidner, Extreme convex set functions with finite carrier: general theory, Discrete Math. 10 (1974) 343–382.

    Article  MATH  MathSciNet  Google Scholar 

  34. Y. Sagiv and S.F. Walecka, Subset dependencies and a completeness result for a subclass of embedded multivalued dependencies, J. of ACM 29 (1988) 103–117.

    Article  MathSciNet  Google Scholar 

  35. L.S. Shapley, Cores of convex games, Int. J. of Game Theory 1 (1971/72) 11–26.

    Article  MATH  MathSciNet  Google Scholar 

  36. T.P. Speed, A note on nearest-neighbour Gibbs and Markov probabilities, Sankhya, Series A 41 (1979) 184–197.

    MATH  MathSciNet  Google Scholar 

  37. W. Spohn, Stochastic independence, causal independence and shieldability, J. of Philosophical Logic 9 (1980) 73–99.

    Article  MATH  MathSciNet  Google Scholar 

  38. W. Spohn, On the properties of conditional independence, in: P. Suppes, Scientific Philosopher, Vol. 1, ed. P. Humphreys (Kluwer, Dordrecht, 1994) pp. 173–196.

    Google Scholar 

  39. M. Studený, Multiinformation and the problem of characterization of conditional independence relations, Problems of Control and Inf. Th. 18 (1989) 3–16.

    MATH  Google Scholar 

  40. M. Studený, Convex set functions I. and II., Research Reports 1733 and 1734, Institute of Information Theory and Automation, Prague (November 1991).

    Google Scholar 

  41. M. Studený, Conditional independence relations have no finite complete characterization, in: Transactions of the 11th Prague Conference on Information Theory, Statistical Decision Functions and Random Processes, Vol. B (Academia, Prague (also Kluwer, Dordrecht), 1991) pp. 377–396.

    Google Scholar 

  42. M. Studený, Structural semigraphoids, Int. J. of General Systems 22 (1994) 207–217.

    MATH  Google Scholar 

  43. M. Studený, Description of structures of stochastic conditional independence by means of faces and imsets (in three parts), Int. J. of General Systems 23. 1st Part: Introduction and basic concepts 23(2) (1994) 123–137; 2nd Part: Basic theory 23(2) (1995) 201–219; 3rd Part: Examples of use and appendices 23(4) (1995) 323–341.

    Google Scholar 

  44. M. Studený and P. Boček, CI-models arising among 4 random variables, in: Proceedings of the 3rd Workshop on Uncertainty Processing in Expert Systems, Institute of Information Theory and Automation, Prague (1994) pp. 268–282.

    Google Scholar 

  45. D.J.A. Welsh, Matroid Theory (Academic Press, London, 1976).

    Google Scholar 

  46. J. Whittaker, Graphical Models in Applied Multivariate Statistics (Wiley, Chichester, 1990).

    Google Scholar 

  47. R.W. Yeung, A framework for information-theoretic inequalities, IEEE Trans. Inf. Th. (1997) (to appear).

Download references

Author information

Authors and Affiliations

  1. Statistik und Informatik, Universität Bielefeld, Postfach 100131, 33501, Bielefeld, Germany

    František Matúš

Authors
  1. František Matúš
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Matúš, F. Conditional independence structures examined via minors. Annals of Mathematics and Artificial Intelligence 21, 99–30 (1997). https://doi.org/10.1023/A:1018957117081

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018957117081

Keywords

Search

Navigation