Scaling up the self-optimization model by means of on-the-fly computation of weights

Natalya Weber; Werner Koch; Tom Froese

The Self-Optimization (SO) model is a useful computational model for investigating self-organization in “soft” Artificial life (ALife) as it has been shown to be general enough to model various complex adaptive systems. So far, existing work has been done on relatively small network sizes, precluding the investigation of novel phenomena that might emerge from the complexity arising from large numbers of nodes interacting in interconnected networks. This work introduces a novel implementation of the SO model that scales as O(N2) with respect to the number of nodes N, and demonstrates the applicability of the SO model to networks with system sizes several orders of magnitude higher than previously was investigated. Removing the prohibitive computational cost of the naive O(N3) algorithm, our on-the-fly computation paves the way for investigating substantially larger system sizes, allowing for more variety and complexity in future studies.

Read the full article at: ieeexplore.ieee.org

Complexity Explorables | The Prisoner’s Kaleidoscope

This explorable illustrates beautiful dynamical patterns that can be generated by a simple game theoretic model on a lattice. The core of the model is the Prisoner’s Dilemma, a legendary game analyzed in game theory. In the game, two players can choose to cooperate or defect. Depending on their choice, they receive a pre-specified payoffs. The payoffs are chosen such that it seems difficult to make the right strategy choice.

Read the full article at: www.complexity-explorables.org

Complexity72h

Complexity72h is an interdisciplinary workshop for young researchers in complex systems. Participants form teams and carry out projects in a three days’ time, i.e. 72 hours. The goal of each team is to upload on the arXiv (or similar repositories) a report of their work by the end of the event. The editions of 2018 and 2019 were a success: 11 out of 11 projects became arXiv preprints and new collaborations were born. Complexity72h is back for a 2023 edition, which will take place in Palma (Mallorca, Spain) on June 26-30.

More info & application: www.complexity72h.com 
Deadline for applications: March 1st 2023

Effective Connectivity and Bias Entropy Improve Prediction of Dynamical Regime in Automata Networks

Felipe Xavier Costa, Jordan C. Rozum, Austin M. Marcus, and Luis M. Rocha

Entropy 2023, 25(2), 374

Biomolecular network dynamics are thought to operate near the critical boundary between ordered and disordered regimes, where large perturbations to a small set of elements neither die out nor spread on average. A biomolecular automaton (e.g., gene, protein) typically has high regulatory redundancy, where small subsets of regulators determine activation via collective canalization. Previous work has shown that effective connectivity, a measure of collective canalization, leads to improved dynamical regime prediction for homogeneous automata networks. We expand this by (i) studying random Boolean networks (RBNs) with heterogeneous in-degree distributions, (ii) considering additional experimentally validated automata network models of biomolecular processes, and (iii) considering new measures of heterogeneity in automata network logic. We found that effective connectivity improves dynamical regime prediction in the models considered; in RBNs, combining effective connectivity with bias entropy further improves the prediction. Our work yields a new understanding of criticality in biomolecular networks that accounts for collective canalization, redundancy, and heterogeneity in the connectivity and logic of their automata models. The strong link we demonstrate between criticality and regulatory redundancy provides a means to modulate the dynamical regime of biochemical networks.

Read the full article at: www.mdpi.com