On Graphical Models and Convex Geometry

06/27/2021
by   Haim Bar, et al.
0

We introduce a mixture-model of beta distributions to identify significant correlations among P predictors when P is large. The method relies on theorems in convex geometry, which we use to show how to control the error rate of edge detection in graphical models. Our `betaMix' method does not require any assumptions about the network structure, nor does it assume that the network is sparse. The results in this article hold for a wide class of data generating distributions that include light-tailed and heavy-tailed spherically symmetric distributions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/17/2013

On Graphical Models via Univariate Exponential Family Distributions

Undirected graphical models, or Markov networks, are a popular class of ...
research
06/04/2017

Graphical Nonconvex Optimization for Optimal Estimation in Gaussian Graphical Models

We consider the problem of learning high-dimensional Gaussian graphical ...
research
09/29/2022

Max-linear graphical models with heavy-tailed factors on trees of transitive tournaments

Graphical models with heavy-tailed factors can be used to model extremal...
research
06/18/2021

α-Stable convergence of heavy-tailed infinitely-wide neural networks

We consider infinitely-wide multi-layer perceptrons (MLPs) which are lim...
research
07/18/2021

A Universal Lossless Compression Method applicable to Sparse Graphs and Heavy-Tailed Sparse Graphs

Graphical data arises naturally in several modern applications, includin...
research
06/03/2020

Classifying histograms of medical data using information geometry of beta distributions

In this paper, we use tools of information geometry to compare, average ...
research
10/19/2017

The Geometry of Gaussoids

A gaussoid is a combinatorial structure that encodes independence in pro...

Please sign up or login with your details

Forgot password? Click here to reset