Complex Systems Studies
2.43K subscribers
1.55K photos
125 videos
116 files
4.54K links
What's up in Complexity Science?!
Check out here:

@ComplexSys

#complexity #complex_systems #networks #network_science

📨 Contact us: @carimi
Download Telegram
🔖 Triangulating War: Network Structure and the Democratic Peace

Benjamin Campbell, Skyler Cranmer, Bruce Desmarais

🔗 https://arxiv.org/pdf/1809.04141

📌 ABSTRACT
Decades of research has found that democratic dyads rarely exhibit violent tendencies, making the democratic peace arguably the principal finding of Peace Science. However, the democratic peace rests upon a dyadic understanding of conflict. Conflict rarely reflects a purely dyadic phenomena---even if a conflict is not multi-party, multiple states may be engaged in distinct disputes with the same enemy. We postulate a network theory of conflict that treats the democratic peace as a function of the competing interests of mixed-regime dyads and the strategic inefficiencies of fighting with enemies' enemies. Specifically, we find that a state's decision to engage in conflict with a target state is conditioned by the other states in which the target state is in conflict. When accounting for this network effect, we are unable to find support for the democratic peace. This suggests that the major finding of three decades worth of conflict research is spurious.
📝Is together better? Examining scientific collaborations across multiple authors, institutions, and departments

🌐 https://arxiv.org/abs/1809.04093

🎲 @ComplexSys
IFISC offers several Ph.D. positions to start by the end of 2018. Applications are welcome immediately until September 21.
t.co/LFxe2EgggI
🔖 Balance in signed networks

Alec Kirkley, George T. Cantwell, M. E. J. Newman

🔗 Download

📌 ABSTRACT
We consider signed networks in which connections or edges can be either positive (friendship, trust, alliance) or negative (dislike, distrust, conflict). Early literature in graph theory theorized that such networks should display "structural balance," meaning that certain configurations of positive and negative edges are favored and others are disfavored. Here we propose two measures of balance in signed networks based on the established notions of weak and strong balance, and compare their performance on a range of tasks with each other and with previously proposed measures. In particular, we ask whether real-world signed networks are significantly balanced by these measures compared to an appropriate null model, finding that indeed they are, by all the measures studied. We also test our ability to predict unknown signs in otherwise known networks by maximizing balance. In a series of cross-validation tests we find that our measures are able to predict signs substantially better than chance.