arXiv (All)
open access
Identifying maximal sets of significantly interacting nodes in higher-order networks
Filtering methods are fundamental tools for extracting the backbone of complex networks. Systems displaying group interactions, however, open the way to new types of filtering approaches. Here, we introduce a statistical filtering method for higher-order networks that identifies statistically valida
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
- Identifying maximal sets of significantly interacting nodes in higher-order networks#788586
- Thresholds and Fluctuations of Submultiplexes in Random Multiplex Networks#612877
- Thresholds and Fluctuations of Submultiplexes in Random Multiplex Networks#611400
- Topological Uncertainty and Higher-Order Interactions in Spatial Networks#1012625
- Message Order Selects Opposite Collective Opinions on Laplacian-Cospectral Networks#659261
Record · ID 792586
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