Simplicial Gaussian Models: Representation and Inference
By: Lorenzo Marinucci , Gabriele D'Acunto , Paolo Di Lorenzo and more
Potential Business Impact:
Models complex connections in data, not just pairs.
Probabilistic graphical models (PGMs) are powerful tools for representing statistical dependencies through graphs in high-dimensional systems. However, they are limited to pairwise interactions. In this work, we propose the simplicial Gaussian model (SGM), which extends Gaussian PGM to simplicial complexes. SGM jointly models random variables supported on vertices, edges, and triangles, within a single parametrized Gaussian distribution. Our model builds upon discrete Hodge theory and incorporates uncertainty at every topological level through independent random components. Motivated by applications, we focus on the marginal edge-level distribution while treating node- and triangle-level variables as latent. We then develop a maximum-likelihood inference algorithm to recover the parameters of the full SGM and the induced conditional dependence structure. Numerical experiments on synthetic simplicial complexes with varying size and sparsity confirm the effectiveness of our algorithm.
Similar Papers
Sparse Probabilistic Graph Circuits
Machine Learning (CS)
Builds better drugs by understanding molecule connections.
Bayesian computation for high-dimensional Gaussian Graphical Models with spike-and-slab priors
Methodology
Find hidden connections in lots of data faster.
Colored Markov Random Fields for Probabilistic Topological Modeling
Machine Learning (Stat)
Models complex connections using colored links.