High-dimensional Gaussian graphical model for network-linked data
arXiv:1907.02443
Abstract
Graphical models are commonly used to represent conditional dependence relationships between variables. There are multiple methods available for exploring them from high-dimensional data, but almost all of them rely on the assumption that the observations are independent and identically distributed. At the same time, observations connected by a network are becoming increasingly common, and tend to violate these assumptions. Here we develop a Gaussian graphical model for observations connected by a network with potentially different mean vectors, varying smoothly over the network. We propose an efficient estimation algorithm and demonstrate its effectiveness on both simulated and real data, obtaining meaningful and interpretable results on a statistics coauthorship network. We also prove that our method estimates both the inverse covariance matrix and the corresponding graph structure correctly under the assumption of network “cohesionâ€, which refers to the empirically observed phenomenon of network neighbors sharing similar traits.
References in corpus (11)
- Homophily and Contagion Are Generically Confounded in Observational Social Network Studies
- The huge Package for High-dimensional Undirected Graph Estimation in R
- Network Lasso: Clustering and Optimization in Large Graphs
- Asymptotic normality and optimalities in estimation of large Gaussian graphical models
- A sparse conditional Gaussian graphical model for analysis of genetical genomics data
- Variable selection and regression analysis for graph-structured covariates with an application to genomics
- Coauthorship and Citation Networks for Statisticians
- Covariate-assisted spectral clustering
- Trend Filtering on Graphs
- Penalized Maximum Likelihood Estimation of Multi-layered Gaussian Graphical Models
- Hierarchical community detection by recursive partitioning