{"paper":{"title":"Bypass rewiring and extreme robustness of Eulerian networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an"],"primary_cat":"physics.soc-ph","authors_text":"Junsang Park, Sang Geun Hahn, Seungwon Shin","submitted_at":"2017-10-31T16:45:53Z","abstract_excerpt":"Bypass rewiring improves connectivity and robustness of networks against removal of nodes including failures and attacks. A concept of bypass rewiring on directed networks is proposed, and random bypass rewiring on infinite directed random networks is analytically and numerically investigated with simulations. As a result, random bypass rewiring makes infinite directed (undirected) random networks extremely robust for arbitrary occupation probabilities if and only if in-degree of every node except a fixed number of nodes is equal to the out-degree (every node except a finite number of nodes ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11575","kind":"arxiv","version":2},"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"}