Motifs enable communication efficiency and fault-tolerance in transcriptional networks

How synchronized human networks escape local minima

Finding the global minimum in complex networks while avoiding local minima is challenging in many types of networks. In human networks and communities, adapting and finding new stable states amid changing conditions due to conflicts, climate changes, or disasters, is crucial. We studied the dynamics of complex networks of violin players and observed that such human networks have different methods to avoid local minima than other non-human networks. Humans can change the coupling strength between them or change their tempo. This leads to different dynamics than other networks and makes human networks more robust and better resilient against perturbations. We observed high-order vortex states, oscillation death, and amplitude death, due to the unique dynamics of the network. This research may have implications in politics, economics, pandemic control, decision-making, and predicting the dynamics of networks with artificial intelligence.

Generation of Realistic Gene Regulatory Networks by Enriching for Feed-Forward Loops

The regulatory relationships between genes and proteins in a cell form a gene regulatory network (GRN) that controls the cellular response to changes in the environment. A number of inference methods to reverse engineer the original GRN from large-scale expression data have recently been developed. However, the absence of ground-truth GRNs when evaluating the performance makes realistic simulations of GRNs necessary. One aspect of this is that local network motif analysis of real GRNs indicates that the feed-forward loop (FFL) is significantly enriched. To simulate this properly, we developed a novel motif-based preferential attachment algorithm, FFLatt, which outperformed the popular GeneNetWeaver network generation tool in reproducing the FFL motif occurrence observed in literature-based biological GRNs. It also preserves important topological properties such as scale-free topology, sparsity, and average in/out-degree per node. We conclude that FFLatt is well-suited as a network generation module for a benchmarking framework with the aim to provide fair and robust performance evaluation of GRN inference methods.