arXiv (All)
open access
Sharpness of the phase transition for constrained-degree percolation
We consider constrained-degree percolation on the hypercubic lattice. Initially, all edges are closed, and each edge independently attempts to open at a uniformly distributed random time; the attempt succeeds if, at that instant, both end-vertices have degrees strictly less than a prescribed paramet
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
- Seed thresholds and degree variance in heterogeneous bootstrap percolation with growing degrees#1200071
- Percolation on Finite Graphs#1076208
- A finite-graph conjecture related to $θ(p_c)=0$ for Bernoulli bond percolation on $\mathbb Z^d$#971895
- Conditional exponential directed last passage percolation under a one-point upper large deviation event#1328316
- Entropy and singularity of spectral and pivotal sets in planar percolation#1109407
Record · ID 1412736
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