Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Evolution of controllability in interbank networks.

ABSTRACT: The Statistical Physics of Complex Networks has recently provided new theoretical tools for policy makers. Here we extend the notion of network controllability to detect the financial institutions, i.e. the drivers, that are most crucial to the functioning of an interbank market. The system we investigate is a paradigmatic case study for complex networks since it undergoes dramatic structural changes over time and links among nodes can be observed at several time scales. We find a scale-free decay of the fraction of drivers with increasing time resolution, implying that policies have to be adjusted to the time scales in order to be effective. Moreover, drivers are often not the most highly connected "hub" institutions, nor the largest lenders, contrary to the results of other studies. Our findings contribute quantitative indicators which can support regulators in developing more effective supervision and intervention policies.

SUBMITTER: Delpini D

PROVIDER: S-EPMC3620902 | biostudies-other | 2013

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Publications

Evolution of controllability in interbank networks.

Delpini Danilo D Battiston Stefano S Riccaboni Massimo M Gabbi Giampaolo G Pammolli Fabio F Caldarelli Guido G

Scientific reports 20130101

The Statistical Physics of Complex Networks has recently provided new theoretical tools for policy makers. Here we extend the notion of network controllability to detect the financial institutions, i.e. the drivers, that are most crucial to the functioning of an interbank market. The system we investigate is a paradigmatic case study for complex networks since it undergoes dramatic structural changes over time and links among nodes can be observed at several time scales. We find a scale-free dec ...[more]

PMID: 23568033

Similar Datasets

Controllability of structural brain networks.

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

Exact controllability of complex networks.

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

Controllability in protein interaction networks.

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

Controllability of complex networks with unilateral inputs.

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

Promoter/enhancer-based controllability of regulatory networks.

Project description:Understanding the mechanisms of tissue-specific transcriptional regulation is crucial as mis-regulation can cause a broad range of diseases. Here, we investigated transcription factors (TF) that are indispensable for the topological control of tissue specific and cell-type specific regulatory networks as a function of their binding to regulatory elements on promoters and enhancers of corresponding target genes. In particular, we found that promoter-binding TFs that were indispensable for regulatory network control regulate genes that are tissue-specifically expressed and overexpressed in corresponding cancer types. In turn, indispensable, enhancer-binding TFs were enriched with disease and signaling genes as they control an increasing number of cell-type specific regulatory networks. Their target genes were cell-type specific for blood and immune-related cell-types and over-expressed in blood-related cancers. Notably, target genes of indispensable enhancer-binding TFs in cell-type specific regulatory networks were enriched with cancer drug targets, while target genes of indispensable promoter-binding TFs were bona-fide targets of cancer drugs in corresponding tissues. Our results emphasize the significant role control analysis of regulatory networks plays in our understanding of transcriptional regulation, demonstrating potential therapeutic implications in tissue-specific drug discovery research.

| S-EPMC8894475 | biostudies-literature

Structural controllability of unidirectional bipartite networks.

Project description:The interactions between fundamental life molecules, people and social organisations build complex architectures that often result in undesired behaviours. Despite all of the advances made in our understanding of network structures over the past decade, similar progress has not been achieved in the controllability of real-world networks. In particular, an analytical framework to address the controllability of bipartite networks is still absent. Here, we present a dominating set (DS)-based approach to bipartite network controllability that identifies the topologies that are relatively easy to control with the minimum number of driver nodes. Our theoretical calculations, assisted by computer simulations and an evaluation of real-world networks offer a promising framework to control unidirectional bipartite networks. Our analysis should open a new approach to reverting the undesired behaviours in unidirectional bipartite networks at will.

| S-EPMC3622082 | biostudies-other

Irrelevance of linear controllability to nonlinear dynamical networks.

Project description:There has been tremendous development in linear controllability of complex networks. Real-world systems are fundamentally nonlinear. Is linear controllability relevant to nonlinear dynamical networks? We identify a common trait underlying both types of control: the nodal "importance". For nonlinear and linear control, the importance is determined, respectively, by physical/biological considerations and the probability for a node to be in the minimum driver set. We study empirical mutualistic networks and a gene regulatory network, for which the nonlinear nodal importance can be quantified by the ability of individual nodes to restore the system from the aftermath of a tipping-point transition. We find that the nodal importance ranking for nonlinear and linear control exhibits opposite trends: for the former large-degree nodes are more important but for the latter, the importance scale is tilted towards the small-degree nodes, suggesting strongly the irrelevance of linear controllability to these systems. The recent claim of successful application of linear controllability to Caenorhabditis elegans connectome is examined and discussed.

| S-EPMC6722065 | biostudies-literature

The basis of easy controllability in Boolean networks.

Project description:Effective control of biological systems can often be achieved through the control of a surprisingly small number of distinct variables. We bring clarity to such results using the formalism of Boolean dynamical networks, analyzing the effectiveness of external control in selecting a desired final state when that state is among the original attractors of the dynamics. Analyzing 49 existing biological network models, we find strong numerical evidence that the average number of nodes that must be forced scales logarithmically with the number of original attractors. This suggests that biological networks may be typically easy to control even when the number of interacting components is large. We provide a theoretical explanation of the scaling by separating controlling nodes into three types: those that act as inputs, those that distinguish among attractors, and any remaining nodes. We further identify characteristics of dynamics that can invalidate this scaling, and speculate about how this relates more broadly to non-biological systems.

| S-EPMC8410781 | biostudies-literature

Universal framework for edge controllability of complex networks.

Project description:Dynamical processes occurring on the edges in complex networks are relevant to a variety of real-world situations. Despite recent advances, a framework for edge controllability is still required for complex networks of arbitrary structure and interaction strength. Generalizing a previously introduced class of processes for edge dynamics, the switchboard dynamics, and exploit- ing the exact controllability theory, we develop a universal framework in which the controllability of any node is exclusively determined by its local weighted structure. This framework enables us to identify a unique set of critical nodes for control, to derive analytic formulas and articulate efficient algorithms to determine the exact upper and lower controllability bounds, and to evaluate strongly structural controllability of any given network. Applying our framework to a large number of model and real-world networks, we find that the interaction strength plays a more significant role in edge controllability than the network structure does, due to a vast range between the bounds determined mainly by the interaction strength. Moreover, transcriptional regulatory networks and electronic circuits are much more strongly structurally controllable (SSC) than other types of real-world networks, directed networks are more SSC than undirected networks, and sparse networks are typically more SSC than dense networks.

| S-EPMC5484715 | biostudies-literature

Robustness of controllability for networks based on edge-attack.

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

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