Understanding high-order network structure using permissible walks on attributed hypergraphs
- 6 May 2025
- journal article
- Published by Oxford University Press (OUP) in Journal of Complex Networks
- Vol. 13 (3)
Abstract
Hypergraphs have been a recent focus of study in mathematical data science as a tool to understand complex networks with high-order connections. One question of particular relevance—how to leverage information carried in hypergraph attributions when doing walk-based techniques. In this work, we focus on a new generalization of a walk in a network that recovers previous approaches and allows for a description of permissible walks in hypergraphs. Permissible walk graphs are constructed by intersecting the attributed s-line graph of a hypergraph with a relation respecting graph. The attribution of the hypergraph’s line graph commonly carries over information from categorical and temporal attributions of the original hypergraph. To demonstrate this approach on a temporally attributed example, we apply our framework to a Reddit data set composed of hyperedges as threads and authors as nodes where post times are tracked.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Attributed Stream Hypergraphs: temporal modeling of node-attributed high-order interactionsApplied Network Science, 2023
- Random walks and community detection in hypergraphsJournal of Physics: Complexity, 2021
- On the spectrum of hypergraphsLinear Algebra and its Applications, 2021
- Random walks on hypergraphsPhysical Review E, 2020
- Modeling the Transmission of Infectious Disease in a Dynamic NetworkJournal of Physics: Conference Series, 2019
- Interval-Valued Rank in Finite Ordered SetsOrder, 2016
- Temporal networksPhysics Reports, 2012
- Spectra of uniform hypergraphsLinear Algebra and its Applications, 2012
- A dynamic model of social network formationProceedings of the National Academy of Sciences, 2000
- Ontologies: principles, methods and applicationsThe Knowledge Engineering Review, 1996