Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Effect of correlations on controllability transition in network control.

ABSTRACT: The network control problem has recently attracted an increasing amount of attention, owing to concerns including the avoidance of cascading failures of power-grids and the management of ecological networks. It has been proven that numerical control can be achieved if the number of control inputs exceeds a certain transition point. In the present study, we investigate the effect of degree correlation on the numerical controllability in networks whose topological structures are reconstructed from both real and modeling systems, and we find that the transition point of the number of control inputs depends strongly on the degree correlation in both undirected and directed networks with moderately sparse links. More interestingly, the effect of the degree correlation on the transition point cannot be observed in dense networks for numerical controllability, which contrasts with the corresponding result for structural controllability. In particular, for directed random networks and scale-free networks, the influence of the degree correlation is determined by the types of correlations. Our approach provides an understanding of control problems in complex sparse networks.

SUBMITTER: Nie S

PROVIDER: S-EPMC4827056 | biostudies-other | 2016 Apr

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Similar Datasets

Effect of correlations on network controllability.

Project description:A dynamical system is controllable if by imposing appropriate external signals on a subset of its nodes, it can be driven from any initial state to any desired state in finite time. Here we study the impact of various network characteristics on the minimal number of driver nodes required to control a network. We find that clustering and modularity have no discernible impact, but the symmetries of the underlying matching problem can produce linear, quadratic or no dependence on degree correlation coefficients, depending on the nature of the underlying correlations. The results are supported by numerical simulations and help narrow the observed gap between the predicted and the observed number of driver nodes in real networks.

| S-EPMC3545232 | biostudies-literature

Attack Vulnerability of Network Controllability.

Project description:Controllability of complex networks has attracted much attention, and understanding the robustness of network controllability against potential attacks and failures is of practical significance. In this paper, we systematically investigate the attack vulnerability of network controllability for the canonical model networks as well as the real-world networks subject to attacks on nodes and edges. The attack strategies are selected based on degree and betweenness centralities calculated for either the initial network or the current network during the removal, among which random failure is as a comparison. It is found that the node-based strategies are often more harmful to the network controllability than the edge-based ones, and so are the recalculated strategies than their counterparts. The Barabási-Albert scale-free model, which has a highly biased structure, proves to be the most vulnerable of the tested model networks. In contrast, the Erd?s-Rényi random model, which lacks structural bias, exhibits much better robustness to both node-based and edge-based attacks. We also survey the control robustness of 25 real-world networks, and the numerical results show that most real networks are control robust to random node failures, which has not been observed in the model networks. And the recalculated betweenness-based strategy is the most efficient way to harm the controllability of real-world networks. Besides, we find that the edge degree is not a good quantity to measure the importance of an edge in terms of network controllability.

| S-EPMC5010274 | biostudies-literature

Controllability analysis of molecular pathways points to proteins that control the entire interaction network.

Project description:Inputs to molecular pathways that are the backbone of cellular activity drive the cell to certain outcomes and phenotypes. Here, we investigated proteins that topologically controlled different human pathways represented as independent molecular interaction networks, suggesting that a minority of proteins control a high number of pathways and vice versa. Transcending different topological levels, proteins that controlled a large number of pathways also controlled a network of interactions when all pathways were combined. Furthermore, control proteins that were robust when interactions were rewired or inverted also increasingly controlled an increasing number of pathways. As for functional characteristics, such control proteins were enriched with regulatory and signaling genes, disease genes and drug targets. Focusing on evolutionary characteristics, proteins that controlled different pathways had a penchant to be evolutionarily conserved as equal counterparts in other organisms, indicating the fundamental role that control analysis of pathways plays for our understanding of regulation, disease and evolution.

| S-EPMC7031241 | biostudies-literature

Dilations and degeneracy in network controllability.

Project description:Network controllability asserts a perspective that the structure-the location of edges that connect nodes-of the network contains important information about fundamental characteristics of our ability to change the behavior that evolves on these networks. It can be used, for example, to determine the parts of the system that when influenced by outside controlling signals, can ultimately steer the behavior of the entire network. One of the challenges in utilizing the ideas from network controllability on real systems is that there is typically more than one potential solution (often many) suggested by the topology of the graph that perform equally well. Picking a single candidate from this degenerate solution set over others should be properly motivated, however, to-date our understanding of how these different options are related has been limited. In this work, we operationalize the existing notion of a dilation into a framework that provides clarity on the source of this control degeneracy and further elucidates many of the existing results surrounding degeneracy in the literature.

| S-EPMC8100115 | biostudies-literature

Identification of genes and critical control proteins associated with inflammatory breast cancer using network controllability.

