Estimating Undirected Graphs Under Weak Assumptions

Abstract

We consider the problem of providing nonparametric confidence guarantees for undirected graphs under weak assumptions. In particular, we do not assume sparsity, incoherence or Normality. We allow the dimension $D$ to increase with the sample size $n$. First, we prove lower bounds that show that if we want accurate inferences with low assumptions then there are limitations on the dimension as a function of sample size. When the dimension increases slowly with sample size, we show that methods based on Normal approximations and on the bootstrap lead to valid inferences and we provide Berry-Esseen bounds on the accuracy of the Normal approximation. When the dimension is large relative to sample size, accurate inferences for graphs under low assumptions are not possible. Instead we propose to estimate something less demanding than the entire partial correlation graph. In particular, we consider: cluster graphs, restricted partial correlation graphs and correlation graphs.

References in corpus (1)

• PC algorithm for Gaussian copula graphical models

Cited by in corpus (6)

• Minimax Optimal Convergence Rates for Estimating Ground Truth from Crowdsourced Labels
• Local and Global Inference for High Dimensional Nonparanormal Graphical Models
• Two Sample Inference for Populations of Graphical Models with Applications to Functional Connectivity
• Discussion: "A significance test for the lasso"
• On the use of bootstrap with variational inference: Theory, interpretation, and a two-sample test example
• The neighborhood lattice for encoding partial correlations in a Hilbert space