×

Lattice conditional independence models and Hibi ideals. (English) Zbl 07720875

Summary: Lattice conditional independence models [Andersson and Perlman, Lattice models for conditional independence in a multivariate normal distribution, Ann. Statist. 21 (1993), 1318-1358] are a class of models developed first for the Gaussian case in which a distributive lattice classifies all the conditional independence statements. The main result is that these models can equivalently be described via a transitive directed acyclic graph (TDAG) in which, as is normal for causal models, the conditional independence is in terms of conditioning on ancestors in the graph. We demonstrate that a parallel stream of research in algebra, the theory of Hibi ideals, not only maps directly to the lattice conditional independence models but gives a vehicle to generalise the theory from the linear Gaussian case. Given a distributive lattice (i) each conditional independence statement is associated with a Hibi relation defined on the lattice, (ii) the directed graph is given by chains in the lattice which correspond to chains of conditional independence, (iii) the elimination ideal of product terms in the chains gives the Hibi ideal and (iv) the TDAG can be recovered from a special bipartite graph constructed via the Alexander dual of the Hibi ideal. It is briefly demonstrated that there are natural applications to statistical log-linear models, time series and Shannon information flow.

MSC:

62R01 Algebraic statistics
05E40 Combinatorial aspects of commutative algebra
13P25 Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.)
06D50 Lattices and duality

Software:

Macaulay2

References:

[1] S. A.Andersson, D.Madigan, M. D.Perlman, and C. M.Triggs, On the relation between conditional independence models determined by finite distributive lattices and by directed acyclic graphs, J. Statist. Plann. Inference48 (1995), no. 1, 25-46. · Zbl 0839.62063
[2] S. A.Andersson and M. D.Perlman, Lattice models for conditional independence in a multivariate normal distribution, Ann. Statist.21 (1993), 1318-1358. · Zbl 0803.62042
[3] N.Beerenwinkel, N.Eriksson, and B.Sturmfels, Conjunctive Bayesian networks, Bernoulli13 (2007), 893-909. · Zbl 1129.62100
[4] P. E.Caines and H. P.Wynn, An algebraic framework for Bayes nets of time series, Modeling, estimation and control (A.Chiuso (ed.), S.Pinzoni (ed.), A.Ferrante (ed.), eds.), Springer, Berlin, 2007, pp. 45-57. · Zbl 1127.62075
[5] R.Castelo and A.Siebes, A characterization of moral transitive acyclic directed graph Markov models as labeled trees, J. Statist. Plann. Inference115 (2003), no. 1, 235-259. · Zbl 1045.62054
[6] V.Ene, J.Herzog, and F.Mohammadi, Monomial ideals and toric rings of Hibi type arising from a finite poset, Eur. J. Combin.32 (2011), no. 3, 404-421. · Zbl 1262.05154
[7] B.Giglio and H. P.Wynn, Monomial ideals and the Scarf complex for coherent systems in reliability theory, Ann. Statist.32 (2004), no. 3, 1289-1311. · Zbl 1105.90312
[8] D. R.Grayson and M. E.Stillman, Macaulay2, a software system for research in algebraic geometry. https://faculty.math.illinois.edu/Macaulay2/.
[9] J.Herzog and T.Hibi, Distributive lattices, bipartite graphs and Alexander duality, J. Algebraic Combin.22 (2005), no. 3, 289-302. · Zbl 1090.13017
[10] J.Herzog and T.Hibi, Monomial ideals, Springer, Berlin, 2011, pp. 3-22. · Zbl 1206.13001
[11] T.Hibi, Distributive lattices, affine semigroup rings and algebras with straightening laws, Commutative algebra and combinatorics, Mathematical Society of Japan, Tokyo, 1987, pp. 93-109. · Zbl 0654.13015
[12] M.Jozsa, M.Petreczky, and M. K.Camlibel, Causality and network graph in general bilinear state‐space representations, IEEE Trans. Automat. Control, IEEE, Piscataway, NJ, 2019, pp. 3623-3630. · Zbl 1533.93262
[13] D. A.Klain and G.‐C.Rota, Introduction to geometric probability, Cambridge University Press, Cambridge, 1997. · Zbl 0896.60004
[14] K. H.Knuth, Valuations on lattices and their application to information theory, IEEE Int. Conf. Fuzzy Syst. IEEE, Piscataway, NJ, 2006, pp. 217-224.
[15] J. P.Kung, G.‐C.Rota, and C. H.Yan, Combinatorics: the Rota way, Cambridge University Press, Cambridge, 2009. · Zbl 1159.05002
[16] S. L.Lauritzen, Graphical models, vol. 17, Clarendon Press, Oxford, 1996. · Zbl 0907.62001
[17] S. L.Lauritzen and D. J.Spiegelhalter, Local computations with probabilities on graphical structures and their application to expert systems, J. R. Stat. Soc.50 (1988), no. 2, 157-194. · Zbl 0684.68106
[18] H.Massam and E.Neher, Estimation and testing for lattice conditional independence models on Euclidean Jordan algebras, Ann. Statist.26 (1998), 1051-1082. · Zbl 0932.62067
[19] E.Miller and B.Sturmfels, Combinatorial commutative algebra, vol. 227, Springer Science & Business Media, Berlin, 2004.
[20] F.Mohammadi, E.Sáenz‐de Cabezón, and H. P.Wynn, The algebraic method in tree percolation, SIAM J. Discrete Math.30 (2016), no. 2, 1193-1212. · Zbl 1401.13039
[21] G.‐C.Rota, On the foundations of combinatorial theory I, Theory of Möbius functions, Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete2 (1964), no. 4, 340-368. · Zbl 0121.02406
[22] R. P.Stanley, Enumerative Combinatorics, vol. I, Wadsworth & Brooks/Cole, Monterey, CA, 1986. · Zbl 0608.05001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.