Enhancing Controllability Robustness of q-Snapback Networks through Redirecting Edges.
Ontology highlight
ABSTRACT:
SUBMITTER: Lou Y
PROVIDER: S-EPMC7006948 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:We study the controllability of networks in the process of cascading failures under two different attacking strategies, random and intentional attack, respectively. For the highest-load edge attack, it is found that the controllability of Erd?s-Rényi network, that with moderate average degree, is less robust, whereas the Scale-free network with moderate power-law exponent shows strong robustness of controllability under the same attack strategy. The vulnerability of controllability under random and intentional attacks behave differently with the increasing of removal fraction, especially, we find that the robustness of control has important role in cascades for large removal fraction. The simulation results show that for Scale-free networks with various power-law exponents, the network has larger scale of cascades do not mean that there will be more increments of driver nodes. Meanwhile, the number of driver nodes in cascading failures is also related to the edges amount in strongly connected components.
| S-EPMC3935847 | biostudies-literature
Project description:Coupled networks are extremely fragile because a node failure of a network would trigger a cascade of failures on the entire system. Existing studies mainly focused on the cascading failures and the robustness of coupled networks when the networks suffer from attacks. In reality, it is necessary to recover the damaged networks, and there are cascading failures in recovery processes. In this study, firstly, we analyze the cascading failures of coupled networks during recoveries. Then, a recovery robustness index is presented for evaluating the resilience of coupled networks to cascading failures in the recovery processes. Finally, we propose a technique aiming at protecting several influential nodes for enhancing robustness of coupled networks under the recoveries, and adopt six strategies based on the potential knowledge of network centrality to find the influential nodes. Experiments on three coupling networks demonstrate that with a small number of influential nodes protected, the robustness of coupled networks under the recoveries can be greatly enhanced.
| S-EPMC4327128 | biostudies-other
Project description:Many real-world systems can be described by scale-free networks with power-law degree distributions. Scale-free networks show a "robust yet fragile" feature due to their heterogeneous degree distributions. We propose to enhance the structural robustness of scale-free networks against intentional attacks by changing the displayed network structure information rather than modifying the network structure itself. We first introduce a simple mathematical model for attack information and investigate the impact of attack information on the structural robustness of scale-free networks. Both analytical and numerical results show that decreasing slightly the attack information perfection by information disturbance can dramatically enhance the structural robustness of scale-free networks. Then we propose an optimization model of disturbance strategies in which the cost constraint is considered. We analyze the optimal disturbance strategies and show an interesting but counterintuitive finding that disturbing "poor nodes" with low degrees preferentially is more effective than disturbing "rich nodes" with high degrees preferentially. We demonstrate the efficiency of our method by comparison with edge addition method and validate the feasibility of our method in two real-world critical infrastructure networks.
| S-EPMC5548747 | biostudies-other
Project description:The edges of 2D materials have emerged as promising electrochemical catalyst systems, yet their performance still lags behind that of noble metals. Here, we demonstrate the potential of oriented electric fields (OEFs) to enhance the electrochemical activity of 2D materials edges. By atomically engineering the edge of a fluorographene/graphene/MoS2 heterojunction nanoribbon, strong and localized OEFs were realized as confirmed by simulations and spatially resolved spectroscopy. The observed fringing OEF results in an enhancement of the heterogeneous charge transfer rate between the edge and the electrolyte by 2 orders of magnitude according to impedance spectroscopy. Ab initio calculations indicate a field-induced decrease in the reactant adsorption energy as the origin of this improvement. We apply the OEF-enhanced edge reactivity to hydrogen evolution reactions (HER) and observe a significantly enhanced electrochemical performance, as evidenced by a 30% decrease in Tafel slope and a 3-fold enhanced turnover frequency. Our findings demonstrate the potential of OEFs for tailoring the catalytic properties of 2D material edges toward future complex reactions.
| S-EPMC11295188 | biostudies-literature
Project description:Cognitive function is driven by dynamic interactions between large-scale neural circuits or networks, enabling behaviour. However, fundamental principles constraining these dynamic network processes have remained elusive. Here we use tools from control and network theories to offer a mechanistic explanation for how the brain moves between cognitive states drawn from the network organization of white matter microstructure. Our results suggest that densely connected areas, particularly in the default mode system, facilitate the movement of the brain to many easily reachable states. Weakly connected areas, particularly in cognitive control systems, facilitate the movement of the brain to difficult-to-reach states. Areas located on the boundary between network communities, particularly in attentional control systems, facilitate the integration or segregation of diverse cognitive systems. Our results suggest that structural network differences between cognitive circuits dictate their distinct roles in controlling trajectories of brain network function.
| S-EPMC4600713 | biostudies-literature
Project description:Controllability of complex networks has been a hot topic in recent years. Real networks regarded as interdependent networks are always coupled together by multiple networks. The cascading process of interdependent networks including interdependent failure and overload failure will destroy the robustness of controllability for the whole network. Therefore, the optimization of the robustness of interdependent network controllability is of great importance in the research area of complex networks. In this paper, based on the model of interdependent networks constructed first, we determine the cascading process under different proportions of node attacks. Then, the structural controllability of interdependent networks is measured by the minimum driver nodes. Furthermore, we propose a parameter which can be obtained by the structure and minimum driver set of interdependent networks under different proportions of node attacks and analyze the robustness for interdependent network controllability. Finally, we optimize the robustness of interdependent network controllability by redundant design including node backup and redundancy edge backup and improve the redundant design by proposing different strategies according to their cost. Comparative strategies of redundant design are conducted to find the best strategy. Results shows that node backup and redundancy edge backup can indeed decrease those nodes suffering from failure and improve the robustness of controllability. Considering the cost of redundant design, we should choose BBS (betweenness-based strategy) or DBS (degree based strategy) for node backup and HDF(high degree first) for redundancy edge backup. Above all, our proposed strategies are feasible and effective at improving the robustness of interdependent network controllability.
| S-EPMC5811023 | biostudies-literature
Project description:Controlling complex networks is of paramount importance in science and engineering. Despite the recent development of structural controllability theory, we continue to lack a framework to control undirected complex networks, especially given link weights. Here we introduce an exact controllability paradigm based on the maximum multiplicity to identify the minimum set of driver nodes required to achieve full control of networks with arbitrary structures and link-weight distributions. The framework reproduces the structural controllability of directed networks characterized by structural matrices. We explore the controllability of a large number of real and model networks, finding that dense networks with identical weights are difficult to be controlled. An efficient and accurate tool is offered to assess the controllability of large sparse and dense networks. The exact controllability framework enables a comprehensive understanding of the impact of network properties on controllability, a fundamental problem towards our ultimate control of complex systems.
| S-EPMC3945876 | biostudies-other
Project description:Recently, the focus of network research shifted to network controllability, prompting us to determine proteins that are important for the control of the underlying interaction webs. In particular, we determined minimum dominating sets of proteins (MDSets) in human and yeast protein interaction networks. Such groups of proteins were defined as optimized subsets where each non-MDSet protein can be reached by an interaction from an MDSet protein. Notably, we found that MDSet proteins were enriched with essential, cancer-related, and virus-targeted genes. Their central position allowed MDSet proteins to connect protein complexes and to have a higher impact on network resilience than hub proteins. As for their involvement in regulatory functions, MDSet proteins were enriched with transcription factors and protein kinases and were significantly involved in bottleneck interactions, regulatory links, phosphorylation events, and genetic interactions.
| S-EPMC4024882 | biostudies-other
Project description:Edge effects often exacerbate the negative effects of habitat loss on biodiversity. In forested ecosystems, however, many pollinators actually prefer open sunny conditions created by edge disturbances. We tested the hypothesis that forest edges have a positive buffering effect on plant-pollinator interaction networks in the face of declining forest area. In a fragmented land-bridge island system, we recorded ~20,000 plant-pollinator interactions on 41 islands over 3 yr. We show that plant richness and floral resources decline with decreasing forest area at both interior and edge sites, but edges maintain 10-fold higher pollinator abundance and richness regardless of area loss. Edge networks contain highly specialized species, with higher nestedness and lower modularity than interior networks, maintaining high robustness to extinction following area loss while forest interior networks collapse. Anthropogenic forest edges benefit community diversity and network robustness to extinction in the absence of natural gap-phase dynamics in small degraded forest remnants.
| S-EPMC9998274 | biostudies-literature
Project description:In this paper, we study the problem of controlling complex networks with unilateral controls, i.e., controls which can assume only positive or negative values, not both. Given a complex network represented by the adjacency matrix A, an algorithm is developed that constructs an input matrix B such that the resulting system (A, B) is controllable with a near minimal number of unilateral control inputs. This is made possible by a reformulation of classical conditions for controllability that casts the minimal unilateral input selection problem into well known optimization problems. We identify network properties that make unilateral controllability relatively easy to achieve as compared to unrestricted controllability. The analysis of the network topology for instance allows us to establish theoretical bounds on the minimal number of controls required. For various categories of random networks as well as for a number of real-world networks these lower bounds are often achieved by our heuristics.
| S-EPMC5432006 | biostudies-literature