Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

The Dynamics of Coalition Formation on Complex Networks.

ABSTRACT: Complex networks describe the structure of many socio-economic systems. However, in studies of decision-making processes the evolution of the underlying social relations are disregarded. In this report, we aim to understand the formation of self-organizing domains of cooperation ("coalitions") on an acquaintance network. We include both the network's influence on the formation of coalitions and vice versa how the network adapts to the current coalition structure, thus forming a social feedback loop. We increase complexity from simple opinion adaptation processes studied in earlier research to more complex decision-making determined by costs and benefits, and from bilateral to multilateral cooperation. We show how phase transitions emerge from such coevolutionary dynamics, which can be interpreted as processes of great transformations. If the network adaptation rate is high, the social dynamics prevent the formation of a grand coalition and therefore full cooperation. We find some empirical support for our main results: Our model develops a bimodal coalition size distribution over time similar to those found in social structures. Our detection and distinguishing of phase transitions may be exemplary for other models of socio-economic systems with low agent numbers and therefore strong finite-size effects.

SUBMITTER: Auer S

PROVIDER: S-EPMC4548196 | biostudies-other | 2015

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Similar Datasets

Competitive dynamics on complex networks.

Project description:We consider a dynamical network model in which two competitors have fixed and different states, and each normal agent adjusts its state according to a distributed consensus protocol. The state of each normal agent converges to a steady value which is a convex combination of the competitors' states, and is independent of the initial states of agents. This implies that the competition result is fully determined by the network structure and positions of competitors in the network. We compute an Influence Matrix (IM) in which each element characterizing the influence of an agent on another agent in the network. We use the IM to predict the bias of each normal agent and thus predict which competitor will win. Furthermore, we compare the IM criterion with seven node centrality measures to predict the winner. We find that the competitor with higher Katz Centrality in an undirected network or higher PageRank in a directed network is most likely to be the winner. These findings may shed new light on the role of network structure in competition and to what extent could competitors adjust network structure so as to win the competition.

| S-EPMC5376163 | biostudies-literature

Targeting the dynamics of complex networks.

Project description:We report on a generic procedure to steer (target) a network's dynamics towards a given, desired evolution. The problem is here tackled through a Master Stability Function approach, assessing the stability of the aimed dynamics, and through a selection of nodes to be targeted. We show that the degree of a node is a crucial element in this selection process, and that the targeting mechanism is most effective in heterogeneous scale-free architectures. This makes the proposed approach applicable to the large majority of natural and man-made networked systems.

| S-EPMC3343324 | biostudies-other

Steering complex networks toward desired dynamics.

Project description:We consider networks of dynamical units that evolve in time according to different laws, and are coupled to each other in highly irregular ways. Studying how to steer the dynamics of such systems towards a desired evolution is of great practical interest in many areas of science, as well as providing insight into the interplay between network structure and dynamical behavior. We propose a pinning protocol for imposing specific dynamic evolutions compatible with the equations of motion on a networked system. The method does not impose any restrictions on the local dynamics, which may vary from node to node, nor on the interactions between nodes, which may adopt in principle any nonlinear mathematical form and be represented by weighted, directed or undirected links. We first explore our method on small synthetic networks of chaotic oscillators, which allows us to unveil a correlation between the ordered sequence of pinned nodes and their topological influence in the network. We then consider a 12-species trophic web network, which is a model of a mammalian food web. By pinning a relatively small number of species, one can make the system abandon its spontaneous evolution from its (typically uncontrolled) initial state towards a target dynamics, or periodically control it so as to make the populations evolve within stipulated bounds. The relevance of these findings for environment management and conservation is discussed.

| S-EPMC7695727 | biostudies-literature

Amplitude dynamics favors synchronization in complex networks.

Project description:In this paper we study phase synchronization in random complex networks of coupled periodic oscillators. In particular, we show that, when amplitude dynamics is not negligible, phase synchronization may be enhanced. To illustrate this, we compare the behavior of heterogeneous units with both amplitude and phase dynamics and pure (Kuramoto) phase oscillators. We find that in small network motifs the behavior crucially depends on the topology and on the node frequency distribution. Surprisingly, the microscopic structures for which the amplitude dynamics improves synchronization are those that are statistically more abundant in random complex networks. Thus, amplitude dynamics leads to a general lowering of the synchronization threshold in arbitrary random topologies. Finally, we show that this synchronization enhancement is generic of oscillators close to Hopf bifurcations. To this aim we consider coupled FitzHugh-Nagumo units modeling neuron dynamics.

| S-EPMC4842998 | biostudies-other

System crash as dynamics of complex networks.

