Xiaoxian Tang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Xiaoxian Tang has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
Kuo Song
School of Mathematical Sciences, Beihang University, Beijing, China
2 shared publicationsNida Obatake
Department of Mathematics, Texas A&M University, College Station, USA
2 shared publicationsYue Jiao
2 shared publicationsZhishuo Zhang
2 shared publications- Angélica Torres
Centre de Recerca Matemàtica, Bellaterra, Barcelona, 08193, Spain
1 shared publication Anne Shiu
Department of Mathematics, Texas A&M University, College Station, USA
1 shared publication
Latest Publications
- 28 September 2026
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 39 (5) , 1881-1900
Degeneracy of Two-Dimensional Zero-One Reaction Networks with up to Three Species
- 28 September 2026
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 39 (5) , 1881-1900
Degeneracy of Two-Dimensional Zero-One Reaction Networks with up to Three Species
- Open Access
- 12 August 2026
- Published by Elsevier in SSRN Electronic Journal
Detecting Nonproperness of Likelihood Equations
Given an algebraic statistical model, a challenging problem is classifying the data according to the number of positive critical points of the likelihood function. The positive critical points are the positive solutions to an algebraic system, say likelihood equations. So, identifying the number of positive critical points is a real root classification problem for the likelihood equations. A discriminant variety of a likelihood-equation system geometrically describes the data for which the number of real solutions becomes unusual. As an essential component of the discriminant variety, the nonproperness set collects the data such that the likelihood-equation system has a solution at infinity. So, the number of real solutions varies when the data passes the nonproperness set, and identifying the nonproperness set plays a crucial role in the real root classification. In this work, we develop a novel method for computing nonproperness sets of likelihood-equation systems. We prove the correctness of this method. We show experimentally that it is far more efficient than the known methods in the literature.
- 12 August 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessDetecting Nonproperness of Likelihood Equations
Given an algebraic statistical model, a challenging problem is classifying the data according to the number of positive critical points of the likelihood function. The positive critical points are the positive solutions to an algebraic system, say likelihood equations. So, identifying the number of positive critical points is a real root classification problem for the likelihood equations. A discriminant variety of a likelihood-equation system geometrically describes the data for which the number of real solutions becomes unusual. As an essential component of the discriminant variety, the nonproperness set collects the data such that the likelihood-equation system has a solution at infinity. So, the number of real solutions varies when the data passes the nonproperness set, and identifying the nonproperness set plays a crucial role in the real root classification. In this work, we develop a novel method for computing nonproperness sets of likelihood-equation systems. We prove the correctness of this method. We show experimentally that it is far more efficient than the known methods in the literature.
- 21 July 2026
- Published by Springer Nature in Journal of Systems Science and Complexity
- p. 1-18
Steady State Classification of Allee Effect System
- 21 July 2026
- Published by Springer Nature in Journal of Systems Science and Complexity
- p. 1-18
Steady State Classification of Allee Effect System
- Open Access
- 4 February 2026
- Published by Elsevier in SSRN Electronic Journal
Determining the Equivalence of Small Zero-one Reaction Networks
Zero-one reaction networks are pivotal to cellular signaling, and establishing the equivalence of such networks represents a foundational computational challenge in the realm of chemical reaction network research. Herein, we propose a high-efficiency approach for identifying the equivalence of zero-one networks. Its efficiency stems from a set of criteria tailored to judge the equivalence of steady-state ideals derived from zero-one networks, which effectively reduces the computational cost associated with Groebner basis calculations. Experimental results demonstrate that our proposed method can successfully categorize more than three million networks by their equivalence within a feasible timeframe. Also, our computational results for two important classes of quadratic zero-one networks (three-dimensional with three species, six reactions; four-dimensional with four species, five reactions) show that they have no positive steady states for a generic choice of rate constants, implying these small networks generically exhibit neither multistability nor periodic orbits.
- 4 February 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessDetermining the Equivalence of Small Zero-one Reaction Networks
Zero-one reaction networks are pivotal to cellular signaling, and establishing the equivalence of such networks represents a foundational computational challenge in the realm of chemical reaction network research. Herein, we propose a high-efficiency approach for identifying the equivalence of zero-one networks. Its efficiency stems from a set of criteria tailored to judge the equivalence of steady-state ideals derived from zero-one networks, which effectively reduces the computational cost associated with Groebner basis calculations. Experimental results demonstrate that our proposed method can successfully categorize more than three million networks by their equivalence within a feasible timeframe. Also, our computational results for two important classes of quadratic zero-one networks (three-dimensional with three species, six reactions; four-dimensional with four species, five reactions) show that they have no positive steady states for a generic choice of rate constants, implying these small networks generically exhibit neither multistability nor periodic orbits.
- 18 November 2025
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 91 (6) , 82
Multistability of small zero-one reaction networks
Zero-one biochemical reaction networks play key roles in cell signalling such as signalling pathways regulated by protein phosphorylation. Multistability of reaction networks is a crucial dynamics feature enabling decision-making in cells. It is well known that multistability can be lifted from a “subnetwork" (a network with less species and fewer reactions) to large networks. So, we aim to explore the multistability problem of small zero-one networks. In this work, we prove the following main results: 1. any zero-one network with a one-dimensional stoichiometric subspace admits at most one positive steady state (it must be stable), and all the one-dimensional zero-one networks can be classified according to if they indeed admit a stable positive steady state or not; 2. any two-dimensional zero-one network with up to three species either admits only degenerate positive steady states, or admits at most one positive steady state (it must be stable); 3. the smallest zero-one networks (here, by “smallest", we mean these networks contain species as few as possible) that admit nondegenerate multistationarity/multistability contain three species and five/six reactions, and they are three-dimensional. In these proofs, we use the theorems based on the Brouwer degree theory and the theory of real algebraic geometry. Moreover, applying the tools of computational real algebraic geometry, we provide a systematical way for detecting the networks that admit nondegenerate multistationarity/multistability.
- 18 November 2025
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 91 (6) , 82
Multistability of small zero-one reaction networks
Zero-one biochemical reaction networks play key roles in cell signalling such as signalling pathways regulated by protein phosphorylation. Multistability of reaction networks is a crucial dynamics feature enabling decision-making in cells. It is well known that multistability can be lifted from a “subnetwork" (a network with less species and fewer reactions) to large networks. So, we aim to explore the multistability problem of small zero-one networks. In this work, we prove the following main results: 1. any zero-one network with a one-dimensional stoichiometric subspace admits at most one positive steady state (it must be stable), and all the one-dimensional zero-one networks can be classified according to if they indeed admit a stable positive steady state or not; 2. any two-dimensional zero-one network with up to three species either admits only degenerate positive steady states, or admits at most one positive steady state (it must be stable); 3. the smallest zero-one networks (here, by “smallest", we mean these networks contain species as few as possible) that admit nondegenerate multistationarity/multistability contain three species and five/six reactions, and they are three-dimensional. In these proofs, we use the theorems based on the Brouwer degree theory and the theory of real algebraic geometry. Moreover, applying the tools of computational real algebraic geometry, we provide a systematical way for detecting the networks that admit nondegenerate multistationarity/multistability.
- Open Access
- 28 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 277-283
An Efficient Algorithm for Determining the Equivalence of Zero-one Reaction Networks
- 28 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 277-283
Open AccessAn Efficient Algorithm for Determining the Equivalence of Zero-one Reaction Networks
- Open Access
Steady State Classification of Allee Effect System
In this paper, we consider the steady state classification problem of the Allee effect system for multiple tribes. First, we reduce the high-dimensional model into several two-dimensional and three-dimensional algebraic systems such that we can prove a comprehensive formula of the border polynomial for arbitrary dimension. Then, we propose an efficient algorithm for classifying the generic parameters according to the number of steady states, and we successfully complete the computation for up to the seven-dimensional Allee effect system.
Open AccessSteady State Classification of Allee Effect System
In this paper, we consider the steady state classification problem of the Allee effect system for multiple tribes. First, we reduce the high-dimensional model into several two-dimensional and three-dimensional algebraic systems such that we can prove a comprehensive formula of the border polynomial for arbitrary dimension. Then, we propose an efficient algorithm for classifying the generic parameters according to the number of steady states, and we successfully complete the computation for up to the seven-dimensional Allee effect system.
- Open Access
- 14 September 2023
- Published by Elsevier in Journal of Functional Foods
- Vol. 109, 105799
Immunomodulatory effect of two hydrolysates of chitin on cyclophosphamide-induced mice via immune response enhancement and gut microbiota modulation
- 14 September 2023
- Published by Elsevier in Journal of Functional Foods
- Vol. 109, 105799
Open AccessImmunomodulatory effect of two hydrolysates of chitin on cyclophosphamide-induced mice via immune response enhancement and gut microbiota modulation
- 17 August 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Dynamical Systems
- Vol. 22 (3) , 2459-2489
Hopf Bifurcations of Reaction Networks with Zero-One Stoichiometric Coefficients
For reaction networks with zero-one stoichiometric coefficients (or simply zero-one networks), we prove that if a network admits a Hopf bifurcation, then the rank of the stoichiometric matrix is at least four. As a corollary, we show that if a zero-one network admits a Hopf bifurcation, then it contains at least four species and five reactions. As applications, we show that there exist rank-four subnetworks, which have the capacity for Hopf bifurcations/oscillations, in two biologically significant networks: the mitogen-activated-protein-kinase cascade and the extracellular signal-regulated kinase network. We provide a computational tool for computing all four-species, five-reaction, zero-one networks that have the capacity for Hopf bifurcations.
- 17 August 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Dynamical Systems
- Vol. 22 (3) , 2459-2489
Hopf Bifurcations of Reaction Networks with Zero-One Stoichiometric Coefficients
For reaction networks with zero-one stoichiometric coefficients (or simply zero-one networks), we prove that if a network admits a Hopf bifurcation, then the rank of the stoichiometric matrix is at least four. As a corollary, we show that if a zero-one network admits a Hopf bifurcation, then it contains at least four species and five reactions. As applications, we show that there exist rank-four subnetworks, which have the capacity for Hopf bifurcations/oscillations, in two biologically significant networks: the mitogen-activated-protein-kinase cascade and the extracellular signal-regulated kinase network. We provide a computational tool for computing all four-species, five-reaction, zero-one networks that have the capacity for Hopf bifurcations.
- 2 June 2022
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Dynamical Systems
- Vol. 21 (2) , 1426-1454
Multistability of Reaction Networks with One-Dimensional Stoichiometric Subspaces
For the reaction networks with one-dimensional stoichiometric subspaces, we show the following results. (1) If the maximum number of positive steady states is an even number $N$, then the maximum number of stable positive steady states is $\frac{N}{2}$. (2) If the maximum number of positive steady states is an odd number $N$, then we provide a condition on the parameters of the network such that the maximum number of stable positive steady states is $\frac{N-1}{2}$ if this condition is satisfied, and this maximum number is $\frac{N+1}{2}$ otherwise.- 2 June 2022
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Dynamical Systems
- Vol. 21 (2) , 1426-1454
Multistability of Reaction Networks with One-Dimensional Stoichiometric Subspaces
For the reaction networks with one-dimensional stoichiometric subspaces, we show the following results. (1) If the maximum number of positive steady states is an even number $N$, then the maximum number of stable positive steady states is $\frac{N}{2}$. (2) If the maximum number of positive steady states is an odd number $N$, then we provide a condition on the parameters of the network such that the maximum number of stable positive steady states is $\frac{N-1}{2}$ if this condition is satisfied, and this maximum number is $\frac{N+1}{2}$ otherwise.