Do you want to publish a course? Click here

Growing Self-organized Design of Efficient and Robust Complex Networks

117   0   0.0 ( 0 )
 Added by Yukio Hayashi
 Publication date 2014
and research's language is English
 Authors Yukio Hayashi




Ask ChatGPT about the research

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 self-averaging 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.



rate research

Read More

114 - Yukio Hayashi 2016
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.
144 - Yukio Hayashi , Yuki Meguro 2011
One of the challenges for future infrastructures is how to design a network with high efficiency and strong connectivity at low cost. We propose self-organized geographical networks beyond the vulnerable scale-free structure found in many real systems. The networks with spatially concentrated nodes emerge through link survival and path reinforcement on routing flows in a wireless environment with a constant transmission range of a node. In particular, we show that adding some shortcuts induces both the small-world effect and a significant improvement of the robustness to the same level as in the optimal bimodal networks. Such a simple universal mechanism will open prospective ways for several applications in wide-area ad hoc networks, smart grids, and urban planning.
306 - Yukio Hayashi 2017
Todays economy, production activity, and our life are sustained by social and technological network infrastructures, while new threats of network attacks by destructing loops have been found recently in network science. We inversely take into account the weakness, and propose a new design principle for incrementally growing robust networks. The networks are self-organized by enhancing interwoven long loops. In particular, we consider the range-limited approximation of linking by intermediations in a few hops, and show the strong robustness in the growth without degrading efficiency of paths. Moreover, we demonstrate that the tolerance of connectivity is reformable even from extremely vulnerable real networks according to our proposed growing process with some investment. These results may indicate a prospective direction to the future growth of our network infrastructures.
In this work, we investigate a heterogeneous population in the modified Hegselmann-Krause opinion model on complex networks. We introduce the Shannon information entropy about all relative opinion clusters to characterize the cluster profile in the final configuration. Independent of network structures, there exists the optimal stubbornness of one subpopulation for the largest number of clusters and the highest entropy. Besides, there is the optimal bounded confidence (or subpopulation ratio) of one subpopulation for the smallest number of clusters and the lowest entropy. However, network structures affect cluster profiles indeed. A large average degree favors consensus for making different networks more similar with complete graphs. The network size has limited impact on cluster profiles of heterogeneous populations on scale-free networks but has significant effects upon those on small-world networks.
Reconstructing complex networks from measurable data is a fundamental problem for understanding and controlling collective dynamics of complex networked systems. However, a significant challenge arises when we attempt to decode structural information hidden in limited amounts of data accompanied by noise and in the presence of inaccessible nodes. Here, we develop a general framework for robust reconstruction of complex networks from sparse and noisy data. Specifically, we decompose the task of reconstructing the whole network into recovering local structures centered at each node. Thus, the natural sparsity of complex networks ensures a conversion from the local structure reconstruction into a sparse signal reconstruction problem that can be addressed by using the lasso, a convex optimization method. We apply our method to evolutionary games, transportation and communication processes taking place in a variety of model and real complex networks, finding that universal high reconstruction accuracy can be achieved from sparse data in spite of noise in time series and missing data of partial nodes. Our approach opens new routes to the network reconstruction problem and has potential applications in a wide range of fields.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا