Related papers: First order endotactic reaction networks
The problem of achieving consensus in a network of connected systems arises in many science and engineering applications. In contrast to previous works, we focus on the system reactivity, i.e., the initial amplification of the norm of the…
Within a fully microscopic setting, we derive a variational principle for the non-equilibrium steady states of chemical reaction networks, valid for time-scales over which chemical potentials can be taken to be slowly varying: at…
Robust heteroclinic networks are invariant sets that can appear as attractors in symmetrically coupled or otherwise constrained dynamical systems. These networks may have a very complicated structure that is poorly understood and determined…
Living in a complex world like ours makes it unacceptable that a practical implementation of a machine learning system assumes a closed world. Therefore, it is necessary for such a learning-based system in a real world environment, to be…
This paper concerns the long-term behavior of population systems, and in particular of chemical reaction systems, modeled by deterministic mass-action kinetics. We approach two important open problems in the field of Chemical Reaction…
Proximity networks are time-varying graphs representing the closeness among humans moving in a physical space. Their properties have been extensively studied in the past decade as they critically affect the behavior of spreading phenomena…
Networked dynamical systems, i.e., systems of dynamical units coupled via nontrivial interaction topologies, constitute models of broad classes of complex systems, ranging from gene regulatory and metabolic circuits in our cells to…
We present a systematic procedure for testing whether reaction networks exhibit non-expansivity or monotonicity. This procedure identifies explicit norms under which a network is non-expansive or cones for which the system is monotone-or…
In the modelling of stochastic phenomena, such as quasi-reaction systems, parameter estimation of kinetic rates can be challenging, particularly when the time gap between consecutive measurements is large. Local linear approximation…
For dynamical systems arising from chemical reaction networks, persistence is the property that each species concentration remains positively bounded away from zero, as long as species concentrations were all positive in the beginning. We…
A natural condition on the structure of the underlying chemical reaction network, namely weak reversibility, is shown to guarantee the existence of an equilibrium (steady state) in each positive stoichiometric compatibility class for the…
We answer several fundamental geometric questions about reaction networks with power-law kinetics, on topics such as generic finiteness of the number of steady states, robustness, and nondegenerate multistationarity. In particular, we give…
The aim of this paper is to analyze a class of consensus algorithms with finite-time or fixed-time convergence for dynamic networks formed by agents with first-order dynamics. In particular, in the analyzed class a single evaluation of a…
We introduce a mixed-integer linear programming (MILP) framework capable of determining whether a chemical reaction network possesses the property of being endotactic or strongly endotactic. The network property of being strongly endotactic…
Chemical reaction network theory is a field of applied mathematics concerned with modeling chemical systems, and can be used in other contexts such as in systems biology to study cellular signaling pathways or epidemiology to study the…
It has recently been shown that structural conditions on the reaction network, rather than a 'fine-tuning' of system parameters, often suffice to impart 'absolute concentration robustness' on a wide class of biologically relevant,…
We develop a general classification of the nature of the instabilities yielding spatial organization in open nonideal reaction-diffusion systems, based on linear stability analysis. This encompasses dynamics where chemical species diffuse,…
A graph class $\mathscr{C}$ is called monadically stable if one cannot interpret, in first-order logic, arbitrary large linear orders in colored graphs from $\mathscr{C}$. We prove that the model checking problem for first-order logic is…
A stochastic reaction-diffusion model is studied on a networked support. In each patch of the network two species are assumed to interact following a non-normal reaction scheme. When the interaction unit is replicated on a directed linear…
Chemical kinetics and reaction engineering consists of the phenomenological framework for the disentanglement of reaction mechanisms, optimization of reaction performance and the rational design of chemical processes. Here, we utilize…