arXiv (All)
open access
Connected components in networks with higher-order interactions
We address the problem of defining connected components in hypergraphs, which are models for systems with higher-order interactions. For graphs with dyadic interactions, connected components are defined in terms of paths connecting nodes along the graph. However, defining connected components in hyp
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
- A Cheeger Inequality for Hypergraphs and Its Applications#1110652
- When Shall We $k$ Meet Again? Tight Algorithms for Diameter and Radius under the Meet Distance#1037252
- Information geometry of perturbed gradient flow systems on hypergraphs: A perspective towards nonequilibrium physics#1052040
- Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra#1013488
- Forbidden Subgraphs of Graphs with Low Bandwidth#822364
Record · ID 1400739
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