arXiv (OAI Expanded)
open access
Phase Transition and Fluctuation Results for First-Passage Percolation on Spread-Out Cycle Graphs
We study first-passage percolation on the $\ell$-spread-out one-dimensional cycle of size $n$, where vertices are connected if their graph distance is at most $\ell$. We assign i.i.d.~non-negative random weights from a Weibull distribution $ω_e \sim \mathrm{Exp}(1)^{1/θ}$ to the edges for $θ>0$ fixe
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
- Phase Transition and Fluctuation Results for First-Passage Percolation on Spread-Out Cycle Graphs#819581
- Phase Transition in Random Networks with Multiple States#639146
- Phase transition for strongly correlated percolation models on supercritical Bernoulli clusters#986507
- A lattice family with kissing constant $τ(\mathcal{L}_n) \ge e^{\sqrt{n}}$#1071382
- Majority Dynamics on Random Graphs With Almost Balanced Initial Settings: The Power of Few#656561
Record · ID 809585
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