arXiv (All)
open access
Simplicial closure fragments the explosive cooperation transitions in higher-order public goods games
Hypergraph (HG) and simplicial complex (SC) are two common representations of higher-order networks, and are often expected to differ mainly quantitatively when they encode comparable group interactions. Here we show that this expectation fails in evolutionary cooperation dynamics. Using a controlle
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
- Graph Defense Diffusion Model#131281
- The logic of collective action#1253626
- Spectral Erdős--Gallai Theorems for the \(\mathcal A_α\)-Tensor of the \(s\)-Clique Hypergraph#1218397
- Factoring Out the Impossibility of Logical Aggregation#754629
- $Δ$-Y Moves and Partial Steiner Systems#986582
Record · ID 1233950
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