Anne Shiu
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
Anne Shiu has a total of 51 co-authors. Here are the top co-authors by number of shared publications:
- Alicia Dickenstein
Dto. de Matemática, FCEN, Universidad de Buenos Aires, and IMAS (UBA-CONICET), Buenos Aires, Argentina
3 shared publications - Carsten Conradi
Max-Planck-Institut Dynamik komplexer technischer Systeme
3 shared publications - Elisenda Feliu
Department of Mathematical Sciences, University of Copenhagen, Copenhagen, Denmark
3 shared publications - Nidhi Kaihnsa
University of Copenhagen, Copenhagen, Denmark
3 shared publications - Anh Tuan Nguyen
Department of Mathematics Texas A & M University
2 shared publications - Badal Joshi
Department of Mathematics California State University San Marcos
2 shared publications
Latest Publications
- Open Access
- 24 December 2025
- Published by Springer Nature in Bulletin of Mathematical Biology
- Vol. 88 (1) , 12
Parameter identifiability of linear-compartmental mammillary models
Linear compartmental models are a widely used tool for analyzing systems arising in biology, medicine, and more. In such settings, it is essential to know whether model parameters can be recovered from experimental data. This is the identifiability problem. For a class of linear compartmental models with one input and one output, namely, those for which the underlying graph is a bidirected tree, Bortner et al. completely characterized which such models are structurally identifiability, which means that every parameter is generically locally identifiable. Here, we delve deeper, by examining which individual parameters are locally versus globally identifiable. Specifically, we analyze mammillary models, which consist of one central compartment which is connected to all other (peripheral) compartments. For these models, which fall into five infinite families, we determine which individual parameters are locally versus globally identifiable, and we give formulas for some of the globally identifiable parameters in terms of the coefficients of input-output equations. Our proofs rely on a combinatorial formula due to Bortner et al. for these coefficients.
- 24 December 2025
- Published by Springer Nature in Bulletin of Mathematical Biology
- Vol. 88 (1) , 12
Open AccessParameter identifiability of linear-compartmental mammillary models
Linear compartmental models are a widely used tool for analyzing systems arising in biology, medicine, and more. In such settings, it is essential to know whether model parameters can be recovered from experimental data. This is the identifiability problem. For a class of linear compartmental models with one input and one output, namely, those for which the underlying graph is a bidirected tree, Bortner et al. completely characterized which such models are structurally identifiability, which means that every parameter is generically locally identifiable. Here, we delve deeper, by examining which individual parameters are locally versus globally identifiable. Specifically, we analyze mammillary models, which consist of one central compartment which is connected to all other (peripheral) compartments. For these models, which fall into five infinite families, we determine which individual parameters are locally versus globally identifiable, and we give formulas for some of the globally identifiable parameters in terms of the coefficients of input-output equations. Our proofs rely on a combinatorial formula due to Bortner et al. for these coefficients.
- Open Access
- 25 September 2025
- Published by Elsevier in Current Opinion in Systems Biology
- Vol. 42
Structural identifiability of compartmental models: Recent progress and future directions
- 25 September 2025
- Published by Elsevier in Current Opinion in Systems Biology
- Vol. 42
Open AccessStructural identifiability of compartmental models: Recent progress and future directions
- Open Access
From chemical reaction networks to algebraic and polyhedral geometry -- and back again
This is a chapter for a book in honor of Bernd Sturmfels and his contributions. We describe the contributions by Bernd Sturmfels and his collaborators in harnessing algebraic and combinatorial methods for analyzing chemical reaction networks. Topics explored include the steady-state variety, counting steady states, and the global attractor conjecture. We also recount some personal stories that highlight Sturmfels's long-lasting impact on this research area.
Open AccessFrom chemical reaction networks to algebraic and polyhedral geometry -- and back again
This is a chapter for a book in honor of Bernd Sturmfels and his contributions. We describe the contributions by Bernd Sturmfels and his collaborators in harnessing algebraic and combinatorial methods for analyzing chemical reaction networks. Topics explored include the steady-state variety, counting steady states, and the global attractor conjecture. We also recount some personal stories that highlight Sturmfels's long-lasting impact on this research area.
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 30 (5) , 1745-1761
Deficiency of chemical reaction networks: the effect of operations that preserve multistationarity and periodic orbits
We investigate six operations on chemical reaction networks, all of which have been proven to preserve important dynamical properties, namely, the capacity for nondegenerate multistationarity (multiple steady states) and periodic orbits. Both multistationarity and periodic orbits are properties that are known to be precluded when the deficiency (a nonnegative integer associated to a network) is zero. It is therefore natural to conjecture that the deficiency never decreases when any of the six aforementioned network operations are performed. We prove that this is indeed the case, and moreover, we characterize the numerical difference in deficiency after performing each network operation.
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 30 (5) , 1745-1761
Deficiency of chemical reaction networks: the effect of operations that preserve multistationarity and periodic orbits
We investigate six operations on chemical reaction networks, all of which have been proven to preserve important dynamical properties, namely, the capacity for nondegenerate multistationarity (multiple steady states) and periodic orbits. Both multistationarity and periodic orbits are properties that are known to be precluded when the deficiency (a nonnegative integer associated to a network) is zero. It is therefore natural to conjecture that the deficiency never decreases when any of the six aforementioned network operations are performed. We prove that this is indeed the case, and moreover, we characterize the numerical difference in deficiency after performing each network operation.
- 20 November 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 83 (6) , 2260-2283
Prevalence of Multistationarity and Absolute Concentration Robustness in Reaction Networks
For reaction networks arising in systems biology, the capacity for two or more steady states, that is, multistationarity, is an important property that underlies biochemical switches. Another property receiving much attention recently is absolute concentration robustness (ACR), which means that some species concentration is the same at all positive steady states. In this work, we investigate the prevalence of each property while paying close attention to when the properties occur together. Specifically, we consider a stochastic block framework for generating random networks and prove edge-probability thresholds at which, with high probability, multistationarity appears and ACR becomes rare. We also show that the small window in which both properties occur only appears in networks with many species. Taken together, our results confirm that, in random reversible networks, ACR and multistationarity together, or even ACR on its own, is highly atypical. Our proofs rely on two prior results, one pertaining to the prevalence of networks with deficiency zero and the other “lifting” multistationarity from small networks to larger ones.
- 20 November 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 83 (6) , 2260-2283
Prevalence of Multistationarity and Absolute Concentration Robustness in Reaction Networks
For reaction networks arising in systems biology, the capacity for two or more steady states, that is, multistationarity, is an important property that underlies biochemical switches. Another property receiving much attention recently is absolute concentration robustness (ACR), which means that some species concentration is the same at all positive steady states. In this work, we investigate the prevalence of each property while paying close attention to when the properties occur together. Specifically, we consider a stochastic block framework for generating random networks and prove edge-probability thresholds at which, with high probability, multistationarity appears and ACR becomes rare. We also show that the small window in which both properties occur only appears in networks with many species. Taken together, our results confirm that, in random reversible networks, ACR and multistationarity together, or even ACR on its own, is highly atypical. Our proofs rely on two prior results, one pertaining to the prevalence of networks with deficiency zero and the other “lifting” multistationarity from small networks to larger ones.
- Open Access
Absolute Concentration Robustness and Multistationarity in Reaction Networks: Conditions for Coexistence
Many reaction networks arising in applications are multistationary, that is, they have the capacity for more than one steady state; while some networks exhibit absolute concentration robustness (ACR), which means that some species concentration is the same at all steady states. Both multistationarity and ACR are significant in biological settings, but only recently has attention focused on the possibility for these properties to coexist. Our main result states that such coexistence in at-most-bimolecular networks (which encompass most networks arising in biology) requires at least $3$ species, $5$ complexes, and $3$ reactions. We prove additional bounds on the number of reactions for general networks based on the number of linear conservation laws. Finally, we prove that, outside of a few exceptional cases, ACR is equivalent to non-multistationarity for bimolecular networks that are small (more precisely, one-dimensional or up to two species). Our proofs involve analyses of systems of sparse polynomials, and we also use classical results from chemical reaction network theory.Open AccessAbsolute Concentration Robustness and Multistationarity in Reaction Networks: Conditions for Coexistence
Many reaction networks arising in applications are multistationary, that is, they have the capacity for more than one steady state; while some networks exhibit absolute concentration robustness (ACR), which means that some species concentration is the same at all steady states. Both multistationarity and ACR are significant in biological settings, but only recently has attention focused on the possibility for these properties to coexist. Our main result states that such coexistence in at-most-bimolecular networks (which encompass most networks arising in biology) requires at least $3$ species, $5$ complexes, and $3$ reactions. We prove additional bounds on the number of reactions for general networks based on the number of linear conservation laws. Finally, we prove that, outside of a few exceptional cases, ACR is equivalent to non-multistationarity for bimolecular networks that are small (more precisely, one-dimensional or up to two species). Our proofs involve analyses of systems of sparse polynomials, and we also use classical results from chemical reaction network theory. - Open Access
Prevalence of multistationarity and absolute concentration robustness in reaction networks
For reaction networks arising in systems biology, the capacity for two or more steady states, that is, multistationarity, is an important property that underlies biochemical switches. Another property receiving much attention recently is absolute concentration robustness (ACR), which means that some species concentration is the same at all positive steady states. In this work, we investigate the prevalence of each property while paying close attention to when the properties occur together. Specifically, we consider a stochastic block framework for generating random networks, and prove edge-probability thresholds at which - with high probability - multistationarity appears and ACR becomes rare. We also show that the small window in which both properties occur only appears in networks with many species. Taken together, our results confirm that, in random reversible networks, ACR and multistationarity together, or even ACR on its own, is highly atypical. Our proofs rely on two prior results, one pertaining to the prevalence of networks with deficiency zero, and the other "lifting" multistationarity from small networks to larger ones.
Open AccessPrevalence of multistationarity and absolute concentration robustness in reaction networks
For reaction networks arising in systems biology, the capacity for two or more steady states, that is, multistationarity, is an important property that underlies biochemical switches. Another property receiving much attention recently is absolute concentration robustness (ACR), which means that some species concentration is the same at all positive steady states. In this work, we investigate the prevalence of each property while paying close attention to when the properties occur together. Specifically, we consider a stochastic block framework for generating random networks, and prove edge-probability thresholds at which - with high probability - multistationarity appears and ACR becomes rare. We also show that the small window in which both properties occur only appears in networks with many species. Taken together, our results confirm that, in random reversible networks, ACR and multistationarity together, or even ACR on its own, is highly atypical. Our proofs rely on two prior results, one pertaining to the prevalence of networks with deficiency zero, and the other "lifting" multistationarity from small networks to larger ones.
- 20 January 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 37 (1) , 114-145
Nondegenerate Neural Codes and Obstructions to Closed-Convexity
Previous work on convexity of neural codes has produced codes that are open-convex but not closed-convex—or vice-versa. However, why a code is one but not the other, and how to detect suc...
- 20 January 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 37 (1) , 114-145
Nondegenerate Neural Codes and Obstructions to Closed-Convexity
Previous work on convexity of neural codes has produced codes that are open-convex but not closed-convex—or vice-versa. However, why a code is one but not the other, and how to detect suc...
- 19 October 2021
- Published by Springer Nature in Vietnam Journal of Mathematics
- Vol. 50 (3) , 623-651
Absolute Concentration Robustness in Networks with Low-Dimensional Stoichiometric Subspace
- 19 October 2021
- Published by Springer Nature in Vietnam Journal of Mathematics
- Vol. 50 (3) , 623-651
Absolute Concentration Robustness in Networks with Low-Dimensional Stoichiometric Subspace
- 18 September 2021
- Published by Springer Nature in Vietnam Journal of Mathematics
- Vol. 50 (2) , 359-373
Non-Monotonicity of Closed Convexity in Neural Codes
- 18 September 2021
- Published by Springer Nature in Vietnam Journal of Mathematics
- Vol. 50 (2) , 359-373
Non-Monotonicity of Closed Convexity in Neural Codes