Koc University Digital Collections
metadata only
Analysis of push-type epidemic data dissemination in fully connected networks
Consider a fully connected network of nodes, some of which have a piece of data to be disseminated to the whole network. We analyze the following push-type epidemic algorithm: in each push round, every node that has the data, i.e., every infected node, randomly chooses c E Z. other nodes in the netw
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
- Network Behavioral-Feedback SIR Epidemic Model#677391
- Network Behavioral-Feedback SIR Epidemic Model#674194
- Stability of SIQS Epidemic Model with Behavioral Changes#403683
- On the intersection of pairs of trees#987405
- The maximum number of maximal dissociation sets in trees#625210
Record · ID 954728
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