Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Default cascades in complex networks: topology and systemic risk.

ABSTRACT: The recent crisis has brought to the fore a crucial question that remains still open: what would be the optimal architecture of financial systems? We investigate the stability of several benchmark topologies in a simple default cascading dynamics in bank networks. We analyze the interplay of several crucial drivers, i.e., network topology, banks' capital ratios, market illiquidity, and random vs targeted shocks. We find that, in general, topology matters only--but substantially--when the market is illiquid. No single topology is always superior to others. In particular, scale-free networks can be both more robust and more fragile than homogeneous architectures. This finding has important policy implications. We also apply our methodology to a comprehensive dataset of an interbank market from 1999 to 2011.

SUBMITTER: Roukny T

PROVIDER: S-EPMC3783890 | biostudies-other | 2013

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Publications

Default cascades in complex networks: topology and systemic risk.

Roukny Tarik T Bersini Hugues H Pirotte Hugues H Caldarelli Guido G Battiston Stefano S

Scientific reports 20130926

The recent crisis has brought to the fore a crucial question that remains still open: what would be the optimal architecture of financial systems? We investigate the stability of several benchmark topologies in a simple default cascading dynamics in bank networks. We analyze the interplay of several crucial drivers, i.e., network topology, banks' capital ratios, market illiquidity, and random vs targeted shocks. We find that, in general, topology matters only--but substantially--when the market ...[more]

PMID: 24067913

Similar Datasets

Credit Default Swaps networks and systemic risk.

Project description:Credit Default Swaps (CDS) spreads should reflect default risk of the underlying corporate debt. Actually, it has been recognized that CDS spread time series did not anticipate but only followed the increasing risk of default before the financial crisis. In principle, the network of correlations among CDS spread time series could at least display some form of structural change to be used as an early warning of systemic risk. Here we study a set of 176 CDS time series of financial institutions from 2002 to 2011. Networks are constructed in various ways, some of which display structural change at the onset of the credit crisis of 2008, but never before. By taking these networks as a proxy of interdependencies among financial institutions, we run stress-test based on Group DebtRank. Systemic risk before 2008 increases only when incorporating a macroeconomic indicator reflecting the potential losses of financial assets associated with house prices in the US. This approach indicates a promising way to detect systemic instabilities.

| S-EPMC4219172 | biostudies-literature

Explicit size distributions of failure cascades redefine systemic risk on finite networks.

Project description:How big is the risk that a few initial failures of nodes in a network amplify to large cascades that span a substantial share of all nodes? Predicting the final cascade size is critical to ensure the functioning of a system as a whole. Yet, this task is hampered by uncertain and missing information. In infinitely large networks, the average cascade size can often be estimated by approaches building on local tree and mean field approximations. Yet, as we demonstrate, in finite networks, this average does not need to be a likely outcome. Instead, we find broad and even bimodal cascade size distributions. This phenomenon persists for system sizes up to 107 and different cascade models, i.e. it is relevant for most real systems. To show this, we derive explicit closed-form solutions for the full probability distribution of the final cascade size. We focus on two topological limit cases, the complete network representing a dense network with a very narrow degree distribution, and the star network representing a sparse network with a inhomogeneous degree distribution. Those topologies are of great interest, as they either minimize or maximize the average cascade size and are common motifs in many real world networks.

| S-EPMC5932047 | biostudies-literature

Time-resolved NMR: extracting the topology of complex enzyme networks.

Project description:The use of nondestructive NMR spectroscopy for enzymatic studies offers unique opportunities to identify nearly all enzymatic byproducts and detect unstable short-lived products or intermediates at the molecular level; however, numerous challenges must be overcome before it can become a widely used tool. The biosynthesis of acetyl-coenzyme A (acetyl-CoA) by acetyl-CoA synthetase is used here as a case study for the development of an analytical NMR-based time-course assay platform. We describe an algorithm to deconvolve superimposed spectra into spectra for individual molecules, and further develop a model to simulate the acetyl-CoA synthetase enzyme reaction network using the data derived from time-course NMR. Simulation shows indirectly that synthesis of acetyl-CoA is mediated via an enzyme-bound intermediate (possibly acetyl-AMP) and is accompanied by a nonproductive loss from an intermediate. The ability to predict enzyme function based on partial knowledge of the enzymatic pathway topology is also discussed.

