{"paper":{"title":"Designing optimal transport networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.soc-ph","authors_text":"A. A. Moreira, G. Li, H. E. Stanley, J. S. Andrade Jr, S. D. S. Reis, S. Havlin","submitted_at":"2009-08-26T17:50:12Z","abstract_excerpt":"We investigate the optimal design of networks for a general transport system. Our network is built from a regular two-dimensional ($d=2$) square lattice to be improved by adding long-range connections (shortcuts) with probability $P_{ij} \\sim r_{ij}^{-\\alpha}$, where $r_{ij}$ is the Euclidean distance between sites $i$ and $j$, and $\\alpha$ is a variable exponent. We introduce a cost constraint on the total length of the additional links and find optimal transport in the system for $\\alpha=d+1$. Remarkably, this condition remains optimal, regardless of the strategy used for navigation, being b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.3869","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}