Emergence of Robust and Efficient Networks in a Family of Attachment Models

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 $\beta \ge 0$ 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 intermediation models modified with the inverse preferential attachment for investigating the effect of distance on the emergence of robust onion-like structure. The inverse preferential attachments in a class of mixed attachment and two intermediation models are effective for the emergence of robust onion-like structure, however, when $\beta$ is large enough, a small amount of random attachment is necessary for the network efficiency. Such attachment models indicate a prospective direction to the future growth of our network infrastructures.

References in corpus (16)

• Emergence of scaling in random networks
• Error and attack tolerance of complex networks
• Efficient Behavior of Small-World Networks
• Assortative mixing in networks
• Mean-field theory for scale-free random networks
• Connectivity of Growing Random Networks
• Growing Scale-Free Networks with Tunable Clustering
• Mitigation of Malicious Attacks on Networks
• Organization of Growing Random Networks
• Infinite-Order Percolation and Giant Fluctuations in a Protein Interaction Network
• Log-Networks
• Robustness of onion-like correlated networks against targeted attacks
• Onion structure and network robustness
• A new design principle of robust onion-like networks self-organized in growth
• Propinquity drives the emergence of network structure and density
• Growing Self-organized Design of Efficient and Robust Complex Networks

Cited by in corpus (3)

• Parameterizing Network Graph Heterogeneity using a Modified Weibull Distribution
• Universal vulnerability in strong modular networks with various degree distributions between inequality and equality
• Larger holes as narrower degree distributions in complex networks