Related papers: Weakly reversible single linkage class realization…
We consider chemical reaction networks taken with mass action kinetics. The steady states of such a system are solutions to a system of polynomial equations. Even for small systems the task of finding the solutions is daunting. We develop…
Learning by interaction is the key to skill acquisition for most living organisms, which is formally called Reinforcement Learning (RL). RL is efficient in finding optimal policies for endowing complex systems with sophisticated behavior.…
We study skew-orthogonal polynomials with respect to the weight function $\exp[-2V(x)]$, with $V(x)=\sum_{K=1}^{2d}(u_{K}/{K})x^{K}$, $u_{2d} > 0$, $d > 0$. A finite subsequence of such skew-orthogonal polynomials arising in the study of…
We prove that if a given reaction network $\mathcal{N}$ has a weakly reversible deficiency zero realization for all choice of rate constants, then there exists a $\textit{unique}$ weakly reversible deficiency zero network $\mathcal{N}'$…
We study $2$-neighbor one-dimensional cellular automata with a large number $n$ of states and randomly selected rules. We focus on the rules with weakly robust periodic solutions (WRPS). WRPS are global configurations that exhibit spatial…
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 investigate the existence of weak solutions to a multi-component system, consisting of compressible chemically reacting components, coupled with the compressible Stokes equation for the velocity. Specifically, we consider the case of…
Differential equations are a ubiquitous tool to study dynamics, ranging from physical systems to complex systems, where a large number of agents interact through a graph with non-trivial topological features. Data-driven approximations of…
We prove a maximal-type large deviation principle for dynamical systems with arbitrarily slow polynomial mixing rates. Also several applications, particularly to billiard systems, are presented.
We study families of polynomial dynamical systems inspired by biochemical reaction networks. We focus on complex balanced mass-action systems, which have also been called toric. They are known or conjectured to enjoy very strong dynamical…
Discrete dynamics arise naturally in systems with broken temporal translation symmetry and are typically described by first-order recurrence relations representing classical or quantum Markov chains. When memory effects induced by hidden…
In this work we characterize a full Kostant-Toda system in terms of a family of matrix polynomials orthogonal with respect to a complex matrix measure. In order to study the solution of this dynamical system we give explicit expressions for…
System identification of complex and nonlinear systems is a central problem for model predictive control and model-based reinforcement learning. Despite their complexity, such systems can often be approximated well by a set of linear…
In this paper, we study extinction in dynamical systems generated by reaction networks. We introduce two notions: weak extinction and strong extinction, and relate them to the structure of the underlying network through Lyapunov functions…
We propose a new family of regression models for analyzing categorical responses, called multinomial link models. It consists of four classes, namely, mixed-link models that generalize existing multinomial logistic models and their…
Mathematical models of the real world are simplified representations of complex systems. A caveat to using mathematical models is that predicted causal effects and conditional independences may not be robust under model extensions, limiting…
Dynamical systems arising from chemical reaction networks with mass action kinetics are the subject of chemical reaction network theory (CRNT). In particular, this theory provides statements about uniqueness, existence, and stability of…
This paper introduces algorithms for problems where a decision maker has to control a system composed of several components and has access to only partial information on the state of each component. Such problems are difficult because of…
In the first part of this paper, we propose new optimization-based methods for the computation of preferred (dense, sparse, reversible, detailed and complex balanced) linearly conjugate reaction network structures with mass action dynamics.…
We investigate the possibility that for any given reaction rate vector $k$ associated with a network $G$, there exists another network $G'$ with a corresponding reaction rate vector that reproduces the mass-action dynamics generated by…