OpenAlex
metadata only
CC BY 4.0
Hypernetwork science via high-order hypergraph walks
Abstract We propose high-order hypergraph walks as a framework to generalize graph-based network science techniques to hypergraphs. Edge incidence in hypergraphs is quantitative, yielding hypergraph walks with both length and width. Graph methods which then generalize to hypergraphs include connecte
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
- Safe Hypergraph Contraction via Capacity-Aware Repair Certificates#1156949
- Maximum-Entropy Random Walks on Hypergraphs#985016
- Scalable Approximate Algorithm for Dynamic Densest Subhypergraphs with Solution-Guided Maintenance#1169674
- Scalable Approximate Algorithm for Dynamic Densest Subhypergraphs with Solution-Guided Maintenance#1144945
- Higher-order rich clubs and configuration models on general directed hypergraphs#822063
Record · ID 1159452
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