| S-EPMC3195686 | biostudies-literature

Inferring dynamic topology for decoding spatiotemporal structures in complex heterogeneous networks.

Project description:Extracting complex interactions (i.e., dynamic topologies) has been an essential, but difficult, step toward understanding large, complex, and diverse systems including biological, financial, and electrical networks. However, reliable and efficient methods for the recovery or estimation of network topology remain a challenge due to the tremendous scale of emerging systems (e.g., brain and social networks) and the inherent nonlinearity within and between individual units. We develop a unified, data-driven approach to efficiently infer connections of networks (ICON). We apply ICON to determine topology of networks of oscillators with different periodicities, degree nodes, coupling functions, and time scales, arising in silico, and in electrochemistry, neuronal networks, and groups of mice. This method enables the formulation of these large-scale, nonlinear estimation problems as a linear inverse problem that can be solved using parallel computing. Working with data from networks, ICON is robust and versatile enough to reliably reveal full and partial resonance among fast chemical oscillators, coherent circadian rhythms among hundreds of cells, and functional connectivity mediating social synchronization of circadian rhythmicity among mice over weeks.

| S-EPMC6140519 | biostudies-literature

Topology Effects on Sparse Control of Complex Networks with Laplacian Dynamics.

Project description:Ease of control of complex networks has been assessed extensively in terms of structural controllability and observability, and minimum control energy criteria. Here we adopt a sparsity-promoting feedback control framework for undirected networks with Laplacian dynamics and distinct topological features. The control objective considered is to minimize the effect of disturbance signals, magnitude of control signals and cost of feedback channels. We show that depending on the cost of feedback channels, different complex network structures become the least expensive option to control. Specifically, increased cost of feedback channels favors organized topological complexity such as modularity and centralization. Thus, although sparse and heterogeneous undirected networks may require larger numbers of actuators and sensors for structural controllability, networks with Laplacian dynamics are shown to be easier to control when accounting for the cost of feedback channels.

| S-EPMC6588614 | biostudies-literature

DebtRank-transparency: controlling systemic risk in financial networks.

Project description:Nodes in a financial network, such as banks, cannot assess the true risks associated with lending to other nodes in the network, unless they have full information on the riskiness of all other nodes. These risks can be estimated by using network metrics (as DebtRank) of the interbank liability network. With a simple agent based model we show that systemic risk in financial networks can be drastically reduced by increasing transparency, i.e. making the DebtRank of individual banks visible to others, and by imposing a rule, that reduces interbank borrowing from systemically risky nodes. This scheme does not reduce the efficiency of the financial network, but fosters a more homogeneous risk-distribution within the system in a self-organized critical way. The reduction of systemic risk is due to a massive reduction of cascading failures in the transparent system. A regulation-policy implementation of the proposed scheme is discussed.

| S-EPMC3664900 | biostudies-other

Robustness can evolve gradually in complex regulatory gene networks with varying topology.

Project description:The topology of cellular circuits (the who-interacts-with-whom) is key to understand their robustness to both mutations and noise. The reason is that many biochemical parameters driving circuit behavior vary extensively and are thus not fine-tuned. Existing work in this area asks to what extent the function of any one given circuit is robust. But is high robustness truly remarkable, or would it be expected for many circuits of similar topology? And how can high robustness come about through gradual Darwinian evolution that changes circuit topology gradually, one interaction at a time? We here ask these questions for a model of transcriptional regulation networks, in which we explore millions of different network topologies. Robustness to mutations and noise are correlated in these networks. They show a skewed distribution, with a very small number of networks being vastly more robust than the rest. All networks that attain a given gene expression state can be organized into a graph whose nodes are networks that differ in their topology. Remarkably, this graph is connected and can be easily traversed by gradual changes of network topologies. Thus, robustness is an evolvable property. This connectedness and evolvability of robust networks may be a general organizational principle of biological networks. In addition, it exists also for RNA and protein structures, and may thus be a general organizational principle of all biological systems.

