arXiv (All)
open access
Seed thresholds and degree variance in heterogeneous bootstrap percolation with growing degrees
We study bootstrap percolation with independent vertex thresholds taking values one and two, with threshold-one probability $(1-c/d)/d$ for fixed $c>0$. The seed set is chosen uniformly among sets of a prescribed deterministic size, independently of the graph and thresholds. We prove threshold state
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
- Conditional exponential directed last passage percolation under a one-point upper large deviation event#1328316
- Geodesic trees in last passage percolation and some related problems#785028
- Geodesic trees in last passage percolation and some related problems#783438
- The Erd\H os-Sós conjecture in dense graphs#985287
- Shape theorem for excited random walks on the integer lattice#1217099
Record · ID 1200071
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