Month: March 2024

Cell reprogramming design by transfer learning of functional transcriptional networks

Thomas P. Wytock and Adilson E. Motter

PNAS 121 (11) e2312942121

The lack of genome-wide mathematical models for the gene regulatory network complicates the application of control theory to manipulate cell behavior in humans. We address this challenge by developing a transfer learning approach that leverages genome-wide transcriptomic profiles to characterize cell type attractors and perturbation responses. These responses are used to predict a combinatorial perturbation that minimizes the transcriptional difference between an initial and target cell type, bringing the regulatory network to the target cell type basin of attraction. We anticipate that this approach will enable the rapid identification of potential targets for treatment of complex diseases, while also providing insight into how the dynamics of gene regulatory networks affect phenotype.
Read the full article at: www.pnas.org

Discord in the voter model for complex networks

Antoine Vendeville, Shi Zhou, and Benjamin Guedj
Phys. Rev. E 109, 024312

Online social networks have become primary means of communication. As they often exhibit undesirable effects such as hostility, polarization, or echo chambers, it is crucial to develop analytical tools that help us better understand them. In this paper we are interested in the evolution of discord in social networks. Formally, we introduce a method to calculate the probability of discord between any two agents in the multistate voter model with and without zealots. Our work applies to any directed, weighted graph with any finite number of possible opinions, allows for various update rates across agents, and does not imply any approximation. Under certain topological conditions, the opinions are independent and the joint distribution can be decoupled. Otherwise, the evolution of discord probabilities is described by a linear system of ordinary differential equations. We prove the existence of a unique equilibrium solution, which can be computed via an iterative algorithm. The classical definition of active links density is generalized to take into account long-range, weighted interactions. We illustrate our findings on real-life and synthetic networks. In particular, we investigate the impact of clustering on discord and uncover a rich landscape of varied behaviors in polarized networks. This sheds lights on the evolution of discord between, and within, antagonistic communities.

Bumblebees socially learn behaviour too complex to innovate alone

Alice D. Bridges, Amanda Royka, Tara Wilson, Charlotte Lockwood, Jasmin Richter, Mikko Juusola & Lars Chittka
Nature (2024)

Culture refers to behaviours that are socially learned and persist within a population over time. Increasing evidence suggests that animal culture can, like human culture, be cumulative: characterized by sequential innovations that build on previous ones1. However, human cumulative culture involves behaviours so complex that they lie beyond the capacity of any individual to independently discover during their lifetime1,2,3. To our knowledge, no study has so far demonstrated this phenomenon in an invertebrate. Here we show that bumblebees can learn from trained demonstrator bees to open a novel two-step puzzle box to obtain food rewards, even though they fail to do so independently. Experimenters were unable to train demonstrator bees to perform the unrewarded first step without providing a temporary reward linked to this action, which was removed during later stages of training. However, a third of naive observer bees learned to open the two-step box from these demonstrators, without ever being rewarded after the first step. This suggests that social learning might permit the acquisition of behaviours too complex to ‘re-innovate’ through individual learning. Furthermore, naive bees failed to open the box despite extended exposure for up to 24 days. This finding challenges a common opinion in the field: that the capacity to socially learn behaviours that cannot be innovated through individual trial and error is unique to humans.

Read the full article at: www.nature.com

An “Opinion Reproduction Number” for Infodemics in a Bounded-Confidence Content-Spreading Process on Networks

Heather Z. Brooks, Mason A. Porter

We study the spreading dynamics of content on networks. To do this, we use a model in which content spreads through a bounded-confidence mechanism. In a bounded-confidence model (BCM) of opinion dynamics, the agents of a network have continuous-valued opinions, which they adjust when they interact with agents whose opinions are sufficiently close to theirs. The employed content-spread model introduces a twist into BCMs by using bounded confidence for the content spread itself. To study the spread of content, we define an analogue of the basic reproduction number from disease dynamics that we call an \emph{opinion reproduction number}. A critical value of the opinion reproduction number indicates whether or not there is an “infodemic” (i.e., a large content-spreading cascade) of content that reflects a particular opinion. By determining this critical value, one can determine whether or not an opinion will die off or propagate widely as a cascade in a population of agents. Using configuration-model networks, we quantify the size and shape of content dissemination using a variety of summary statistics, and we illustrate how network structure and spreading model parameters affect these statistics. We find that content spreads most widely when the agents have large expected mean degree or large receptiveness to content. When the amount of content spread only slightly exceeds the critical opinion reproduction number (i.e., the infodemic threshold), there can be longer dissemination trees than when the expected mean degree or receptiveness is larger, even though the total number of content shares is smaller.

Read the full article at: arxiv.org

Emergence of innovations in networked populations with reputation-driven interactions

Pablo Gallarta-Sáenz, Hugo Pérez-Martínez,  Jesús Gómez-Gardeñes

Chaos 34, 033106 (2024)

In this work, we analyze how reputation-based interactions influence the emergence of innovations. To do so, we make use of a dynamic model that mimics the discovery process by which, at each time step, a pair of individuals meet and merge their knowledge to eventually result in a novel technology of higher value. The way in which these pairs are brought together is found to be crucial for achieving the highest technological level. Our results show that when the influence of reputation is weak or moderate, it induces an acceleration of the discovery process with respect to the neutral case (purely random coupling). However, an excess of reputation is clearly detrimental, because it leads to an excessive concentration of knowledge in a small set of people, which prevents a diversification of the technologies discovered and, in addition, leads to societies in which a majority of individuals lack technical capabilities.

Read the full article at: pubs.aip.org