arXiv (All)
open access
Scalable detection of higher-order interactions in network data
Complex systems are routinely measured and represented through pairwise networks, even when the underlying interactions involve more than two units at once. Recovering this latent hypergraph structure from pairwise measurements is a fundamental inverse problem, but as the space of candidate hyperedg
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Hypernetwork science via high-order hypergraph walks#1159452
- Motifs in temporal hypergraphs#1000141
- Maximum-Entropy Random Walks on Hypergraphs#985016
- Higher-order rich clubs and configuration models on general directed hypergraphs#822063
- Scalable Approximate Algorithm for Dynamic Densest Subhypergraphs with Solution-Guided Maintenance#1169674
Record · ID 1118708
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive