Month: August 2024

Improving the controllability robustness of complex temporal networks against intelligent attacks

Qian Zhang, Peyman Arebi
Journal of Complex Networks, Volume 12, Issue 4, August 2024, cnae027,

The main goal of controllability network methods on complex temporal networks is to control all nodes with the minimum number of control nodes. Real-world complex temporal networks are faced with many errors and attacks that cause the network structure to be changed in some way so that the controllability processes are disturbed and after that, the controllability robustness of the network decreases. One of the most important attacks on complex temporal networks is intelligent attacks. In this paper, the types of intelligent attacks and their destructive effects on the controllability of complex temporal networks have been investigated. In order to increase the controllability robustness of the network against intelligent attacks, a novel graph model and strategies have been proposed on complex dynamic graph by adding new control nodes or adding new links to the network so that the network is protected against intelligent attacks. The results of simulation and comparing them with conventional methods demonstrate that the proposed node addition strategy has performed better than other methods and the improvement rate in terms of execution time is 60%. On the other hand, the proposed immunization strategy by adding links has kept the network controllable with a smaller number of links (38%) and less execution time (52%) compared to other methods.

Read the full article at: academic.oup.com

Cell–Cell Interactions: How Coupled Boolean Networks Tend to Criticality

Michele Braccini, Paolo Baldini, Andrea Roli

Artificial Life

Biological cells are usually operating in conditions characterized by intercellular signaling and interaction, which are supposed to strongly influence individual cell dynamics. In this work, we study the dynamics of interacting random Boolean networks, focusing on attractor properties and response to perturbations. We observe that the properties of isolated critical Boolean networks are substantially maintained also in interaction settings, while interactions bias the dynamics of chaotic and ordered networks toward that of critical cells. The increase in attractors observed in multicellular scenarios, compared to single cells, allows us to hypothesize that biological processes, such as ontogeny and cell differentiation, leverage interactions to modulate individual and collective cell responses.

Read the full article at: direct.mit.edu

Imitation versus serendipity in ranking dynamics

Federica De Domenico , Fabio Caccioli , Giacomo Livan , Guido Montagna and Oreste Nicrosini

Royal Society Open Science, July 2024 Volume 11 Issue 7

Participants in socio-economic systems are often ranked based on their performance. Rankings conveniently reduce the complexity of such systems to ordered lists. Yet, it has been shown in many contexts that those who reach the top are not necessarily the most talented, as chance plays a role in shaping rankings. Nevertheless, the role played by chance in determining success, i.e. serendipity, is underestimated, and top performers are often imitated by others under the assumption that adopting their strategies will lead to equivalent results. We investigate the tradeoff between imitation and serendipity in an agent-based model. Agents in the model receive payoffs based on their actions and may switch to different actions by either imitating others or through random selection. When imitation prevails, most agents coordinate on a single action, leading to non-meritocratic outcomes, as a minority of them accumulate the majority of payoffs. Yet, such agents are not necessarily the most skilled ones. When serendipity dominates, instead, we observe more egalitarian outcomes. The two regimes are separated by a sharp transition, which we characterize analytically in a simplified setting. We discuss the implications of our findings in a variety of contexts, ranging from academic research to business.

Read the full article at: royalsocietypublishing.org

Causal Leverage Density: A General Approach to Semantic Information

Stuart J Bartlett

I introduce a new approach to semantic information based upon the influence of erasure operations (interventions) upon distributions of a system’s future trajectories through its phase space. Semantic (meaningful) information is distinguished from syntactic information by the property of having some intrinsic causal power on the future of a given system. As Shannon famously stated, syntactic information is a simple property of probability distributions (the elementary Shannon expression), or correlations between two subsystems and thus does not tell us anything about the meaning of a given message. Kolchinsky & Wolpert (2018) introduced a powerful framework for computing semantic information, which employs interventions upon the state of a system (either initial or dynamic) to erase syntactic information that might influence the viability of a subsystem (such as an organism in an environment). In this work I adapt this framework such that rather than using the viability of a subsystem, we simply observe the changes in future trajectories through a system’s phase space as a result of informational interventions (erasures or scrambling). This allows for a more general formalisation of semantic information that does not assume a primary role for the viability of a subsystem (to use examples from Kolchinsky & Wolpert (2018), a rock, a hurricane, or a cell). Many systems of interest have a semantic component, such as a neural network, but may not have such an intrinsic connection to viability as living organisms or dissipative structures. Hence this simple approach to semantic information could be applied to any living, non-living or technological system in order to quantify whether a given quantity of syntactic information within it also has semantic or causal power.

Read the full article at: arxiv.org

Self-Organizing Systems: What, How, and Why?

Carlos Gershenson

I present a personal account of self-organizing systems. As such, it is necessarily biased and partial. Nevertheless, it should be useful to motivate useful discussions. The relevant contribution is not my attempts at answering questions (maybe all my answers are wrong), but the steps towards framing relevant questions to better understand self-organization, information, complexity, and emergence. With this aim, I start with a notion and examples of self-organizing systems (what?), continue with their properties and related concepts (how?), and close with applications (why?).

Read the full article at: www.preprints.org