Bypass rewiring and extreme robustness of Eulerian networks.
Bypass rewiring makes networks robust against removal of nodes including failures and attacks. A concept of bypass rewiring on directed networks is introduced, 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 where every node, except finite nodes, has in-degree equal to the out-degree (even degree). In consequence, we derive a generalized result that a network has a strongly connected spanning subnetwork which has an Eulerian path or cycle if and only if there exists an way of bypass rewiring to make the network extremely robust for every combination of removed nodes.
Publisher URL: http://arxiv.org/abs/1710.11575
Keeping up-to-date with research can feel impossible, with papers being published faster than you'll ever be able to read them. That's where Researcher comes in: we're simplifying discovery and making important discussions happen. With over 19,000 sources, including peer-reviewed journals, preprints, blogs, universities, podcasts and Live events across 10 research areas, you'll never miss what's important to you. It's like social media, but better. Oh, and we should mention - it's free.
Researcher displays publicly available abstracts and doesn’t host any full article content. If the content is open access, we will direct clicks from the abstracts to the publisher website and display the PDF copy on our platform. Clicks to view the full text will be directed to the publisher website, where only users with subscriptions or access through their institution are able to view the full article.