arXiv (All)
open access
Symmetry breaking in optimal transport networks
Despite its importance for practical applications, not much is known about the optimal shape of a network that connects in an efficient way a set of points. This problem can be formulated in terms of a multiplex network with a fast layer embedded in a slow one. To connect a pair of points, one can t
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
- CAPACITY AND FLOW ASSIGNMENTS IN LARGE COMPUTER NETWORKS#933595
- Optimal impartial correspondences#367001
- Temporal Conductance and Bounds on the Voter Model for Dynamic Networks#271788
- Modeling Bipartite Dynamic Networks: An Additive and Multiplicative Effects Model#1155835
- An Incremental Algorithm for Checking the Possibility of Braess Paradox in Dynamic Nets#1051123
Record · ID 1011958
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