{"paper":{"title":"Scaling of Congestion in Small World Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI","physics.soc-ph"],"primary_cat":"math.MG","authors_text":"Gabriel H. Tucci, Iraj Saniee","submitted_at":"2012-01-20T13:52:41Z","abstract_excerpt":"In this report we show that in a planar exponentially growing network consisting of $N$ nodes, congestion scales as $O(N^2/\\log(N))$ independently of how flows may be routed. This is in contrast to the $O(N^{3/2})$ scaling of congestion in a flat polynomially growing network. We also show that without the planarity condition, congestion in a small world network could scale as low as $O(N^{1+\\epsilon})$, for arbitrarily small $\\epsilon$. These extreme results demonstrate that the small world property by itself cannot provide guidance on the level of congestion in a network and other characteris"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4291","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"}