Filtering higher-order datasets
arXiv:2305.06910 · doi:10.1088/2632-072X/ad253a
Abstract
Many complex systems often contain interactions between more than two nodes, known as higher-order interactions, which can change the structure of these systems in significant ways. Researchers often assume that all interactions paint a consistent picture of a higher-order dataset's structure. In contrast, the connection patterns of individuals or entities in empirical systems are often stratified by interaction size. Ignoring this fact can aggregate connection patterns that exist only at certain scales of interaction. To isolate these scale-dependent patterns, we present an approach for analyzing higher-order datasets by filtering interactions by their size. We apply this framework to several empirical datasets from three domains to demonstrate that data practitioners can gain valuable information from this approach.
22 pages, 17 figures
References in corpus (8)
- Modularity and community structure in networks
- Quantifying social group evolution
- Extracting the multiscale backbone of complex weighted networks
- An information-theoretic framework for resolving community structure in complex networks
- The Rich-Club Phenomenon In The Internet Topology
- Modeling the Multi-layer Nature of the European Air Transport Network: Resilience and Passengers Re-scheduling under random failures
- Balanced Hodge Laplacians Optimize Consensus Dynamics over Simplicial Complexes
- On limitations of uniplex networks for modeling multiplex contagion