| S-EPMC1794322 | biostudies-literature

Personality and complex brain networks: The role of openness to experience in default network efficiency.

Project description:The brain's default network (DN) has been a topic of considerable empirical interest. In fMRI research, DN activity is associated with spontaneous and self-generated cognition, such as mind-wandering, episodic memory retrieval, future thinking, mental simulation, theory of mind reasoning, and creative cognition. Despite large literatures on developmental and disease-related influences on the DN, surprisingly little is known about the factors that impact normal variation in DN functioning. Using structural equation modeling and graph theoretical analysis of resting-state fMRI data, we provide evidence that Openness to Experience-a normally distributed personality trait reflecting a tendency to engage in imaginative, creative, and abstract cognitive processes-underlies efficiency of information processing within the DN. Across two studies, Openness predicted the global efficiency of a functional network comprised of DN nodes and corresponding edges. In Study 2, Openness remained a robust predictor-even after controlling for intelligence, age, gender, and other personality variables-explaining 18% of the variance in DN functioning. These findings point to a biological basis of Openness to Experience, and suggest that normally distributed personality traits affect the intrinsic architecture of large-scale brain systems. Hum Brain Mapp 37:773-779, 2016. © 2015 Wiley Periodicals, Inc.

| S-EPMC4738373 | biostudies-other

Cooperative behavior cascades in human social networks.

Project description:Theoretical models suggest that social networks influence the evolution of cooperation, but to date there have been few experimental studies. Observational data suggest that a wide variety of behaviors may spread in human social networks, but subjects in such studies can choose to befriend people with similar behaviors, posing difficulty for causal inference. Here, we exploit a seminal set of laboratory experiments that originally showed that voluntary costly punishment can help sustain cooperation. In these experiments, subjects were randomly assigned to a sequence of different groups to play a series of single-shot public goods games with strangers; this feature allowed us to draw networks of interactions to explore how cooperative and uncooperative behaviors spread from person to person to person. We show that, in both an ordinary public goods game and in a public goods game with punishment, focal individuals are influenced by fellow group members' contribution behavior in future interactions with other individuals who were not a party to the initial interaction. Furthermore, this influence persists for multiple periods and spreads up to three degrees of separation (from person to person to person to person). The results suggest that each additional contribution a subject makes to the public good in the first period is tripled over the course of the experiment by other subjects who are directly or indirectly influenced to contribute more as a consequence. These results show experimentally that cooperative behavior cascades in human social networks.

| S-EPMC2851803 | biostudies-other

Suppressing cascades of load in interdependent networks.

Project description:Understanding how interdependence among systems affects cascading behaviors is increasingly important across many fields of science and engineering. Inspired by cascades of load shedding in coupled electric grids and other infrastructure, we study the Bak-Tang-Wiesenfeld sandpile model on modular random graphs and on graphs based on actual, interdependent power grids. Starting from two isolated networks, adding some connectivity between them is beneficial, for it suppresses the largest cascades in each system. Too much interconnectivity, however, becomes detrimental for two reasons. First, interconnections open pathways for neighboring networks to inflict large cascades. Second, as in real infrastructure, new interconnections increase capacity and total possible load, which fuels even larger cascades. Using a multitype branching process and simulations we show these effects and estimate the optimal level of interconnectivity that balances their trade-offs. Such equilibria could allow, for example, power grid owners to minimize the largest cascades in their grid. We also show that asymmetric capacity among interdependent networks affects the optimal connectivity that each prefers and may lead to an arms race for greater capacity. Our multitype branching process framework provides building blocks for better prediction of cascading processes on modular random graphs and on multitype networks in general.

| S-EPMC3311366 | 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