Related papers: Asymptotic Robustness in Biochemical Systems
The Activated Random Walk (ARW) model is a promising candidate for demonstrating self-organized criticality due to its potential for universality. Recent studies have shown that the ARW model exhibits a well-defined critical density in one…
Pattern formation and evolution in unsynchronizable complex networks are investigated. Due to the asymmetric topology, the synchronous patterns formed in complex networks are irregular and nonstationary. For coupling strength immediately…
Correlations and other collective phenomena in a schematic model of heterogeneous binary agents (individual spin-glass samples) are considered on the complete graph and also on 2d and 3d regular lattices. The system's stochastic dynamics is…
Stability is a critical feature of distributed linear multi-input-multi-output systems. Global asymptotic stability usually can be guaranteed when using decentralised or distributed control architectures, if: (i) conservative controllers…
The popularity of molecular computation has given rise to several models of abstraction, one of the more recent ones being Chemical Reaction Networks (CRNs). These are equivalent to other popular computational models, such as Vector…
This paper establishes a theoretical framework to describe the transition from consensus to stable clustering in multi-agent systems with nonlinear, cooperative interactions. We first establish a sharp threshold for consensus. For a broad…
We study deterministic continuous-time lossy dynamical flow networks with constant exogenous demands, fixed routing, and finite flow and buffer capacities. In the considered model, when the total net flow in a cell ---consisting of the…
We present a uniform method for translating an arbitrary nondeterministic finite automaton (NFA) into a deterministic mass action input/output chemical reaction network (I/O CRN) that simulates it. The I/O CRN receives its input as a…
Unstoppable feedback loops and tipping points in socio-ecological systems are the main threats to sustainability. These behaviors have been extensively studied, notably to predict, and arguably deviate, dead-end trajectories. Behind the…
The question of the local stability of the (replica-symmetric) amorphous solid state is addressed for a class of systems undergoing a continuous liquid to amorphous-solid phase transition driven by the effect of random constraints. The…
Robustness of routing policies for networks is a central problem which is gaining increased attention with a growing awareness to safeguard critical infrastructure networks against natural and man-induced disruptions. Routing under limited…
In this work and the supporting Parts II [2] and III [3], we provide a rather detailed analysis of the stability and performance of asynchronous strategies for solving distributed optimization and adaptation problems over networks. We…
We define am axiomatic timeless framework for asynchronous distributed systems, together with well-formedness and consistency axioms, which unifies and generalizes the expressive power of current approaches. 1) It combines classic…
We present a novel approach to represent ecological systems using reaction networks, and show how a particular framework called Chemical Organization Theory (COT) sheds new light on the longstanding complexity-stability debate. Namely, COT…
By incubating the mixture of three cyanobacterial proteins, KaiA, KaiB, and KaiC, with ATP in vitro, Kondo and his colleagues reconstituted the robust circadian rhythm of the phosphorylation level of KaiC (Science, 308; 414-415 (2005)).…
Asynchronous and parallel implementation of standard reinforcement learning (RL) algorithms is a key enabler of the tremendous success of modern RL. Among many asynchronous RL algorithms, arguably the most popular and effective one is the…
Recent studies on epistatic networks of model organisms have unveiled a certain type of modular property called monochromaticity in which the networks are clusterable into functional modules that interact with each other through the same…
We study the notion of approximate entropy within the framework of network theory. Approximate entropy is an uncertainty measure originally proposed in the context of dynamical systems and time series. We firstly define a purely structural…
Acyclic preferences recently appeared as an elegant way to model many distributed systems. An acyclic instance admits a unique stable configuration, which can reveal the performance of the system. In this paper, we give the statistical…
We investigate the properties of large random conservative chemical reaction networks composed of elementary reactions endowed with either mass-action or saturating kinetics, assigning kinetic parameters in a thermodynamically-consistent…