SearcharxivSearch

arXiv subjects

Jiaxin Jin

Publications and source records attributed to Jiaxin Jin.

At least 19 recordsLinked to original sources

Implementation of Linear Regression and Linear Interpolation using Reaction Networks

Statistical inference is a fundamental component of data science. In this work, we focus on two classical inference techniques: regression and interpolation. We propose a reaction-network-based framework for implementing linear regression, including both univariate and multivariate settings, as well as linear interpolation. Our approach encodes the outputs of these inference techniques in the steady-state concentrations of species within the reaction network. A key ingredient of the construction is a novel generalized division module capable of handling division involving negative numbers. We validate the proposed framework through in silico implementations on standard synthetic datasets and obtain the expected regression and interpolation outputs.

q-bio.MN

A flux-based approach for analyzing the disguised toric locus of reaction networks

Dynamical systems with polynomial right-hand sides are very important in various applications, e.g., in biochemistry and population dynamics. The mathematical study of these dynamical systems is challenging due to the possibility of multistability, oscillations, and chaotic dynamics. One important tool for this study is the concept of reaction systems, which are dynamical systems generated by reaction networks for some choices of parameter values. Among these, disguised toric systems are remarkably stable: they have a unique attracting fixed point, and cannot give rise to oscillations or chaotic dynamics. The computation of the set of parameter values for which a network gives rise to disguised toric systems (i.e., the disguised toric locus of the network) is an important but difficult task. We introduce new ideas based on network fluxes for studying the disguised toric locus. We prove, under mild assumptions, that the disguised toric locus of any network $G$ is a contractible manifold with boundary, and introduce an associated graph $G^{\max}$ that characterizes its interior. These theoretical tools allow us, for the first time, to compute the full disguised toric locus for many networks of interest.

math.DS

Stationary Vlasov-Poisson-Boltzmann system in a convex domain

We study the stationary and dynamical Vlasov-Poisson-Boltzmann system in a bounded, convex domain subject to a confining external potential field. For the stationary problem, we construct a unique stationary solution with an inflow boundary condition. A key difficulty is to obtain pointwise regularity for stationary solutions due to the intricate coupling between the self-consistent electric field and the Boltzmann collision operator. To overcome this issue, we establish a $W^{1,p}_{x,v}$--$αC^1_{x,v}$ bootstrap framework and derive an unweighted $C^1_v$ estimate by exploiting the structure of the external potential field. We then investigate the dynamical Vlasov-Poisson-Boltzmann system near the stationary solution. We prove the global existence and uniqueness of solutions for small perturbations and establish exponential convergence toward the stationary state in weighted $L^\infty$ norms. Our results reveal the stabilizing effect of the external potential field and provide a framework for the stationary and dynamical theories of the Vlasov-Poisson-Boltzmann system in bounded domains.

math.AP

Implementation of Support Vector Machines using Reaction Networks

Can machine learning algorithms be implemented using chemistry? We demonstrate that this is possible in the case of support vector machines (SVMs). SVMs are powerful tools for data classification, leveraging Vapnik-Chervonenkis theory to handle high-dimensional data and small datasets effectively. In this work, we propose a chemical reaction network scheme for implementing SVMs, utilizing the steady-state behavior of reaction network dynamics to model key computational aspects of SVMs. This approach introduces a novel biochemical framework for implementing machine learning algorithms in non-traditional computational environments.

q-bio.MN

Extinction in Reaction Network Models

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 and LaSalle's invariance principle. In particular, for all deficiency-zero networks that are not weakly reversible, we provide a geometric construction of linear Lyapunov functions. Using these functions, we establish that if these networks have bounded invariant subspaces, then they must exhibit weak extinction within every such subspace. Also, for linear networks that are not weakly reversible, we show that every species outside a terminal strongly connected component undergoes strong extinction. Moreover, in order to further emphasize the difference between weak and strong extinction, we construct an example of a reaction system (based on the Ivanova network) that exhibits weak extinction for all the species, but does not exhibit strong extinction in any species.

math.DS

The Computation of the Disguised Toric Locus of Reaction Networks

Mathematical models of reaction networks can exhibit very complex dynamics, including multistability, oscillations, and chaotic dynamics. On the other hand, under some additional assumptions on the network or on parameter values, these models may actually be toric dynamical systems, which have remarkably stable dynamics. The concept of disguised toric dynamical system" was introduced in order to describe the phenomenon where a reaction network generates toric dynamics without actually being toric; such systems enjoy all the stability properties of toric dynamical systems but with much fewer restrictions on the networks and parameter values. The \emph{disguised toric locus} is the set of parameter values for which the corresponding dynamical system is a disguised toric system. Here we focus on providing a generic and efficient method for computing the dimension of the disguised toric locus of reaction networks. Additionally, we illustrate our approach by applying it to some specific models of biological interaction networks, including Brusselator-type networks, Thomas-type networks, and circadian clock networks.

