Hypergraph Dissimilarity Measures

Abstract

In this paper, we propose two novel approaches for hypergraph comparison. The first approach transforms the hypergraph into a graph representation for use of standard graph dissimilarity measures. The second approach exploits the mathematics of tensors to intrinsically capture multi-way relations. For each approach, we present measures that assess hypergraph dissimilarity at a specific scale or provide a more holistic multi-scale comparison. We test these measures on synthetic hypergraphs and apply them to biological datasets.

References in corpus (11)

• Emergence of scaling in random networks
• Graph Embedding Techniques, Applications, and Performance: A Survey
• Layer aggregation and reducibility of multilayer interconnected networks
• A Survey on Graph Kernels
• NetLSD: Hearing the Shape of a Graph
• NetSimile: A Scalable Approach to Size-Independent Network Similarity
• Spectra of general hypergraphs
• Multilinear Time Invariant System Theory
• Measures of Correlation for Multiple Variables
• Deep Hyperedges: a Framework for Transductive and Inductive Learning on Hypergraphs
• Higher-order Network Analysis Takes Off, Fueled by Classical Ideas and New Data