Browse
Submit Data
Databases
API
Help

Dataset Information

30 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Competition among networks highlights the power of the weak.

ABSTRACT: The unpreventable connections between real networked systems have recently called for an examination of percolation, diffusion or synchronization phenomena in multilayer networks. Here we use network science and game theory to explore interactions in networks-of-networks and model these as a game for gaining importance. We propose a viewpoint where networks choose the connection strategies, in contrast with classical approaches where nodes are the active players. Specifically, we investigate how creating paths between networks leads to different Nash equilibria that determine their structural and dynamical properties. In a wide variety of cases, selecting adequate connections leads to a cooperative solution that allows weak networks to overcome the strongest opponent. Counterintuitively, each weak network can induce a global transition to such cooperative configuration regardless of the actions of the strongest network. This power of the weak reveals a critical dominance of the underdogs in the fate of networks-of-networks.

SUBMITTER: Iranzo J

PROVIDER: S-EPMC5114531 | biostudies-literature | 2016 Nov

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Competition among networks highlights the power of the weak.

Iranzo Jaime J Buldú Javier M JM Aguirre Jacobo J

Nature communications 20161114

The unpreventable connections between real networked systems have recently called for an examination of percolation, diffusion or synchronization phenomena in multilayer networks. Here we use network science and game theory to explore interactions in networks-of-networks and model these as a game for gaining importance. We propose a viewpoint where networks choose the connection strategies, in contrast with classical approaches where nodes are the active players. Specifically, we investigate how ...[more]

PMID: 27841258

Similar Datasets

Dartagnan: Bounded Model Checking for Weak Memory Models (Competition Contribution)

Project description:Dartagnanis a bounded model checker for concurrent programs under weak memory models. What makes it different from other tools is that the memory model is not hard-coded inside Dartagnanbut taken as part of the input. For SV-COMP’20, we take as input sequential consistency (i.e. the standard interleaving memory model) extended by support for atomic blocks. Our point is to demonstrate that a universal tool can be competitive and perform well in SV-COMP. Being a bounded model checker, Dartagnan’s focus is on disproving safety properties by finding counterexample executions. For programs with bounded loops, Dartagnanperforms an iterative unwinding that results in a complete analysis. The SV-COMP’20 version of Dartagnanworks on Boogiecode. The C programs of the competition are translated internally to Boogieusing SMACK.

| S-EPMC7480687 | biostudies-literature

Mutualism supports biodiversity when the direct competition is weak.

Project description:A key question of theoretical ecology is which properties of ecosystems favour their stability and help maintaining biodiversity. This question recently reconsidered mutualistic systems, generating intense controversy about the role of mutualistic interactions and their network architecture. Here we show analytically and verify with simulations that reducing the effective interspecific competition and the propagation of perturbations positively influences structural stability against environmental perturbations, enhancing persistence. Noteworthy, mutualism reduces the effective interspecific competition only when the direct interspecific competition is weaker than a critical value. This critical competition is in almost all cases larger in pollinator networks than in random networks with the same connectance. Highly connected mutualistic networks reduce the propagation of environmental perturbations, a mechanism reminiscent of MacArthur's proposal that ecosystem complexity enhances stability. Our analytic framework rationalizes previous contradictory results, and it gives valuable insight on the complex relationship between mutualism and biodiversity.

| S-EPMC5512850 | biostudies-other

Competition-cooperation relationship networks characterize the competition and cooperation between proteins.

