Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Open Access
  • Access by Xinjiang University

Relating balance and conditional independence in graphical models

Alberto Zenere, Erik G. Larsson, and Claudio Altafini*

  • Department of Electrical Engineering, Linköping University, SE-58183 Linköping, Sweden

  • *Corresponding author: claudio.altafini@liu.se

Phys. Rev. E 106, 044309 – Published 28 October, 2022

DOI: https://doi.org/10.1103/PhysRevE.106.044309

Abstract

When data are available for all nodes of a Gaussian graphical model, then, it is possible to use sample correlations and partial correlations to test to what extent the conditional independencies that encode the structure of the model are indeed verified by the data. In this paper, we give a heuristic rule useful in such a validation process: When the correlation subgraph involved in a conditional independence is balanced (i.e., all its cycles have an even number of negative edges), then a partial correlation is usually a contraction of the corresponding correlation, which often leads to conditional independence. In particular, the contraction rule can be made rigorous if we look at concentration subgraphs rather than correlation subgraphs. The rule is applied to real data for elementary gene regulatory motifs.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (31)

  1. R. G. Cowell, P. Dawid, S. L. Lauritzen, and D. J. Spiegelhalter, Probabilistic Networks and Expert Systems: Exact Computational Methods for Bayesian Networks, Information Science and Statistics (Springer, New York, 2003).
  2. S. Epskamp, D. Borsboom, and E. I. Fried, Estimating psychological networks and their accuracy: A tutorial paper, Behav. Res. Methods 50, 195 (2018).
  3. N. Friedman, Inferring cellular networks using probabilistic graphical models, Science 303, 799 (2004).
  4. D. Koller and N. Friedman, Probabilistic Graphical Models: Principles and Techniques, Adaptive computation and machine learning (MIT Press, Cambridge, MA, 2009).
  5. O. Pourret, P. Naïm, and B. Marcot, Bayesian Networks: A Practical Guide to Applications, Statistics in Practice (Wiley, Hoboken, NJ, 2008).
  6. D. R. Williams, Bayesian estimation for gaussian graphical models: Structure learning, predictability, and network comparisons, Multivar. Behav. Res. 56, 336 (2021).
  7. S. L. Lauritzen, Graphical Models, Oxford Statistical Science Series (Clarendon, Oxford, 1996).
  8. M. Slawski and M. Hein, Estimation of positive definite M-matrices and structure learning for attractive Gaussian markov random fields, Linear Algebra Appl. 473, 145 (2015).
  9. O. Banerjee, L. El Ghaoui, and A. d'Aspremont, Model selection through sparse maximum likelihood estimation for multivariate gaussian or binary data, J. Mach. Learn. Res. 9, 485 (2008).
  10. J. Engel, L. Buydens, and L. Blanchet, An overview of large-dimensional covariance and precision matrix estimators with applications in chemometrics, J. Chemom. 31, e2880 (2017).
  11. J. Friedman, T. Hastie, and R. Tibshirani, Sparse inverse covariance estimation with the graphical lasso, Biostatistics 9, 432 (2008).
  12. N. Meinshausen and P. Bühlmann, High-dimensional graphs and variable selection with the Lasso, Ann. Stat. 34, 1436 (2006).
  13. J. Peng, P. Wang, N. Zhou, and J. Zhu, Partial correlation estimation by joint sparse regression models, J. Am. Stat. Assoc. 104, 735 (2009).
  14. M. Scanagatta, A. Salmeron, and F. Stella, A survey on bayesian network structure learning from data, Prog. Artif. Intell. 8, 425 (2019).
  15. M. Kalisch and P. Bühlmann, Estimating high-dimensional directed acyclic graphs with the PC-algorithm, J. Mach. Learn. Res. 8, 613 (2007).
  16. F. Harary, On the measurement of structural balance, Behav. Sci. 4, 316 (1959).
  17. J. A. Davis, Clustering and structural balance in graphs, Hum. Relat. 20, 181 (1967).
  18. G. Facchetti, G. Iacono, and C. Altafini, Computing global structural balance in large-scale signed social networks, Proc. Natl. Acad. Sci. USA 108, 20953 (2011).
  19. M. Mezard, G. Parisi, and M. Virasoro, Spin Glass Theory and Beyond (World Scientific, Singapore, 1986).
  20. M. Mezard and A. Montanari, Information, Physics, and Computation (Oxford University Press, New York, 2009).
  21. D. M. Malioutov, J. K. Johnson, and A. S. Willsky, Walk-sums and belief propagation in gaussian graphical models, J. Mach. Learn. Res. 7, 2031 (2006).
  22. S. Karlin and Y. Rinott, Classes of orderings of measures and related correlation inequalities. I. multivariate totally positive distributions, J. Multivariate Anal. 10, 467 (1980).
  23. S. Lauritzen, C. Uhler, and P. Zwiernik, Maximum likelihood estimation in Gaussian models under total positivity, Ann. Statist. 47, 1835 (2019).
  24. S. Karlin and Y. Rinott, M-matrices as covariance matrices of multinormal distributions, Linear Algebra Appl. 52-53, 419 (1983).
  25. A. Zenere, O. Rundquist, M. Gustafsson, and C. Altafini, Using high-throughput multi-omics data to investigate structural balance in elementary gene regulatory network motifs, Bioinformatics 38, 173 (2022).
  26. A. Zenere, O. Rundquist, M. Gustafsson, and C. Altafini, Multi-omics protein-coding units as massively parallel Bayesian networks, iScience 25, 104048 (2022).
  27. C. M. Bishop, Pattern recognition and machine learning, Information science and statistics (Springer, New York, NY, 2006).
  28. T. W. Anderson, An Introduction to Multivariate Statistical Analysis, Wiley Series in Probability and Statistics (Wiley, Hoboken, NJ, 2003).
  29. T. M. Cover and J. A. Thomas, Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing) (Wiley-Interscience, Hoboken, NJ, 2006).
  30. R. G. Gallager, Low-Density Parity-Check Codes (MIT Press, Cambridge, MA, 1963).
  31. S. Mangan and U. Alon, Structure and function of the feed-forward loop network motif, Proc. Natl. Acad. Sci. USA 100, 11980 (2003).

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation