arXiv (All)
open access
First-Passage Percolation on Spread-out line graphs: Microscopic Regime
We study first-passage percolation on the $\ell$-spread-out line graph, where each vertex $i\in\{0,1,\dots,n\}$ is connected to all others at distance at most $\ell$. Here, we focus on the microscopic regime, with $\ell$ fixed as $n\to\infty$. Independent nonnegative weights are assigned to these ed
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
- Competing bootstrap processes on the random graph $G(n,p)$#984796
- Locality of Bernoulli Site Percolation on Transitive Graphs#975093
- Geodesic trees in last passage percolation and some related problems#785028
- Geodesic trees in last passage percolation and some related problems#783438
- Thinning and sprinkling: from robust sampling to almost Hamiltonicity#1078236
Record · ID 821967
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