Related papers: A geometric approach to the Global Attractor Conje…
This paper is concerned with the dynamical properties of deterministically modeled chemical reaction systems. Specifically, this paper provides a proof of the Global Attractor Conjecture in the setting where the underlying reaction diagram…
An important dynamical property of biological interaction networks is persistence, which intuitively means that "no species goes extinct". It has been conjectured that dynamical system models of weakly reversible networks (i.e., networks…
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…
The global attractor conjecture says that toric dynamical systems (i.e., a class of polynomial dynamical systems on the positive orthant) have a globally attracting point within each positive linear invariant subspace -- or, equivalently,…
In [Adv. Math., 267(2014), 277-306], Cheskidov and Lu develop a new framework of the evolutionary system that deals directly with the notion of a uniform global attractor due to Haraux, and by which a trajectory attractor is able to be…
Some of the most common mathematical models in biology, chemistry, physics, and engineering, are polynomial dynamical systems, i.e., systems of differential equations with polynomial right-hand sides. Inspired by notions and results that…
In the study of reaction networks and the polynomial dynamical systems that they generate, special classes of networks with important properties have been identified. These include reversible, weakly reversible}, and, more recently,…
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…
We propose a family of models to study the evolution of ties in a network of interacting agents by reinforcement and penalization of their connections according to certain local laws of interaction. The family of stochastic dynamical…
Reaction networks are mainly used to model the time-evolution of molecules of interacting chemical species. Stochastic models are typically used when the counts of the molecules are low, whereas deterministic models are used when the counts…
An abstract framework for studying the asymptotic behavior of a dissipative evolutionary system $\mathcal{E}$ with respect to weak and strong topologies was introduced in [8] primarily to study the long-time behavior of the 3D Navier-Stokes…
We show that for any fixed accuracy and time length $T$, a {\it finite} number of $T$-time length pieces of the complete trajectories on the global attractor are capable of uniformly approximating all trajectories within the accuracy in the…
This paper concerns the dynamical behavior of weakly reversible, deterministically modeled population processes near the facets (codimension-one faces) of their invariant manifolds and proves that the facets of such systems are "repelling."…
In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…
We consider the characterization of global attractors $A_f$ for semiflows generated by scalar one-dimensional semilinear parabolic equations of the form $u_t = u_{xx} + f(u,u_x)$, defined on the circle $x\in S^1$, for a class of reversible…
The analysis of the long-term behavior of the mathematical model of a neural network constitutes a suitable framework to develop new tools for the dynamical description of nonautonomous state-dependent delay equations (SDDEs). The concept…
It has been known for nearly a decade that deterministically modeled reaction networks that are weakly reversible and consist of a single linkage class have trajectories that are bounded from both above and below by positive constants (so…
Pilgrim's Finite Global Attractor Conjecture has been verified for polynomials [1], but remains open for general rational maps. In this paper, we prove the conjecture for a family of rational maps obtained by gluing two PCF polynomials…
For autonomous Lotka-Volterra systems of differential equations modelling the dynamics of n competing species, new criteria are established for the existence of a single point global attractor. Under the conditions of these criteria, some…
Motivated by questions in mass-action kinetics, we introduce the notion of vertexical family of differential inclusions. Defined on open hypercubes, these families are characterized by particular good behavior under projection maps. The…