Project description:Complex systems, from animal herds to human nations, sometimes crash drastically. Although the growth and evolution of systems have been extensively studied, our understanding of how systems crash is still limited. It remains rather puzzling why some systems, appearing to be doomed to fail, manage to survive for a long time whereas some other systems, which seem to be too big or too strong to fail, crash rapidly. In this contribution, we propose a network-based system dynamics model, where individual actions based on the local information accessible in their respective system structures may lead to the "peculiar" dynamics of system crash mentioned above. Extensive simulations are carried out on synthetic and real-life networks, which further reveal the interesting system evolution leading to the final crash. Applications and possible extensions of the proposed model are discussed.

| S-EPMC5081585 | biostudies-literature

Asymmetrically interacting spreading dynamics on complex layered networks.

Project description:The spread of disease through a physical-contact network and the spread of information about the disease on a communication network are two intimately related dynamical processes. We investigate the asymmetrical interplay between the two types of spreading dynamics, each occurring on its own layer, by focusing on the two fundamental quantities underlying any spreading process: epidemic threshold and the final infection ratio. We find that an epidemic outbreak on the contact layer can induce an outbreak on the communication layer, and information spreading can effectively raise the epidemic threshold. When structural correlation exists between the two layers, the information threshold remains unchanged but the epidemic threshold can be enhanced, making the contact layer more resilient to epidemic outbreak. We develop a physical theory to understand the intricate interplay between the two types of spreading dynamics.

| S-EPMC4037715 | biostudies-literature

Optimal partition and effective dynamics of complex networks.

Project description:Given a large and complex network, we would like to find the best partition of this network into a small number of clusters. This question has been addressed in many different ways. Here we propose a strategy along the lines of optimal prediction for the Markov chains associated with the dynamics on these networks. We develop the necessary ingredients for such an optimal partition strategy, and we compare our strategy with the previous ones. We show that when the Markov chain is lumpable, we recover the partition with respect to which the chain is lumpable. We also discuss the case of well-clustered networks. Finally, we illustrate our strategy on several examples.

| S-EPMC2786939 | biostudies-literature

Deep learning of contagion dynamics on complex networks.

Project description:Forecasting the evolution of contagion dynamics is still an open problem to which mechanistic models only offer a partial answer. To remain mathematically or computationally tractable, these models must rely on simplifying assumptions, thereby limiting the quantitative accuracy of their predictions and the complexity of the dynamics they can model. Here, we propose a complementary approach based on deep learning where effective local mechanisms governing a dynamic on a network are learned from time series data. Our graph neural network architecture makes very few assumptions about the dynamics, and we demonstrate its accuracy using different contagion dynamics of increasing complexity. By allowing simulations on arbitrary network structures, our approach makes it possible to explore the properties of the learned dynamics beyond the training data. Finally, we illustrate the applicability of our approach using real data of the COVID-19 outbreak in Spain. Our results demonstrate how deep learning offers a new and complementary perspective to build effective models of contagion dynamics on networks.

| S-EPMC8342694 | biostudies-literature

Molecular dynamics simulations of DNA-polycation complex formation.

Project description:Complexes formed from DNA and polycations are of interest because of their potential use in gene therapy; however, there remains a lack of understanding of the structure and formation of DNA-polycation complexes at atomic scale. In this work, molecular dynamics simulations of the DNA duplex d(CGCGAATTCGCG) in the presence of polycation chains are carried out to shed light on the specific atomic interaction that result in complex formation. The structures of complexes formed from DNA with polyethylenimine, which is considered one of the most promising DNA vector candidates, and a second polycation, poly-L-lysine, are compared. After an initial separation of approximately 50 A, the DNA and polycation come together and form a stable complex within 10 ns. The DNA does not undergo any major structural changes on complexation and remains in the B-form. In the formed complex, the charged amine groups of the polycation mainly interact with DNA phosphate groups, with polycation intrusion into the major and minor grooves dependent on the identity and charge state of the polycation. The ability of the polycation to effectively neutralize the charge of the DNA phosphate groups and the resulting influence on the DNA helix interaction are discussed.

| S-EPMC2756393 | biostudies-literature

Dynamics and consequences of spliceosome E complex formation.

Project description:The spliceosome must identify the correct splice sites (SS) and branchsite (BS) used during splicing. E complex is the earliest spliceosome precursor in which the 5' SS and BS are defined. Definition occurs by U1 small nuclear ribonucleoprotein (snRNP) binding the 5' SS and recognition of the BS by the E complex protein (ECP) branchpoint bridging protein (BBP). We have used single molecule fluorescence to study Saccharomyces cerevisiae U1 and BBP interactions with RNAs. E complex is dynamic and permits frequent redefinition of the 5' SS and BS. BBP influences U1 binding at the 5' SS by promoting long-lived complex formation. ECPs facilitate U1 association with RNAs with weak 5' SS and prevent U1 accumulation on RNAs containing hyperstabilized 5' SS. The data reveal a mechanism for how U1 binds the 5' SS and suggest that E complex harnesses this mechanism to stimulate recruitment and retention of U1 on introns.

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