DeepAI AI Chat
Log In Sign Up

Marginalizing in Undirected Graph and Hypergraph Models

by   Enrique F. Castillo, et al.

Given an undirected graph G or hypergraph X model for a given set of variables V, we introduce two marginalization operators for obtaining the undirected graph GA or hypergraph HA associated with a given subset A c V such that the marginal distribution of A factorizes according to GA or HA, respectively. Finally, we illustrate the method by its application to some practical examples. With them we show that hypergraph models allow defining a finer factorization or performing a more precise conditional independence analysis than undirected graph models.


page 1

page 2

page 3

page 4


Hypergraph Convolutional Networks via Equivalency between Hypergraphs and Undirected Graphs

As a powerful tool for modeling complex relationships, hypergraphs are g...

Nearly Tight Spectral Sparsification of Directed Hypergraphs by a Simple Iterative Sampling Algorithm

Spectral hypergraph sparsification, which is an attempt to extend well-k...

Learning Hypergraph Labeling for Feature Matching

This study poses the feature correspondence problem as a hypergraph node...

Learning binary undirected graph in low dimensional regime

Given a random sample extracted from a Multivariate Bernoulli Variable (...

Automorphism Shuffles for Graphs and Hypergraphs and Its Applications

In card-based cryptography, a deck of physical cards is used to achieve ...

Hypergraph Clustering: A Modularity Maximization Approach

Clustering on hypergraphs has been garnering increased attention with po...