betaFeedback

WorksMathematics

Siphon faces in slow-fast mass-action networks

Abstract

When the species of a siphon in a mass-action network, however many, are fast and their invariant face loses transverse stability along the slow flow, trajectories follow the face past this loss before leaving it. We study three consequences. (i) If the transverse Metzler linearisation is irreducible, the entry-exit relation with its Perron root gives the exit. Under acyclic feeding between its strongly connected components, a max-plus recursion over the reactions gives it; in general neither the Perron root nor the diagonal blocks do. (ii) With one slow species, acyclic feeding and a transversal exit, a fold of the interior critical manifold followed by a drop onto the face gives a unique, exponentially attracting relaxation oscillation whose turning points tend to the fold and exit point. Exactly 34743474 minimal planar networks of molecularity ≤3\leq 3, with fast per-capita rate affine and decreasing in the slow species, meet our sufficient conditions for it. (iii) A siphon-breaking reaction of rate δδ and finite min-plus breaking order ww unfolds the transcritical point into a fold if a Perron-weighted second-order self-interaction is positive, and not if negative; the fold's critical component lies at distance of order δw/2δ^{w/2} from the face. For δ=e−μ/Karepsilonδ=e^{-μ/^Karepsilon} the broken face is a floor at −μ-μ in the recursion, and planar cycles leave it between the entry-exit and transcritical points, depending on μμ. Simulations confirm predicted exits and cycles, including cyclic feeding, where the prediction is conjectural, and high-precision computations confirm the folds; the errors shrink as Karepsilon^Karepsilon or δδ decreases.

Paper details

vlnc:W_2d29zxk4
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…