arXiv (All)
open access
Percolation on Bidirected Graphs
We study bidirected percolation on an undirected graph $G$: each edge is replaced by two oppositely directed edges, each of which is open independently with probability $p$. Two vertices are strongly connected if they are mutually reachable by open directed paths. Let $p_\mathrm{sc}$ denote the thre
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
- A finite-graph conjecture related to $θ(p_c)=0$ for Bernoulli bond percolation on $\mathbb Z^d$#971895
- First-Passage Percolation on Spread-out line graphs: Microscopic Regime#821967
- Sharpness of the phase transition for constrained-degree percolation#1412736
- Locality of Bernoulli Site Percolation on Transitive Graphs#975093
- Competing bootstrap processes on the random graph $G(n,p)$#984796
Record · ID 1413003
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