Gemini: graph estimation with matrix variate normal instances

From MaRDI portal
Publication:2249840

DOI10.1214/13-AOS1187zbMATH Open1301.62054arXiv1209.5075MaRDI QIDQ2249840FDOQ2249840


Authors: Shuheng Zhou Edit this on Wikidata


Publication date: 3 July 2014

Published in: The Annals of Statistics (Search for Journal in Brave)

Abstract: Undirected graphs can be used to describe matrix variate distributions. In this paper, we develop new methods for estimating the graphical structures and underlying parameters, namely, the row and column covariance and inverse covariance matrices from the matrix variate data. Under sparsity conditions, we show that one is able to recover the graphs and covariance matrices with a single random matrix from the matrix variate normal distribution. Our method extends, with suitable adaptation, to the general setting where replicates are available. We establish consistency and obtain the rates of convergence in the operator and the Frobenius norm. We show that having replicates will allow one to estimate more complicated graphical structures and achieve faster rates of convergence. We provide simulation evidence showing that we can recover graphical structures as well as estimating the precision matrices, as predicted by theory.


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




Recommendations




Cites Work


Cited In (32)

Uses Software





This page was built for publication: Gemini: graph estimation with matrix variate normal instances

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