math.DS

The Dimension of the Disguised Toric Locus of a Reaction Network

Under mass-action kinetics, complex-balanced systems emerge from biochemical reaction networks and exhibit stable and predictable dynamics. For a reaction network $G$, the associated dynamical system is called $\textit{disguised toric}$ if it can yield a complex-balanced realization on a possibly different network $G_1$. This concept extends the robust properties of toric systems to those that are not inherently toric. In this work, we study the $\textit{disguised toric locus}$ of a reaction network - i.e., the set of positive rate constants that make the corresponding mass-action system disguised toric. Our primary focus is to compute the exact dimension of this locus. We subsequently apply our results to Thomas-type and circadian clock models.

q-bio.MN

Homeostasis Patterns

Homeostasis is a regulatory mechanism that keeps a specific variable close to a set value as other variables fluctuate. The notion of homeostasis can be rigorously formulated when the model of interest is represented as an input-output network, with distinguished input and output nodes, and the dynamics of the network determines the corresponding input-output function of the system. In this context, homeostasis can be defined as an 'infinitesimal' notion, namely, the derivative of the input-output function is zero at an isolated point. Combining this approach with graph-theoretic ideas from combinatorial matrix theory provides a systematic framework for calculating homeostasis points in models and classifying the different homeostasis types in input-output networks. In this paper we extend this theory by introducing the notion of a homeostasis pattern, defined as a set of nodes, in addition to the output node, that are simultaneously infinitesimally homeostatic. We prove that each homeostasis type leads to a distinct homeostasis pattern. Moreover, we describe all homeostasis patterns supported by a given input-output network in terms of a combinatorial structure associated to the input-output network. We call this structure the homeostasis pattern network.

math.DS

Realizations through Weakly Reversible Networks and the Globally Attracting Locus

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 $(G,k)$. Our focus is on a particular class of networks for $G$, where the corresponding network $G'$ is weakly reversible. In particular, we show that strongly endotactic two-dimensional networks with a two dimensional stoichiometric subspace, as well as certain endotactic networks under additional conditions, exhibit this property. Additionally, we establish a strong connection between this family of networks and the locus in the space of rate constants of which the corresponding dynamics admits globally stable steady states.

math.DS

Asymptotic stability of 3D relativistic collisionless plasma states in ambient magnetic fields with a boundary

Motivated by the stellar wind ejected from the upper atmosphere (Corona) of a star, we explore a boundary problem of the two-species nonlinear relativistic Vlasov-Poisson systems in the 3D half space in the presence of a constant vertical magnetic field and strong background gravity. We allow species to have different mass and charge (as proton and electron, for example). As the main result, we construct stationary solutions and establish their nonlinear dynamical asymptotic stability in time and space.

math.AP

Infinitesimal Homeostasis in Mass-Action Systems

Homeostasis occurs in a biological system when a chosen output variable remains approximately constant despite changes in an input variable. In this work we specifically focus on biological systems which may be represented as chemical reaction networks and consider their infinitesimal homeostasis, where the derivative of the input-output function is zero. The specific challenge of chemical reaction networks is that they often obey various conservation laws complicating the standard input-output analysis. We derive several results that allow to verify the existence of infinitesimal homeostasis points both in the absence of conservation and under conservation laws where conserved quantities serve as input parameters. In particular, we introduce the notion of infinitesimal concentration robustness, where the output variable remains nearly constant despite fluctuations in the conserved quantities. We provide several examples of chemical networks which illustrate our results both in deterministic and stochastic settings.

q-bio.QM

Homeostasis in Input-Output Networks: Structure, Classification and Applications

Homeostasis is concerned with regulatory mechanisms, present in biological systems, where some specific variable is kept close to a set value as some external disturbance affects the system. Mathematically, the notion of homeostasis can be formalized in terms of an input-output function that maps the parameter representing the external disturbance to the output variable that must be kept within a fairly narrow range. This observation inspired the introduction of the notion of infinitesimal homeostasis, namely, the derivative of the input-output function is zero at an isolated point. This point of view allows for the application of methods from singularity theory to characterize infinitesimal homeostasis points (i.e. critical points of the input-output function). In this paper we review the infinitesimal approach to the study of homeostasis in input-output networks. An input-output network is a network with two distinguished nodes `input' and `output', and the dynamics of the network determines the corresponding input-output function of the system. This class of dynamical systems provides an appropriate framework to study homeostasis and several important biological systems can be formulated in this context. Moreover, this approach, coupled to graph-theoretic ideas from combinatorial matrix theory, provides a systematic way for classifying different types of homeostasis (homeostatic mechanisms) in input-output networks, in terms of the network topology. In turn, this leads to new mathematical concepts, such as, homeostasis subnetworks, homeostasis patterns, homeostasis mode interaction. We illustrate the usefulness of this theory with several biological examples: biochemical networks, chemical reaction networks (CRN), gene regulatory networks (GRN), Intracellular metal ion regulation and so on.

