On the Persistence of Higher-Order Interactions in Real-World Hypergraphs
Hyunjin Choo, Kijung Shin

TL;DR
This paper investigates how higher-order interactions in real-world hypergraphs persist over time, analyzing patterns, key factors, and predictability across multiple domains to understand group relationship strength.
Contribution
It introduces a method to measure HOI persistence, analyzes global patterns and structural factors, and demonstrates strong predictability of persistence in real-world hypergraphs.
Findings
HOIs follow a power-law persistence pattern
16 structural features influence HOI persistence
Persistence can be accurately predicted using these features
Abstract
A hypergraph is a generalization of an ordinary graph, and it naturally represents group interactions as hyperedges (i.e., arbitrary-sized subsets of nodes). Such group interactions are ubiquitous in many domains: the sender and receivers of an email, the co-authors of a publication, and the items co-purchased by a customer, to name a few. A higher-order interaction (HOI) in a hypergraph is defined as the co-appearance of a set of nodes in any hyperedge. Our focus is the persistence of HOIs repeated over time, which is naturally interpreted as the strength of group relationships, aiming at answering three questions: (a) How do HOIs in real-world hypergraphs persist over time? (b) What are the key factors governing the persistence? (c) How accurately can we predict the persistence? In order to answer the questions above, we investigate the persistence of HOIs in 13 real-world…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Opinion Dynamics and Social Influence · Advanced Graph Neural Networks
