Emergence of Robust and Efficient Networks in a Family of Attachment Models
Fuxuan Liao, Yukio Hayashi

TL;DR
This paper explores how different attachment strategies influence the emergence of robust and efficient network structures, revealing that a combination of random and minimum degree attachments optimizes both properties.
Contribution
It introduces a continuous interpolation parameter between random and minimum degree attachments and analyzes their effects on network robustness and efficiency.
Findings
Minimum degree attachment yields highly robust but inefficient chain-like networks.
Inverse preferential attachment promotes onion-like robustness.
A small amount of randomness improves network efficiency at high robustness levels.
Abstract
Self-organization of robust and efficient networks is important for a future design of communication or transportation systems, because both characteristics are not coexisting in many real networks. As one of the candidates for the coexisting, the optimal robustness of onion-like structure with positive degree-degree correlations has recently been found, and it can be generated by incrementally growing methods based on a pair of random and intermediation attachments with the minimum degree selection. In this paper, we introduce a continuous interpolation by a parameter between random and the minimum degree attachments to investigate the reason why the minimum degree selection is important. However, we find that the special case of the minimum degree attachment can generate highly robust networks but with low efficiency as a chain structure. Furthermore, we consider two…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
