Efficient Computation of High-Order Line Graphs of Hypergraphs

by   Jesun Firoz, et al.

This paper considers structures of systems beyond dyadic (pairwise) interactions and investigates mathematical modeling of multi-way interactions and connections as hypergraphs, where captured relationships among system entities are set-valued. To date, in most situations, entities in a hypergraph are considered connected as long as there is at least one common "neighbor". However, minimal commonality sometimes discards the "strength" of connections and interactions among groups. To this end, considering the "width" of a connection, referred to as the s-overlap of neighbors, provides more meaningful insights into how closely the communities or entities interact with each other. In addition, s-overlap computation is the fundamental kernel to construct the line graph of a hypergraph, a low-order approximation which can carry significant information about the original hypergraph. Subsequent stages of a data analytics pipeline then can apply highly-tuned graph algorithms on the line graph to reveal important features. Given a hypergraph, computing the s-overlaps by exhaustively considering all pairwise entities can be computationally prohibitive. To tackle this challenge, we develop efficient algorithms to compute s-overlaps and the corresponding line graph of a hypergraph. We propose several heuristics to avoid execution of redundant work and improve performance of the s-overlap computation. Our parallel algorithm, combined with these heuristics, demonstrates better performance.


Learning over Families of Sets – Hypergraph Representation Learning for Higher Order Tasks

Graph representation learning has made major strides over the past decad...

Hypergraph Isomorphism Computation

The isomorphism problem is a fundamental problem in network analysis, wh...

Hypergraph Modeling via Spectral Embedding Connection: Hypergraph Cut, Weighted Kernel k-means, and Heat Kernel

We propose a theoretical framework of multi-way similarity to model real...

Hypergraph Learning with Line Expansion

Previous hypergraph expansions are solely carried out on either vertex l...

Regularized Recovery by Multi-order Partial Hypergraph Total Variation

Capturing complex high-order interactions among data is an important tas...

High-order Line Graphs of Non-uniform Hypergraphs: Algorithms, Applications, and Experimental Analysis

Hypergraphs offer flexible and robust data representations for many appl...

On the convergence of nonlinear averaging dynamics with three-body interactions on hypergraphs

Complex networked systems in fields such as physics, biology, and social...

Please sign up or login with your details

Forgot password? Click here to reset