arXiv (All)
open access
Weighted isoperimetry implies percolation
Consider an infinite edge-weighted graph satisfying an isoperimetric inequality of the type $\|\partial A\|\geq C|A|^α$ for some $α,C>0$, where $\|\partial A\|$ denotes the weighted size of the edge boundary of $A$. We prove that, for $C$ large enough depending on $α$, if each edge is open independe
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
- Proper conflict-free choosability of sparse graphs with girth at least seven#998793
- Hardness of Learning with Physical Rounding and Noise from Learning With Errors#445657
- Primeless proofs of the Menger and Rothberger games#1076436
- Proper Conflict-Free Choosability for Graphs with Bounded Average Degree#794171
- Proper Conflict-Free Choosability for Graphs with Bounded Average Degree#790152
Record · ID 984666
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