{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:42:35Z","timestamp":1760150555008,"version":"build-2065373602"},"reference-count":28,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T00:00:00Z","timestamp":1701993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>This paper investigates the capability of undirected graphs (UGs) to represent a set of Conditional Independence (CI) statements derived from a given probability distribution of a random vector. While it is established that certain axioms can govern this set, providing sufficient conditions for UGs to capture specific CI statements, our focus is on covariance and concentration graphs. These remain the only known families of UGs capable of describing CI statements. We explore the issue of complete representation of CI statements through their corresponding covariance and concentration graphs. Two parameters are defined, one each from the covariance and concentration graphs, to determine the limitations concerning the cardinality of the conditioning subset that the graph can represent. We establish a relationship between these parameters and the cardinality of the separators in each graph, providing a straightforward computational method to evaluate them. In conclusion, we enhance the aforementioned procedure and introduce criteria to ascertain, without additional computations, whether the graphs can fully represent a given set of CI statements. We demonstrate that either the concentration or the covariance graph forms a cycle, and when considered in conjunction, they can represent the entire relation. These criteria also enable us, in specific cases, to deduce the covariance graph from the concentration graph and vice versa.<\/jats:p>","DOI":"10.3390\/axioms12121109","type":"journal-article","created":{"date-parts":[[2023,12,11]],"date-time":"2023-12-11T03:25:31Z","timestamp":1702265131000},"page":"1109","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Describing Conditional Independence Statements Using Undirected Graphs"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0494-7141","authenticated-orcid":false,"given":"Dhafer","family":"Malouche","sequence":"first","affiliation":[{"name":"Statistics Program, Department of Mathematics, Statistics and Physics, College of Arts and Sciences, Qatar University, Doha 2713, Qatar"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,12,8]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1376","DOI":"10.3390\/e16031376","article-title":"Bayesian Test of Significance for Conditional Independence: The Multinomial Model","volume":"16","author":"Stern","year":"2014","journal-title":"Entropy"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Markowetz, F., and Spang, R. (2007). Inferring Cellular Networks\u2014A Review. BMC Bioinform., 8.","DOI":"10.1186\/1471-2105-8-S6-S5"},{"key":"ref_3","unstructured":"Shen, X., Zhu, S., Zhang, J., Hu, S., and Chen, Z. (2022). Reframed GES with a Neural Conditional Dependence Measure. arXiv."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1111\/j.1467-842X.2012.00662.x","article-title":"Estimating Bayesian Networks for High-dimensional Data With Complex Mean Structure and Random Effects","volume":"54","author":"Kasza","year":"2012","journal-title":"Aust. New Zealand J. Stat."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1089\/106652700750050961","article-title":"Using Bayesian Networks to Analyze Expression Data","volume":"7","author":"Friedman","year":"2000","journal-title":"J. Comput. Biol."},{"key":"ref_6","unstructured":"Kratzer, G., and Furrer, R. (2018). Information-Theoretic Scoring Rules to Learn Additive Bayesian Network Applied to Epidemiology. arXiv."},{"key":"ref_7","unstructured":"Fathony, R., Rezaei, A., Bashiri, M.A., Zhang, X., and Ziebart, B.D. (2018). Distributionally Robust Graphical Models. arXiv."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Xie, Y., Li, S., Wu, C., Lai, Z., and Su, M. (2022). A novel hypergraph convolution network for wafer defect patterns identification based on an unbalanced dataset. J. Intell. Manuf., 1\u201314.","DOI":"10.1007\/s10845-022-02067-z"},{"key":"ref_9","unstructured":"Whittaker, J. (1990). Graphical Models in Applied Multivariate Statistics, Wiley."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Lauritzen, S.L. (1996). Graphical Models, Oxford University Press.","DOI":"10.1093\/oso\/9780198522195.001.0001"},{"key":"ref_11","unstructured":"Studen\u1ef3, M. (2004). Probabilistic Conditional Independence Structures, Springer."},{"key":"ref_12","unstructured":"Diestel, R. (2005). Graph Theory, Springer. [3rd ed.]. Graduate Texts in Mathematics."},{"key":"ref_13","first-page":"357","article-title":"Graphoids: A graph based logic for reasoning about relevancy relations","volume":"2","author":"Pear","year":"1987","journal-title":"Adv. Artif. Intell."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"745","DOI":"10.2307\/3214910","article-title":"On equivalence of Markov proerties over undirected graphs","volume":"29","year":"1992","journal-title":"J. Appl. Probab."},{"key":"ref_15","first-page":"105","article-title":"On a dualization of graphical Gaussian models","volume":"23","author":"Kauermann","year":"1996","journal-title":"Scand. J. Stat."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1111\/1467-9469.00366","article-title":"On a Dualization of Graphical Gaussian Models: A Correction Note","volume":"30","author":"Banerjee","year":"2003","journal-title":"Scand. J. Stat."},{"key":"ref_17","first-page":"1071","article-title":"An Algorithm for Reading Dependencies from the Minimal Undirected Independence Map of a Graphoid that Satisfies Weak Transitivity","volume":"10","author":"Nilsson","year":"2009","journal-title":"J. Mach. Learn."},{"key":"ref_18","first-page":"495","article-title":"Implication of faithfulness assumption","volume":"84","author":"Malouche","year":"2022","journal-title":"Sankhy\u0101 B Indian J. Stat."},{"key":"ref_19","first-page":"231","article-title":"Perfect Tree-like Markovian Distributions","volume":"25","author":"Becker","year":"2005","journal-title":"Probab. Math. Stat."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Malouche, D., and Rajaratnam, B. (2011). Gaussian covariance faithful markov trees. J. Probab. Stat., 2011.","DOI":"10.1155\/2011\/152942"},{"key":"ref_21","first-page":"327","article-title":"On Gaussian Conditional Independence Structures","volume":"43","year":"2007","journal-title":"Kybernetika"},{"key":"ref_22","first-page":"1179","article-title":"Determining full conditional independence by low order conditioning","volume":"15","author":"Malouche","year":"2009","journal-title":"Bernoulli J."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","article-title":"Zur allgemeinen kurventheorie","volume":"10","author":"Menger","year":"1972","journal-title":"Fund. Math."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF01894783","article-title":"A remark on Menger\u2019s theorem","volume":"21","year":"1970","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/jgt.3190020309","article-title":"A new proof of Menger\u2019s theorem","volume":"2","year":"1978","journal-title":"J. Graph Theory"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1002\/jgt.3190080311","article-title":"A simple proof of Menger\u2019s theorem","volume":"8","author":"McCuaig","year":"1984","journal-title":"J. Graph Theory"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"2001","DOI":"10.1214\/aos\/1176349407","article-title":"Logical and algorithmic properties of conditional independence and graphical models","volume":"21","author":"Geiger","year":"1993","journal-title":"Ann. Stat."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2202\/1544-6115.1170","article-title":"Low-Order Conditional Independence Graphs for Inferring Genetic Network","volume":"5","author":"Wille","year":"2006","journal-title":"Stat. Appl. Genet. Mol. Biol."}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/12\/12\/1109\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:35:49Z","timestamp":1760132149000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/12\/12\/1109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,8]]},"references-count":28,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["axioms12121109"],"URL":"https:\/\/doi.org\/10.3390\/axioms12121109","relation":{},"ISSN":["2075-1680"],"issn-type":[{"type":"electronic","value":"2075-1680"}],"subject":[],"published":{"date-parts":[[2023,12,8]]}}}