Project description:By analyzing protein-protein interaction (PPI) networks, one can find that a protein may have multiple binding partners. However, it is difficult to determine whether the interactions with these partners occur simultaneously from binary PPIs alone. Here, we construct the yeast and human competition-cooperation relationship networks (CCRNs) based on protein structural interactomes to clearly exhibit the relationship (competition or cooperation) between two partners of the same protein. If two partners compete for the same interaction interface, they would be connected by a competitive edge; otherwise, they would be connected by a cooperative edge. The properties of three kinds of hubs (i.e., competitive, modest, and cooperative hubs) are analyzed in the CCRNs. Our results show that competitive hubs have higher clustering coefficients and form clusters in the human CCRN, but these tendencies are not observed in the yeast CCRN. We find that the human-specific proteins contribute significantly to these differences. Subsequently, we conduct a series of computational experiments to investigate the regulatory mechanisms that avoid competition between proteins. Our comprehensive analyses reveal that for most yeast and human protein competitors, transcriptional regulation plays an important role. Moreover, the human-specific proteins have a particular preference for other regulatory mechanisms, such as alternative splicing.

| S-EPMC4479874 | biostudies-other

Crosstalk and competition in signaling networks.

Project description:Signaling networks have evolved to transduce external and internal information into critical cellular decisions such as growth, differentiation, and apoptosis. These networks form highly interconnected systems within cells due to network crosstalk, where an enzyme from one canonical pathway acts on targets from other pathways. It is currently unclear what types of effects these interconnections can have on the response of networks to incoming signals. In this work, we employ mathematical models to characterize the influence that multiple substrates have on one another. These models build off of the atomistic motif of a kinase/phosphatase pair acting on a single substrate. We find that the ultrasensitive, switch-like response these motifs can exhibit becomes transitive: if one substrate saturates the enzymes and responds ultrasensitively, then all substrates will do so regardless of their degree of saturation. We also demonstrate that the phosphatases themselves can induce crosstalk even when the kinases are independent. These findings have strong implications for how we understand and classify crosstalk, as well as for the rational development of kinase inhibitors aimed at pharmaceutically modulating network behavior.

| S-EPMC3514525 | biostudies-literature

Competition between global and local online social networks.

Project description:The overwhelming success of online social networks, the key actors in the Web 2.0 cosmos, has reshaped human interactions globally. To help understand the fundamental mechanisms which determine the fate of online social networks at the system level, we describe the digital world as a complex ecosystem of interacting networks. In this paper, we study the impact of heterogeneity in network fitnesses on the competition between an international network, such as Facebook, and local services. The higher fitness of international networks is induced by their ability to attract users from all over the world, which can then establish social interactions without the limitations of local networks. In other words, inter-country social ties lead to increased fitness of the international network. To study the competition between an international network and local ones, we construct a 1:1000 scale model of the digital world, consisting of the 80 countries with the most Internet users. Under certain conditions, this leads to the extinction of local networks; whereas under different conditions, local networks can persist and even dominate completely. In particular, our model suggests that, with the parameters that best reproduce the empirical overtake of Facebook, this overtake could have not taken place with a significant probability.

| S-EPMC4846879 | biostudies-other

Reward regulation in plant-frugivore networks requires only weak cues.

Project description:Theory assumes that fair trade among mutualists requires highly reliable communication. In plant-animal mutualisms the reliability of cues that indicate reward quality is often low. Therefore, it is controversial whether communication allows animal mutualists to regulate their reward intake. Here we show that even loose relationships between fruit brightness and nutritional rewards (r2?=?0.11-0.35) allow birds to regulate their nutrient intake across distinct European plant-frugivore networks. Resident, over-wintering generalist frugivores that interact with diverse plant species select bright, lipid-rich fruits, whereas migratory birds select dark, sugar- and antioxidant-rich fruits. Both nutritional strategies are consistent with previous physiological experiments suggesting that over-wintering generalists aim to maximize their energy intake, whereas migrants aim to enhance the build-up of body fat, their immune response and oxidative status during migration. Our results suggest that animal mutualists require only weak cues to regulate their reward intake according to specific nutritional strategies.

| S-EPMC6240120 | biostudies-literature

How rare are power-law networks really?

