اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOptimization of robustness based on reinforced nodes in a modular network
377
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Many systems such as critical infrastructure exhibit a modular structure with many links within the modules and few links between them. One approach to increase the robustness of these systems is to reinforce a fraction of the nodes in each module, so that the reinforced nodes provide additional needed sources for themselves as well as for their nearby neighborhood. Since reinforcing a node can be an expensive task, the efficiency of the decentralization process by reinforced nodes is vital. In our study we analyze a new model which combines both above mentioned features of real complex systems - modularity and reinforced nodes. Using tools from percolation theory, we derived an analytical solution for any partition of reinforced nodes; between nodes which have links that connect them to other modules (inter-nodes) and nodes which have connections only within their modules (intra-nodes). Among our results, we find that near the critical percolation point ($papprox p_c$) the robustness is greatly affected by the distribution. In particular, we find a partition of reinforced nodes which yields an optimal robustness and we show that the optimal partition remains constant for high average degrees.
قيم البحث
اقرأ أيضاً
In interdependent networks, it is usually assumed, based on percolation theory, that nodes become nonfunctional if they lose connection to the network giant component. However, in reality, some nodes, equipped with alternative resources, together wit
h their connected neighbors can still be functioning once disconnected from the giant component. Here we propose and study a generalized percolation model that introduces a fraction of reinforced nodes in the interdependent networks that can function and support their neighborhood. We analyze, both analytically and via simulations, the order parameter$-$the functioning component$-$comprising both the giant component and smaller components that include at least one reinforced node. Remarkably, we find that for interdependent networks, we need to reinforce only a small fraction of nodes to prevent abrupt catastrophic collapses. Moreover, we find that the universal upper bound of this fraction is 0.1756 for two interdependent ErdH{o}s-R{e}nyi (ER) networks, regular-random (RR) networks and scale-free (SF) networks with large average degrees. We also generalize our theory to interdependent networks of networks (NON). Our findings might yield insight for designing resilient interdependent infrastructure networks.
Recently, the structural controllability theory has been introduced to analyze the Protein-Protein Interaction (PPI) network. The indispensable nodes, which their removal increase the number of driver nodes to control the network, are found essential
in PPI network. However, the PPI network is far from complete and there may exist many false-positive or false-negative interactions, which promotes us to question: are these indispensable nodes robust to structural change? Here we systematically investigate the robustness of indispensable nodes of PPI network by removing and adding possible interactions. We found that the indispensable nodes are sensitive to the structural change and very few edges can change the type of many indispensable nodes. The finding may promote our understanding to the control principle of PPI network.
We discuss a model of motion of substance through the nodes of a channel of a network. The channel can be modeled by a chain of urns where each urn can exchange substance with the neighboring urns. In addition the urns can exchange substance with the
network nodes and the new point is that we include in the model the possibility for exchange of substance among the urns (nodes) and the environment of the network. We consider stationary regime of motion of substance through a finite channel (stationary regime of exchange of substance along the chain of urns) and obtain a class of statistical distributions of substance in the nodes of the channel. Our attention is focused on this class of distributions and we show that for the case of finite channel the obtained class of distributions contains as particular cases truncat
Many real systems are extremely vulnerable against attacks, since they are scale-free networks as commonly existing topological structure in them. Thus, in order to improve the robustness of connectivity, several edge rewiring methods have been so fa
r proposed by enhancing degree-degree correlations. In fact, onion-like structures with positive degree-degree correlations are optimally robust against attacks. On the other hand, recent studies suggest that the robustness and loops are strongly related to each other. Therefore, we focus on enhancing loops as a new approach for improving the robustness. In this work, we propose edge rewiring methods and evaluate the effect on the robustness by applying to real networks. Our proposed methods are two types of rewirings in preserving degrees or not for investigating the effect of the degree modification on the robustness. Numerical results show that our proposed methods improve the robustness to the level as same or more than the state-of-the-art methods. Furthermore, our work shows that the following two points are more important for further improving the robustness. First, the robustness is strongly related to loops more than degree-degree correlations. Second, it significantly improves the robustness by reducing the gap between the maximum and minimum degrees.
In a recent work [Proc. Natl. Acad. Sci. USA 108, 3838 (2011)], the authors proposed a simple measure for network robustness under malicious attacks on nodes. With a greedy algorithm, they found the optimal structure with respect to this quantity is
an onion structure in which high-degree nodes form a core surrounded by rings of nodes with decreasing degree. However, in real networks the failure can also occur in links such as dysfunctional power cables and blocked airlines. Accordingly, complementary to the node-robustness measurement ($R_{n}$), we propose a link-robustness index ($R_{l}$). We show that solely enhancing $R_{n}$ cannot guarantee the improvement of $R_{l}$. Moreover, the structure of $R_{l}$-optimized network is found to be entirely different from that of onion network. In order to design robust networks resistant to more realistic attack condition, we propose a hybrid greedy algorithm which takes both the $R_{n}$ and $R_{l}$ into account. We validate the robustness of our generated networks against malicious attacks mixed with both nodes and links failure. Finally, some economical constraints for swapping the links in real networks are considered and significant improvement in both aspects of robustness are still achieved.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
