19 problems
A reaction network consists of chemical species and directed reactions between complexes, and it is weakly reversible when every reaction lies in a strongly connected component of…
Let a dynamical system be generated by a weakly reversible reaction network, and call a solution persistent if, for every initial condition…
Consider an endotactic variable- dynamical system, together with its stoichiometric subspace and stoichiometric compatibility classes … It is persistent if, for every initia…
Let and denote the densities of species and at time and location , and let be initial conditions satisfying . Wri…
Persistence diagrams can be augmented to depth posets, which equip their points with a partial ordering and can be applied to the radial transform of a loop around a singularity. C…
Let a balanced bilinear epidemic model have possibly several minimal siphons, and consider the boundary faces supported by these siphons. A boundary face is repelling when the rest…
Let be a continuous centred non-degenerate stationary Gaussian field on either or . A persistence, or hard wall event, is an event of the form…
Let the PAVD model be the preferential attachment model with vertex death from Definition. Suppose that the attachment and death-rate sequences and satisfy Assumptions and.…
Let be a random polynomial with i.i.d. coefficients, and let the persistence exponent be the limiting value of when it exists…
Global Asymptotic Stability conjecture. All complex balanced systems are persistent.
Theorem concerns constructible functions with compact support and a distance controlled by the convolution distance. Extension conjecture. Theorem should continue to hold when the…
Let denote the persistence probability at time for matrices of finite size , and let be the persistence exponent from the large- asymptotic…
A reaction network is weakly reversible if every reaction lies on a directed cycle of the reaction graph. For a solution of the associated dynamics on…
Consider the structured stochastic difference equation … is almost surely persistent and persistent in probability. A theorem establishes this conclusion under the stronger monoton…
Consider the two-species Markov chain … is almost surely persistent. Mutual invasibility is known to imply persistence in probability under the monotonicity assumptions; the conjec…
Persistence conjecture, bounded-trajectory version. Any weakly reversible reaction network with mass-action kinetics and bounded trajectories is persistent.
Persistence conjecture. Any weakly reversible mass-action system is persistent.
Persistence conjecture. Any weakly reversible mass-action system is persistent.
Non-persistence conjecture. If the opposite inequality to the persistence condition holds, namely , then persistence does not occur.