Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey
By: Inés García-Redondo , Claudia Landi , Sarah Percival and more
Potential Business Impact:
Simplifies complex networks by finding their essential parts.
In this survey, we explore recent literature on finding the cores of higher graphs using geometric and topological means. We study graphs, hypergraphs, and simplicial complexes, all of which are models of higher graphs. We study the notion of a core, which is a minimalist representation of a higher graph that retains its geometric or topological information. We focus on geometric and topological methods based on discrete curvatures, effective resistance, and persistent homology. We aim to connect tools from graph theory, discrete geometry, and computational topology to inspire new research on the simplification of higher graphs.
Similar Papers
On Computational Aspects of Cores of Ordered Graphs
Computational Complexity
Finds simplest version of connected data.
On core of categorical product of (di)graphs
Combinatorics
Makes computer graphs simpler for databases.
A roadmap for curvature-based geometric data analysis and learning
Machine Learning (CS)
Helps computers understand shapes in data better.