Qualitative inequalities for squared partial correlations of a Gaussian random vector

From MaRDI portal
Publication:744000

DOI10.1007/S10463-013-0417-XzbMATH Open1336.62150arXiv1503.03879OpenAlexW3099742098MaRDI QIDQ744000FDOQ744000


Authors: Sanjay Chaudhuri Edit this on Wikidata


Publication date: 2 October 2014

Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

Abstract: We describe various sets of conditional independence relationships, sufficient for qualitatively comparing non-vanishing squared partial correlations of a Gaussian random vector. These sufficient conditions are satisfied by several graphical Markov models. Rules for comparing degree of association among the vertices of such Gaussian graphical models are also developed. We apply these rules to compare conditional dependencies on Gaussian trees. In particular for trees, we show that such dependence can be completely characterized by the length of the paths joining the dependent vertices to each other and to the vertices conditioned on. We also apply our results to postulate rules for model selection for polytree models. Our rules apply to mutual information of Gaussian random vectors as well.


Full work available at URL: https://arxiv.org/abs/1503.03879




Recommendations




Cites Work


Cited In (7)

Uses Software





This page was built for publication: Qualitative inequalities for squared partial correlations of a Gaussian random vector

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744000)