Self-organized network design by link survivals and shortcuts

Hayashi, Yukio; Meguro, Yuko

doi:10.1016/j.physa.2011.08.047

Cited by 3 publications

(7 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Second, the complementary added shortcuts improve the robustness. It has already been shown that adding some shortcut links between uniform randomly chosen nodes improves the robustness in the theory for the small-world model [37] and also in the numerical simulations for many networks [10], [15], [16], [38]. The robustness is further improved due to the positive degreedegree correlations in the onion-like network as shown later, however the case of δ = 0 as the uniform random selections does not give the nearly optimal robustness.…”

Section: A Network Modelmentioning

confidence: 78%

“…To make a structure autonomously, movements or interactions of objects (materials or information) are necessary, therefore naturally induce their flows and form a network as the base. There are several fundamental mechanisms: preferential attachment [2], copying [6], [7], survival [9], [10], subdivision (fragmentation) [13], [14], [15], [16], or aggregation [17], for generating networks in the interdisciplinary research fields of physics, biology, sociology, and computer science. They are summarized in Table I.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Growing Self-Organized Design of Efficient and Robust Complex Networks

Hayashi

2014

2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems

Self Cite

View full text Add to dashboard Cite

A self-organization of efficient and robust networks is important for a future design of communication or transportation systems, however both characteristics are incompatible in many real networks. Recently, it has been found that the robustness of onion-like structure with positive degree-degree correlations is optimal against intentional attacks. We show that, by biologically inspired copying, an onion-like network emerges in the incremental growth with functions of proxy access and reinforced connectivity on a space. The proposed network consists of the backbone of tree-like structure by copyings and the periphery by adding shortcut links between low degree nodes to enhance the connectivity. It has the fine properties of the statistically selfaveraging unlike the conventional duplication-divergence model, exponential-like degree distribution without overloaded hubs, strong robustness against both malicious attacks and random failures, and the efficiency with short paths counted by the number of hops as mediators and by the Euclidean distances. The adaptivity to heal over and to recover the performance of networking is also discussed for a change of environment in such disasters or battlefields on a geographical map. These properties will be useful for a resilient and scalable infrastructure of network systems even in emergent situations or poor environments.In this paper, we consider a self-organized design of efficient and robust networks by biologically inspired copying. In particular, we focus on the robust network structure Model Mechanism Reference network preferential [2] attachment cultural change, copying or [3], [4], [5] network duplication [6], [7] trail, survival [8] network [9], [10] cracking, fragmentation or [11], [12] network subdivision [13], [14], [15], [16] cluster of mass, aggregation [12] network [17] TABLE I. TYPICAL SELF-ORGANIZATION MECHANISMS. with positive degree-degree correlations [29], [30], [31]and an incrementally growing mechanism. The self-propagation in maintaining the robust structure is particularly important for the scalability of network system without degrading the performance.The organization of this paper is as follows. In Sec. II, we briefly review related network models to ours. In Sec. III, we propose a basic model for understanding the fundamental mechanism of network self-organization from a viewpoint in complex network science [18], [19], [20], [21] which aims to elucidate the universal properties and the generation rule of networks. We show the important properties of our model for the robustness of connectivity and the emergent functions. In Sec. IV, we consider an incrementally growing mechanism, and investigate the strong robustness and the efficiency for path lengths. We emphasis that the performance of our proposed networks for both the robustness and the efficiency does not degrade rather rises through the growth. In Sec. V, we discuss the possibilities and the issues for applications especially in communication or transportation systems. The adaptivity fo...

show abstract

Section: A Network Modelmentioning

confidence: 78%

Section: Introductionmentioning

confidence: 99%

Growing Self-Organized Design of Efficient and Robust Complex Networks

Hayashi

2014

2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…Strano et al (2012) utilized 200 years of road network evolution data from a large area located in Milan, Italy, and analyzed the relationship between urbanization and evolution of road networks. Hayashi and Meguro (2012) observed that surviving nodes were concentrated in areas with high population. The analysis of such city-level variables is important with respect to policy discussions.…”

Section: Literature Reviewmentioning

confidence: 98%

Road network vulnerability and city-level characteristics: A nationwide comparative analysis of Japanese cities

Santos

Safitri

Safira

et al. 2021

Environment and Planning B: Urban Analytics and City Science

View full text Add to dashboard Cite

Climate change is making our cities more vulnerable, increasing the needs for further policy actions to make them more resilient. In particular, the transport network is critical in the first phase of disaster response. This study presents the epirical findings of a large scale, nationwide analysis of the road network vulnerability in 69 Japanese cities. We (1) identify the level of network efficiency using topological elements in its undisturbed normal state; (2) evaluate the level of network robustness under different random and targeted attack scenarios; and (3) analyze the relationship of the identified network efficiency and robustness indicators with city-level characteristics. The main findings include: (1) cities with a higher population and a higher infrastructure investment tend to be more robust under random attacks; (2) larger cities tend to be less robust to targeted attacks, presumably due to their high agglomeration of urban functions; (3) car dependency tends to make cities more vulnerable toward random attacks and less vulnerable toward targeted attacks as it indicates a weaker concentration in urban functions; and (4) a high modal share for trains tends to make cities less vulnerable toward random events as it indicates a high agglomeration of urban functions. These findings will help policymakers to prioritize their budget allocations to improve nationwide disaster resilience.

show abstract

“…It has already been shown that adding some shortcut links between randomly chosen nodes improves the robustness in the theory for the small-world model [29] and also in the numerical simulations for geographical networks: random Apollonian networks [30], multi-scale quartered networks [31], and link survival networks [7]. In addition, positive degree-degree correlations tend to appear in randomly growing networks [32].…”

Section: Basic Generation Proceduresmentioning

confidence: 99%

“…While other dynamics of information flows, rumor spreading, opinion formation, synchronization, or logistics on a network, is significant for applications in wireless, sensor, mobile communication systems or autonomous transportation systems, in which operation protocols for birth and death of communication or transportation request, routing, avoidance of congestion, task allocation, queuing, awareness of location, monitoring of system's states or conditions, and so on[44], are necessary. We have pointed out the issues of rethinking packet generation according to population, decentralized routing strategy, and link hierarchy among long and short ranges with high and low transfer speeds[45] in the state-of-the-art network technologies.In addition, although several models have been proposed for the coevolution of network formation and opinion spreading[46,47] and for the coupled dynamics with network evolution and packet flows[6,7,48,49,50], they are beyond…”

mentioning

confidence: 99%

Spatially self-organized resilient networks by a distributed cooperative mechanism

Hayashi

2016

Physica A: Statistical Mechanics and its Applications

Self Cite

View full text Add to dashboard Cite

The robustness of connectivity and the efficiency of paths are incompatible in many real networks. We propose a self-organization mechanism for incrementally generating onion-like networks with positive degree-degree correlations whose robustness is nearly optimal. As a spatial extension of the generation model based on cooperative copying and adding shortcut, we show that the growing networks become more robust and efficient through enhancing the onion-like topological structure on a space. The reasonable constraint for locating nodes on the perimeter in typical surface growth as a self-propagation does not affect these properties of the tolerance and the path length. Moreover, the robustness can be recovered in the random growth damaged by insistent sequential attacks even without any remedial measures.

show abstract

Self-organized network design by link survivals and shortcuts

Cited by 3 publications

References 30 publications

Growing Self-Organized Design of Efficient and Robust Complex Networks

Growing Self-Organized Design of Efficient and Robust Complex Networks

Road network vulnerability and city-level characteristics: A nationwide comparative analysis of Japanese cities

Spatially self-organized resilient networks by a distributed cooperative mechanism

Contact Info

Product

Resources

About