Project description:One of the most aggressive forms of breast cancer is inflammatory breast cancer (IBC), whose lack of tumour mass also makes a prompt diagnosis difficult. Moreover, genomic differences between common breast cancers and IBC have not been completely assessed, thus substantially limiting the identification of biomarkers unique to IBC. Here, we developed a novel statistical analysis of gene expression profiles corresponding to microdissected IBC, non-IBC (nIBC) and normal samples that enabled us to identify a set of genes significantly associated with a specific disease state. Second, by using advanced methods based on controllability network theory, we identified a set of critical control proteins that uniquely and structurally control the entire proteome. By mapping high change variance genes in protein interaction networks, we found that a large statistically significant fraction of genes whose variance changed significantly between normal and IBC and nIBC disease states were among the set of critical control proteins. Moreover, this analysis identified the overlapping genes with the highest statistical significance; these genes may assist in developing future biomarkers and determining drug targets to disrupt the molecular pathways driving carcinogenesis in IBC.

| S-EPMC5673205 | biostudies-literature

Intrinsic dynamics induce global symmetry in network controllability.

Project description:Controlling complex networked systems to desired states is a key research goal in contemporary science. Despite recent advances in studying the impact of network topology on controllability, a comprehensive understanding of the synergistic effect of network topology and individual dynamics on controllability is still lacking. Here we offer a theoretical study with particular interest in the diversity of dynamic units characterized by different types of individual dynamics. Interestingly, we find a global symmetry accounting for the invariance of controllability with respect to exchanging the densities of any two different types of dynamic units, irrespective of the network topology. The highest controllability arises at the global symmetry point, at which different types of dynamic units are of the same density. The lowest controllability occurs when all self-loops are either completely absent or present with identical weights. These findings further improve our understanding of network controllability and have implications for devising the optimal control of complex networked systems in a wide range of fields.

| S-EPMC4325315 | biostudies-literature

Control and controllability of microswimmers by a shearing flow.

Project description:With the continuing rapid development of artificial microrobots and active particles, questions of microswimmer guidance and control are becoming ever more relevant and prevalent. In both the applications and theoretical study of such microscale swimmers, control is often mediated by an engineered property of the swimmer, such as in the case of magnetically propelled microrobots. In this work, we will consider a modality of control that is applicable in more generality, effecting guidance via modulation of a background fluid flow. Here, considering a model swimmer in a commonplace flow and simple geometry, we analyse and subsequently establish the efficacy of flow-mediated microswimmer positional control, later touching upon a question of optimal control. Moving beyond idealized notions of controllability and towards considerations of practical utility, we then evaluate the robustness of this control modality to sources of variation that may be present in applications, examining in particular the effects of measurement inaccuracy and rotational noise. This exploration gives rise to a number of cautionary observations, which, overall, demonstrate the need for the careful assessment of both policy and behavioural robustness when designing control schemes for use in practice.

| S-EPMC8355676 | biostudies-literature

Optimization of robustness of interdependent network controllability by redundant design.

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

Critical controllability in proteome-wide protein interaction network integrating transcriptome.

Project description:Recently, the number of essential gene entries has considerably increased. However, little is known about the relationships between essential genes and their functional roles in critical network control at both the structural (protein interaction network) and dynamic (transcriptional) levels, in part because the large size of the network prevents extensive computational analysis. Here, we present an algorithm that identifies the critical control set of nodes by reducing the computational time by 180 times and by expanding the computable network size up to 25 times, from 1,000 to 25,000 nodes. The developed algorithm allows a critical controllability analysis of large integrated systems composed of a transcriptome- and proteome-wide protein interaction network for the first time. The data-driven analysis captures a direct triad association of the structural controllability of genes, lethality and dynamic synchronization of co-expression. We believe that the identified optimized critical network control subsets may be of interest as drug targets; thus, they may be useful for drug design and development.

| S-EPMC4819195 | biostudies-literature

Network controllability solutions for computational drug repurposing using genetic algorithms.

Project description:Control theory has seen recently impactful applications in network science, especially in connections with applications in network medicine. A key topic of research is that of finding minimal external interventions that offer control over the dynamics of a given network, a problem known as network controllability. We propose in this article a new solution for this problem based on genetic algorithms. We tailor our solution for applications in computational drug repurposing, seeking to maximize its use of FDA-approved drug targets in a given disease-specific protein-protein interaction network. We demonstrate our algorithm on several cancer networks and on several random networks with their edges distributed according to the Erdős-Rényi, the Scale-Free, and the Small World properties. Overall, we show that our new algorithm is more efficient in identifying relevant drug targets in a disease network, advancing the computational solutions needed for new therapeutic and drug repurposing approaches.

| S-EPMC8791995 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data