Project description:The putative scale-free nature of real-world networks has generated a lot of interest in the past 20 years: if networks from many different fields share a common structure, then perhaps this suggests some underlying 'network law'. Testing the degree distribution of networks for power-law tails has been a topic of considerable discussion. Ad hoc statistical methodology has been used both to discredit power-laws as well as to support them. This paper proposes a statistical testing procedure that considers the complex issues in testing degree distributions in networks that result from observing a finite network, having dependent degree sequences and suffering from insufficient power. We focus on testing whether the tail of the empirical degrees behaves like the tail of a de Solla Price model, a two-parameter power-law distribution. We modify the well-known Kolmogorov-Smirnov test to achieve even sensitivity along the tail, considering the dependence between the empirical degrees under the null distribution, while guaranteeing sufficient power of the test. We apply the method to many empirical degree distributions. Our results show that power-law network degree distributions are not rare, classifying almost 65% of the tested networks as having a power-law tail with at least 80% power.

| S-EPMC7544363 | biostudies-literature

Unraveling protein networks with power graph analysis.

Project description:Networks play a crucial role in computational biology, yet their analysis and representation is still an open problem. Power Graph Analysis is a lossless transformation of biological networks into a compact, less redundant representation, exploiting the abundance of cliques and bicliques as elementary topological motifs. We demonstrate with five examples the advantages of Power Graph Analysis. Investigating protein-protein interaction networks, we show how the catalytic subunits of the casein kinase II complex are distinguishable from the regulatory subunits, how interaction profiles and sequence phylogeny of SH3 domains correlate, and how false positive interactions among high-throughput interactions are spotted. Additionally, we demonstrate the generality of Power Graph Analysis by applying it to two other types of networks. We show how power graphs induce a clustering of both transcription factors and target genes in bipartite transcription networks, and how the erosion of a phosphatase domain in type 22 non-receptor tyrosine phosphatases is detected. We apply Power Graph Analysis to high-throughput protein interaction networks and show that up to 85% (56% on average) of the information is redundant. Experimental networks are more compressible than rewired ones of same degree distribution, indicating that experimental networks are rich in cliques and bicliques. Power Graphs are a novel representation of networks, which reduces network complexity by explicitly representing re-occurring network motifs. Power Graphs compress up to 85% of the edges in protein interaction networks and are applicable to all types of networks such as protein interactions, regulatory networks, or homology networks.

| S-EPMC2424176 | biostudies-literature

Weak value amplification: a view from quantum estimation theory that highlights what it is and what isn't.

Project description:Weak value amplification (WVA) is a concept that has been extensively used in a myriad of applications with the aim of rendering measurable tiny changes of a variable of interest. In spite of this, there is still an on-going debate about its true nature and whether is really needed for achieving high sensitivity. Here we aim at helping to clarify the puzzle, using a specific example and some basic concepts from quantum estimation theory, highlighting what the use of the WVA concept can offer and what it can not. While WVA cannot be used to go beyond some fundamental sensitivity limits that arise from considering the full nature of the quantum states, WVA can notwithstanding enhance the sensitivity of real and specific detection schemes that are limited by many other things apart from the quantum nature of the states involved, i.e. technical noise. Importantly, it can do that in a straightforward and easily accessible manner.

| S-EPMC4735286 | biostudies-other

Hierarchical networks, power laws, and neuronal avalanches.

Project description:We show that in networks with a hierarchical architecture, critical dynamical behaviors can emerge even when the underlying dynamical processes are not critical. This finding provides explicit insight into current studies of the brain's neuronal network showing power-law avalanches in neural recordings, and provides a theoretical justification of recent numerical findings. Our analysis shows how the hierarchical organization of a network can itself lead to power-law distributions of avalanche sizes and durations, scaling laws between anomalous exponents, and universal functions-even in the absence of self-organized criticality or critical points. This hierarchy-induced phenomenon is independent of, though can potentially operate in conjunction with, standard dynamical mechanisms for generating power laws.

| S-EPMC3606226 | biostudies-other

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