Back to search
2406.03269

Advancing Mathematical Epidemic Modeling via synergies with Chemical Reaction Network Theory and Lagrange-Hamilton Geometry

Florin Avram, Rim Adenane, Mircea Neagu

incompletemedium confidence
Category
math.DS
Journal tier
Note/Short/Other
Processed
Sep 28, 2025, 12:56 AM

Audit review

The paper states exactly the two bounds as Theorem 1 (RJ ≤ inf_F RF in the instability domain; RJ ≥ sup_F RF in the stability domain) and defines RJ via a Descartes-type Jacobian factorization. However, its proof makes the logically invalid jump “RJ>1 ⇒ DFE unstable ⇒ RF>1; thus RJ ≤ RF,” which does not justify a numerical inequality from a same-side-of-1 implication. The candidate solution provides the missing and correct argument via a one-parameter scaling of new-infection terms, together with the Descartes property and the standard DFE-stability/NGM equivalence, yielding the desired inequalities. Hence the result is right but the paper’s proof is incomplete; the model’s proof is correct and fills the gap. See the paper’s definitions and Theorem 1 in the Jacobian factorization bound section and the Descartes-lemma therein ; background on the DFE/NGM threshold and non-uniqueness issues appears earlier in the essay , and their algorithmic F−V recipe is in §2.4 .

Referee report (LaTeX)

\textbf{Recommendation:} minor revisions

\textbf{Journal Tier:} note/short/other

\textbf{Justification:}

The central result (bounds comparing RJ to the infimum/supremum of RF across admissible decompositions) is sound and useful, and the exposition places it in a broader context. The proof, however, relies on an implication about being greater/less than 1 to claim a numerical inequality, which is not logically sufficient. Incorporating a short scaling/threshold argument would resolve this cleanly without altering the structure or conclusions of the paper.