arXiv (All)
open access
Percolation on interdependent one-dimensional long-range networks
We study the emergence of a mutual giant component in a multiplex network comprised of two one-dimensional long-range networks on a lattice. The probability that two nodes on one lattice, with a distance $r$ between them, are connected with an edge falls algebraically with distance as $Cr^{-(1+σ)}$,
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
- Locality of Bernoulli Site Percolation on Transitive Graphs#975093
- Lattices with Large Kissing Number from Local Density#1325276
- The Deterministic Broadcast Channel Revisited: A Bipartite Graph Approach#1049065
- Multi-entropy in random tensor networks#1354175
- Temporal Conductance and Bounds on the Voter Model for Dynamic Networks#271788
Record · ID 1234464
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