arXiv (All)
open access
Competing bootstrap processes on the random graph $G(n,p)$
We introduce and analyze a competitive extension of classical bootstrap percolation on the Erdős--Rényi random graph $G(n,p_n)$. Nodes can be red, black, or white, with red and black representing two competing active states. Starting from two sets of initially active seeds, white nodes activate acco
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
- First-Passage Percolation on Spread-out line graphs: Microscopic Regime#821967
- Randomly Initialized Networks Can Learn from Peer-to-Peer Consensus#120532
- Majority Dynamics on Random Graphs With Almost Balanced Initial Settings: The Power of Few#656561
- Majority dynamics on sparse random graphs#1084861
- Convergence and compactness of discrete aggregation trees#1070568
Record · ID 984796
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