{"title":"复杂高斯图形模型选择的边缘排除检验","authors":"Jitendra Tugnait","doi":"10.1109/SSP.2018.8450845","DOIUrl":null,"url":null,"abstract":"We consider the problem of inferring the conditional independence graph (CIG) of complex-valued multivariate Gaussian vectors. A p-variate complex Gaussian graphical model (CGGM) associated with an undirected graph with p vertices is defined as the family of complex Gaussian distributions that obey the conditional independence restrictions implied by the edge set of the graph. For real random vectors, considerable body of work exists where one first tests for exclusion of each edge from the saturated model, and then infers the CIG. Much less attention has been paid to CGGMs. In this paper, we propose and analyze a generalized likelihood ratio test based edge exclusion test statistic for CGGMs. The test statistic is expressed in an alternative form compared to an existing result, where the alternative expression is in a form usually given and exploited for real GGMs. The computational complexity of the proposed statistic is $\\mathcal {O}(p^{3})$ compared to $\\mathcal {O}(p^{5})$ for the existing result.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An Edge Exclusion Test for Complex Gaussian Graphical Model Selection\",\"authors\":\"Jitendra Tugnait\",\"doi\":\"10.1109/SSP.2018.8450845\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problem of inferring the conditional independence graph (CIG) of complex-valued multivariate Gaussian vectors. A p-variate complex Gaussian graphical model (CGGM) associated with an undirected graph with p vertices is defined as the family of complex Gaussian distributions that obey the conditional independence restrictions implied by the edge set of the graph. For real random vectors, considerable body of work exists where one first tests for exclusion of each edge from the saturated model, and then infers the CIG. Much less attention has been paid to CGGMs. In this paper, we propose and analyze a generalized likelihood ratio test based edge exclusion test statistic for CGGMs. The test statistic is expressed in an alternative form compared to an existing result, where the alternative expression is in a form usually given and exploited for real GGMs. The computational complexity of the proposed statistic is $\\\\mathcal {O}(p^{3})$ compared to $\\\\mathcal {O}(p^{5})$ for the existing result.\",\"PeriodicalId\":330528,\"journal\":{\"name\":\"2018 IEEE Statistical Signal Processing Workshop (SSP)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Statistical Signal Processing Workshop (SSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSP.2018.8450845\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Statistical Signal Processing Workshop (SSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSP.2018.8450845","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Edge Exclusion Test for Complex Gaussian Graphical Model Selection
We consider the problem of inferring the conditional independence graph (CIG) of complex-valued multivariate Gaussian vectors. A p-variate complex Gaussian graphical model (CGGM) associated with an undirected graph with p vertices is defined as the family of complex Gaussian distributions that obey the conditional independence restrictions implied by the edge set of the graph. For real random vectors, considerable body of work exists where one first tests for exclusion of each edge from the saturated model, and then infers the CIG. Much less attention has been paid to CGGMs. In this paper, we propose and analyze a generalized likelihood ratio test based edge exclusion test statistic for CGGMs. The test statistic is expressed in an alternative form compared to an existing result, where the alternative expression is in a form usually given and exploited for real GGMs. The computational complexity of the proposed statistic is $\mathcal {O}(p^{3})$ compared to $\mathcal {O}(p^{5})$ for the existing result.