q-bio.MN

The toric locus of a reaction network is a smooth manifold

We show that the toric locus of a reaction network is a smoothly embedded submanifold of the Euclidean space. More precisely, we prove that the toric locus of a reaction network is the image of an embedding and it is diffeomorphic to the product space between the affine invariant polyhedron of the network and its set of complex-balanced flux vectors. Moreover, we prove that within each affine invariant polyhedron, the complex-balanced equilibrium depends smoothly on the parameters (i.e., reaction rate constants). We also show that the complex-balanced equilibrium depends smoothly on the initial conditions.

math.DS

Homeostasis in Gene Regulatory Networks

In this paper, we use the framework of infinitesimal homeostasis to study general design principles for the occurrence of homeostasis in gene regulatory networks. We assume that the dynamics of the genes explicitly includes both transcription and translation, keeping track of both mRNA and protein concentrations. Given a GRN we construct an associated Protein-mRNA Network (PRN), where each individual (mRNA and protein) concentration corresponds to a node and the edges are defined in such a way that the PRN becomes a bipartite directed graph. By simultaneously working with the GRN and the PRN we are able to apply our previous results about the classification of homeostasis types (i.e., topologically defined homeostasis generating mechanism) and their corresponding homeostasis patterns. Given an arbitrarily large and complex GRN $\mathcal{G}$ and its associated PRN $\mathcal{R}$, we obtain a correspondence between all the homeostasis types (and homeostasis patterns) of $\mathcal{G}$ and a subset the homeostasis types (and homeostasis patterns) of $\mathcal{R}$. Moreover, we completely characterize the homeostasis types of the PRN that do not have GRN counterparts.

q-bio.MN

On the Connectivity of the Disguised Toric Locus of a Reaction Network

Complex-balanced mass-action systems are some of the most important types of mathematical models of reaction networks, due to their widespread use in applications, as well as their remarkable stability properties. We study the set of positive parameter values (i.e., reaction rate constants) of a reaction network $G$ that, according to mass-action kinetics, generate dynamical systems that can be realized as complex-balanced systems, possibly by using a different graph $G'$. This set of parameter values is called the disguised toric locus of $G$. The $\mathbb{R}$-disguised toric locus of $G$ is defined analogously, except that the parameter values are allowed to take on any real values. We prove that the disguised toric locus of $G$ is path-connected, and the $\mathbb{R}$-disguised toric locus of $G$ is also path-connected. We also show that the closure of the disguised toric locus of a reaction network contains the union of the disguised toric loci of all its subnetworks.

math.DS

A Lower Bound on the Dimension of the $\mathbb{R}$-Disguised Toric Locus of a Reaction Network

Polynomial dynamical systems (i.e. dynamical systems with polynomial right hand side) are ubiquitous in applications, especially as models of reaction networks and interaction networks. The properties of general polynomial dynamical systems can be very difficult to analyze, due to nonlinearity, bifurcations, and the possibility for chaotic dynamics. On the other hand, toric dynamical systems are polynomial dynamical systems that appear naturally as models of reaction networks, and have very robust and stable properties. A disguised toric dynamical system is a polynomial dynamical system generated by a reaction network $\mathcal N$ and some choice of positive parameters, such that (even though it may not be toric with respect to $\mathcal N$) it has a toric realization with respect to some network $\mathcal N'$. Disguised toric dynamical systems enjoy all the robust stability properties of toric dynamical systems. In this paper, we study a larger set of dynamical systems where the rate constants are allowed to take both positive and negative values. More precisely, we analyze the $\mathbb{R}$-disguised toric locus of a reaction network $\mathcal N$, i.e., the subset in the space rate constants (positive or negative) of $\mathcal N$ for which the corresponding polynomial dynamical system is disguised toric. We focus especially on finding a lower bound on the dimension of the $\mathbb{R}$-disguised toric locus.

math.DS

The structure of the moduli space of toric dynamical systems of a reaction network

We consider toric dynamical systems, which are also called complex-balanced mass-action systems. These are remarkably stable polynomial dynamical systems that arise from the analysis of mathematical models of reaction networks when, under the assumption of mass-action kinetics, they can give rise to complex-balanced equilibria. Given a reaction network, we study the moduli space of toric dynamical systems generated by this network, also called the toric locus of the network. The toric locus is an algebraic variety, and we are especially interested in its topological properties. We show that complex-balanced equilibria depend continuously on the parameter values in the toric locus, and, using this result, we prove that the toric locus has a remarkable product structure: it is homeomorphic to the product of the set of complex-balanced flux vectors and the affine invariant polyhedron of the network. In particular, it follows that the toric locus is a contractible manifold. Finally, we show that the toric locus is invariant with respect to bijective affine transformations of the generating reaction network.

math.AG