arXiv (All)
open access
Locality of Bernoulli Site Percolation on Transitive Graphs
We prove locality of the critical probability for Bernoulli site percolation on infinite, connected, locally finite, vertex-transitive graphs, under the usual assumption that the critical probabilities stay uniformly below one. The proof develops site-percolation forms of the two-ghost inequality, s
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
- Resilient forest universality in percolated dense graphs#1064471
- Probabilistic proofs and transferability#86109
- Proper conflict-free choosability of sparse graphs with girth at least seven#998793
- Exact three-component covers in 2-coloured random bipartite graphs#1011301
Record · ID 975093
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