Higher-Order Networks Representation and Learning: A Survey
arXiv:2402.19414 · doi:10.1145/3682112.3682114
Abstract
Network data has become widespread, larger, and more complex over the years. Traditional network data is dyadic, capturing the relations among pairs of entities. With the need to model interactions among more than two entities, significant research has focused on higher-order networks and ways to represent, analyze, and learn from them. There are two main directions to studying higher-order networks. One direction has focused on capturing higher-order patterns in traditional (dyadic) graphs by changing the basic unit of study from nodes to small frequently observed subgraphs, called motifs. As most existing network data comes in the form of pairwise dyadic relationships, studying higher-order structures within such graphs may uncover new insights. The second direction aims to directly model higher-order interactions using new and more complex representations such as simplicial complexes or hypergraphs. Some of these models have long been proposed, but improvements in computational power and the advent of new computational techniques have increased their popularity. Our goal in this paper is to provide a succinct yet comprehensive summary of the advanced higher-order network analysis techniques. We provide a systematic review of its foundations and algorithms, along with use cases and applications of higher-order networks in various scientific domains.
25 pages
References in corpus (29)
- Multilayer Networks
- Stochastic blockmodels and community structure in networks
- Tensor Decomposition for Signal Processing and Machine Learning
- Higher-order organization of complex networks
- Random walks and diffusion on networks
- Simplicial Closure and higher-order link prediction
- Exact analytical solutions of the Susceptible-Infected-Recovered (SIR) epidemic model and of the SIR model with equal death and birth rates
- Clique topology reveals intrinsic geometric structure in neural correlations
- Explosive higher-order Kuramoto dynamics on simplicial complexes
- Ripser: efficient computation of Vietoris-Rips persistence barcodes
- Representing higher-order dependencies in networks
- Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes
- TensorLy: Tensor Learning in Python
- HyperGCN: A New Method of Training Graph Convolutional Networks on Hypergraphs
- Signal Processing on Higher-Order Networks: Livin' on the Edge ... and Beyond
- Coupled Dynamics on Hypergraphs: Master Stability of Steady States and Synchronization
- Higher-order clustering in networks
- Tensor Spectral Clustering for Partitioning Higher-order Network Structures
- Session-based Recommendation with Hypergraph Attention Networks
- Construction of and efficient sampling from the simplicial configuration model
- Hypergraph Motifs: Concepts, Algorithms, and Discoveries
- Structural Patterns and Generative Models of Real-world Hypergraphs
- Two's company, three (or more) is a simplex: Algebraic-topological tools for understanding higher-order structure in neural data
- Self-Supervised Multi-Channel Hypergraph Convolutional Network for Social Recommendation
- Topological Deep Learning: Going Beyond Graph Data
- HONE: Higher-Order Network Embeddings
- Understanding Complex Systems: From Networks to Optimal Higher-Order Models
- How Do Hyperedges Overlap in Real-World Hypergraphs? -- Patterns, Measures, and Generators
- A Survey on Hypergraph Mining: Patterns, Tools, and Generators