Topological Simplifications of Hypergraphs

04/22/2021
by   Youjia Zhou, et al.
0

We study hypergraph visualization via its topological simplification. We explore both vertex simplification and hyperedge simplification of hypergraphs using tools from topological data analysis. In particular, we transform a hypergraph to its graph representations known as the line graph and clique expansion. A topological simplification of such a graph representation induces a simplification of the hypergraph. In simplifying a hypergraph, we allow vertices to be combined if they belong to almost the same set of hyperedges, and hyperedges to be merged if they share almost the same set of vertices. Our proposed approaches are general, mathematically justifiable, and they put vertex simplification and hyperedge simplification in a unifying framework.

READ FULL TEXT

page 2

page 6

page 7

page 9

page 10

page 11

page 14

research
05/11/2020

Hypergraph Learning with Line Expansion

Previous hypergraph expansions are solely carried out on either vertex l...
research
08/09/2023

Scalable Hypergraph Visualization

Hypergraph visualization has many applications in network data analysis....
research
02/06/2023

Topological Analysis of Temporal Hypergraphs

In this work we study the topological properties of temporal hypergraphs...
research
03/20/2023

Seven open problems in applied combinatorics

We present and discuss seven different open problems in applied combinat...
research
08/21/2020

MetroSets: Visualizing Sets as Metro Maps

We propose MetroSets, a new, flexible online tool for visualizing set sy...
research
11/26/2021

Hypergraph Representation via Axis-Aligned Point-Subspace Cover

We propose a new representation of k-partite, k-uniform hypergraphs (i.e...
research
02/28/2022

Entropic Hyper-Connectomes Computation and Analysis

Brain function and connectivity is a pressing mystery in medicine relate...

Please sign up or login with your details

Forgot password? Click here to reset