Pith. sign in

REVIEW 6 minor 9 references

Extinction thresholds in a graph-based model of HIV infection dynamics

T0 review · 0 major / 6 minor · reviewed 2026-08-04 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper proves that two natural extinction thresholds for a graph-based HIV infection automaton always satisfy 2 ≤ hiv(G) ≤ HIV(G) ≤ Δ(G)+1, and that the gap HIV(G)−hiv(G) can be arbitrarily large.

desk verdict The paper's unbounded-gap theorem is false as stated, but the bounds and digraph results justify a careful referee. read the letter →

arxiv 2608.00340 v1 pith:BVSQEBVK submitted 2026-07-31 math.DS math.COnlin.CG

Manuel A. Espinosa-García , Ana Paulina Figueroa , Julián A. Fresán-Figueroa , Gerardo L. Maldonado , L. Ariadna Sánchez-Solís This is my paper · ORCID
classification math.DSmath.COnlin.CG MSC 37B1505C7592D30
keywords HIVgraphautomatonextinctionthresholdlatencysetcellularreplacementparameterbipartiteregulargraphsstate-transitiondigraphnon-monotone
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper studies a synchronous cellular automaton on graphs proposed as a model of HIV dynamics in lymph-node networks: healthy cells become infected when they have an infected neighbor, infected cells die, and dead cells are replaced by infected or healthy cells depending on how many infected neighbors they have, measured against a replacement parameter R. It introduces two parameters for a graph G: hiv(G), the smallest R that guarantees extinction from every starting configuration, and HIV(G), the threshold beyond which every larger R guarantees extinction. The main results are that these parameters always lie between 2 and Δ(G)+1, that the upper bound is attained exactly for bipartite regular graphs, and that the difference between the two parameters is unbounded — one can build graphs where the gap is any prescribed integer. The paper also computes the parameters for cycles, complete graphs, and complete bipartite graphs, and studies the phase-space digraph of the automaton, showing it can contain cycles of any length. The upshot is that extinction in this model is controlled by graph structure, not just by the replacement parameter, and it is not a monotone property in R.

What carries the argument

The two extinction parameters hiv(G) and HIV(G) — the first replacement value that forces extinction for every admissible initial configuration, and the smallest threshold after which every larger replacement value does so. The main mechanism is the four-stage classification of vertices (never-infected, infected, dead, cured): once R ≥ Δ(G)+1, a vertex can only move forward through these stages, never back. The characterization of the extremal case is carried by a partition/expansion argument showing that when G is not bipartite-regular, R=Δ(G) forces a cured vertex to appear and then propagate to the whole graph. The unbounded-gap construction F_k — a star-like graph with a long tail of deg

What would settle it

Simulate the deterministic rules on F_3 (vertices u1,...,u5, x, y, z; edges xy, yz, and x-u_i, y-u_i) with R=4, starting from each of the 2^8 admissible configurations, and check that every trajectory reaches the all-healthy state within the extinction times stated in Table 2; a single failure would disprove the unbounded-gap theorem.

Watch

Extended reading notes

Core claim

The central claim is a complete structural characterization of when the naive upper bound is tight. For every connected graph with at least one edge, 2 ≤ hiv(G) ≤ HIV(G) ≤ Δ(G)+1; the equality HIV(G)=Δ(G)+1 holds precisely when G is bipartite and regular, in which case both parameters equal Δ(G)+1. Conversely, if G is not both bipartite and regular, then R=Δ(G) already guarantees extinction from every admissible initial state, pulling HIV(G) below the bound. A second main claim is that the two parameters are genuinely independent: for every integer k≥2 there is a connected graph F_k with HIV(F_k)−hiv(F_k)=k, so the gap can be made arbitrarily large. Along the way the paper proves that extinc

Load-bearing premise

The unbounded-gap construction relies on a finite case table (Table 2) that lists extinction times for every admissible initial configuration of the graph F_k at R=k+1; if any entry is wrong or the case split is not exhaustive, the proof that hiv(F_k)=k+1 collapses.

Editorial extensions

If this is right

  • If the graph is bipartite and regular, both extinction parameters coincide at Δ(G)+1; no finer threshold distinction exists for such graphs.
  • If the graph is not both bipartite and regular, extinction is already guaranteed at R=Δ(G), so the eventual threshold drops by at least one.
  • For any chosen integer gap k, some connected graph realizes HIV−hiv = k; the two thresholds are not coupled.
  • On cycles, complete graphs, and complete bipartite graphs, both parameters admit closed formulas: 3/2 for cycles (even/odd), ⌈(n+1)/2⌉ for K_n, and max{m+1, ⌊n/2⌋+1} for K_{m,n}.
  • The state-transition digraph can have cycles of every positive length, and a length-2 cycle exists exactly when V splits into two parts each sending at least R edges to the other.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The two-threshold distinction is likely portable: any synchronous cellular automaton with a tunable reinfection parameter and a dead/replacement stage should exhibit analogous first-threshold vs eventual-threshold divergence whenever reinfection is needed for persistence.
  • If the paper's conjecture on wheel graphs is correct, it would give an infinite family where hiv(G)=3 or 4 but HIV(G)=n−1, making the gap essentially as large as possible while keeping the graph sparse; that would sharpen the unbounded-gap theorem from existence to a natural family.
  • The length-2 cycle characterization is equivalent to a bipartite-sparseness condition (a 'spanning R-dense cut'); asking for its algorithmic detection, or for analogues with longer periods, could connect to computational complexity questions the paper leaves open.
  • The isolated small values in E(W_n) (e.g., R=3 guarantees extinction for even wheels while intermediate R allow latency) suggest that low replacement values can accidentally extinguish infection by failing to reinfect enough dead cells, a non-monotonicity that may have epidemiological analogues.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 6 minor

Summary. This paper studies Mukwembi's graph-based three-state cellular automaton for HIV dynamics. For a connected graph G it introduces two extinction parameters: hiv(G), the smallest R such that every admissible initial configuration reaches the all-healthy state, and HIV(G), the threshold beyond which every larger R guarantees extinction. The main results are: (i) 2 ≤ hiv(G) ≤ HIV(G) ≤ Δ(G)+1, with equality HIV(G)=Δ(G)+1 if and only if G is bipartite and Δ-regular (Theorem 2.10); (ii) the gap HIV(G)−hiv(G) is unbounded (Theorem 2.11, via the family F_k); (iii) the R-state transition digraph realizes cycles of every length (Theorem 3.3) and has a clean characterization of 2-cycles (Theorem 3.4); and (iv) closed formulas for cycles, complete graphs, and complete bipartite graphs, plus computational evidence for wheels. The proofs are largely first-principles combinatorial arguments. I also checked the circulated counterexample to Theorem 2.11 for k=2: it does not land. Direct iteration of the stated initial configuration with |U0|=2 and (x,y,z)=(H,H,H) reaches 0_G at t=15, exactly as Table 2 reports; the proposed 10-cycle mis-evaluates t14 because the dead vertex x has only two infected neighbors at t13, fewer than R=3, so it becomes healthy rather than infected.

Significance. If the results hold, the paper provides a genuine refinement of extinction thresholds for Mukwembi's automaton and shows that hiv and HIV are not redundant invariants. The extremal characterization in Theorem 2.10 is elegant, and the unbounded-gap construction in Theorem 2.11 is a strong structural result. The phase-space/digraph viewpoint in Section 3 is a useful framework for further work. Strengths of the manuscript include its first-principles proofs, the absence of fitted parameters, the explicit constructions, and the reproducibility of the numerical part through the provided code. I found no circularity or fitted quantities. The main presentation weakness is that the proof of Theorem 2.11 relies on a large finite-case table that is asserted without derivation; however, I spot-checked several entries and found them correct, and the alleged stress-test counterexample is invalid. With a small clarification of how Table 2 is obtained, the central claims should be accepted.

minor comments (6)
  1. [Theorem 2.11, Table 2] The proof that k+1 ∈ E(F_k) is an unproved finite-case computation. The table is plausible and I verified several entries, including the k=2, |U0|=2, (x,y,z)=(H,H,H) case, but a short derivation of the block recurrences, or an explicit statement that the linked code verifies all 8(2k) cases, would remove the only non-transparent step in a headline theorem.
  2. [Theorem 4.3] The sub-case tables near the end of the proof are also asserted without derivation. A sentence saying that each row follows by direct substitution into (1), and perhaps a short example, would help the reader check the exhaustiveness of the cases.
  3. [General presentation] There are several typos: 'is is latent' in the Introduction, 'stablish' in Section 1, 'conformed' for 'composed' in the Conclusions, and 'States sequence' in the Figure 1 caption. These should be corrected.
  4. [Theorem 3.3] The n=3 case refers to the proof of Theorem 2.11 but does not specify which choice of k and R is intended. Please state explicitly, e.g., k=2 and R=3 in F_2.
  5. [Table 2 layout] The layout of Table 2 is dense; the z/y/x rows repeat across blocks and the column headers are easy to misread. A supplementary machine-readable table, or splitting the table into separate blocks per |U0|, would improve verifiability.
  6. [Paragraph after Proposition 2.5] The extinction-time formula max_v dist(v,I0)+2 is stated after assuming D_t ∩ I_{t+1} = ∅ for all t. That assumption should be repeated in the sentence to avoid ambiguity.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the extinction parameters are defined directly from the transition rules and all load-bearing results are proved by first-principles combinatorial arguments.

full rationale

The paper's two parameters, hiv(G) and HIV(G), are defined directly from the microscopic transition rule (1) and from the extinction/latency sets E(G,f0) and L(G,f0); no parameter is fitted to data and no 'prediction' is defined in terms of the result it supports. The main bounds and the characterization in Theorem 2.10 are proved from the dynamics itself via Lemma 2.3 and Observation 2.4, not imported from the authors' prior work. The only imported theorem is Mukwembi's Theorem 2.1, which is an external, independently published result and is used only to establish well-definedness, not as a load-bearing self-citation. The unbounded-gap construction in Theorem 2.11 relies on explicit trajectories and a finite-case table computed from the transition rules; even if Table 2 were incorrect, that would be a proof error or correctness gap, not circularity. The wheel-graph material is explicitly labeled as experimental evidence for a conjecture, and Section 5 openly identifies open problems and limitations, further indicating the authors are not presenting fitted values as derived predictions. No step in the derivation chain reduces by definition, by construction, or by self-citation to its own inputs.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The paper introduces no fitted parameters or new physical entities. R is a variable of the model, not a fitted constant. The arguments rely on the imported transition rules, a prior extinction theorem of Mukwembi, and standard graph/digraph facts.

assumptions (4)
  • domain assumption Mukwembi's transition rules (Equation 1) define the dynamical system under study.
    The entire paper analyzes this particular cellular automaton, imported from reference [5].
  • domain assumption All graphs are finite, simple, connected, and have at least three vertices.
    Stated in the introduction; this restriction is used throughout the proofs, e.g., in Lemma 2.7 and Theorem 2.10.
  • domain assumption Theorem 2.1 (Mukwembi): if R = n-1 then the infection becomes extinct for every admissible initial state.
    Imported from [5] and used to establish that hiv(G) and HIV(G) are well defined.
  • standard math Standard fact: in a finite digraph with out-degree one, every weakly connected component contains a unique directed cycle with in-trees attached.
    Used in Remark 3.1 and Observation 3.2 to connect latency with directed cycles.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Extinction thresholds in a graph-based model of HIV infection dynamics." pith.science (2026). https://pith.science/paper/BVSQEBVK

@misc{pith2026260800340,
  author       = {Pith},
  title        = {Pith review of: Extinction thresholds in a graph-based model of HIV infection dynamics},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/BVSQEBVK}},
  note         = {Machine review of arXiv:2608.00340}
}
abstract

We study a graph-based cellular automaton for HIV infection dynamics in lymph-node networks, originally introduced by Mukwembi. Each vertex represents a cell site that may be healthy, infected, or dead, and the evolution is controlled by a replacement parameter $R$, which determines whether a dead cell is replaced by an infected or a healthy cell according to the number of its infected neighbors. For a graph $G$, we introduce two extinction parameters. The parameter $\mathbf{hiv}(G)$ is the smallest value of $R$ for which extinction occurs for every admissible initial configuration, whereas $\mathbf{HIV}(G)$ is the smallest threshold such that extinction occurs for every replacement parameter greater than or equal to it. We prove the general bounds $2\leq \mathbf{hiv}(G)\leq \mathbf{HIV}(G)\leq \Delta(G)+1$ and characterize the extremal case $\mathbf{HIV}(G)=\Delta(G)+1$. We also show that the gap $\mathbf{HIV}(G)-\mathbf{hiv}(G)$ is unbounded and determine both parameters for some classical families of graphs. Finally, we study the dynamics of the model using the state-transition digraph of the system and the configurations whose trajectories converge to nontrivial periodic orbits. The results show that extinction depends not only on the replacement parameter but also on the structural properties of the underlying graph.

Figures

Figures reproduced from arXiv: 2608.00340 by the authors.

Figure 1
Figure 1. States sequence of a graph for R = ∆ = 4 and R = 2. Also, by Proposition 2.5 we know the time in which the infection becomes extinct if Dt ∩ It+1 = ∅ for every t. In fact, let f0 ∈ Ω0(G)\{0G}. If in a state sequence (G, f0, R) there no exists vertices such that v ∈ Dt ∩ It+1, then each vertex v is infected only at time tv = dist(v,I0), where dist(v,I0) is the distance from v to the set I0. Therefore, the infection b… view at source ↗
Figure 2
Figure 2. The graph Fk. d(ui) = 2 and d(z) = 1, and therefore ∆(Fk) = 2k + 1. We will prove that hiv(Fk) = k + 1 and HIV(Fk) = 2k + 1. First, we show that {k + 2, . . . , 2k} ⊆ L(Fk). Fix an integer R satisfying k + 2 ≤ R ≤ 2k. Let U0 = {u1, . . . , uR−2} and U1 = {uR−1, . . . , u2k−1}. Consider the initial state in which the vertices in {x, z} ∪ U0 are healthy and the vertices in {y} ∪ U1 are infected. The trajectory is give… view at source ↗
Figure 3
Figure 3. The R-state transition digraph of K3, with R = 1 and R = 2. In each state, the healthy, infected and dead vertices are represented by nodes of colors blue, red and black, respectively. Theorem 3.3. Let n ∈ Z +. There exists a graph G, a positive integer R and an admissible initial state f0 of G such that the cycle on the weakly connected component of f0 has length n. Proof. For n = 1 it is enough to consider any gra… view at source ↗
Figures from the paper (4 more)
Figure 4
Figure 4. Figure 4: The graph G2k. fact that for every 1 ≤ t ≤ 2k + 1 = n + 1: It =    {v0, v′ 0} if t = 2k, {vk, v′ k } if t = k, {vj} if t ∈ {j, n − j}, 1 ≤ j ≤ k − 1, {v1} if t = 2k + 1. Dt =    {v0, v′ 0} if t ∈ {1, 2k + 1}, {vk, v′ k } if t = k + 1, {vj} if t ∈ {j + 1, …
Figure 5
Figure 5. Figure 5: The graph G2k+1 [PITH_FULL_IMAGE:figures/full_fig_p010_5.png]
Figure 6
Figure 6. Figure 6: The evolution of G6 and G7 with R = 2. Blue, red and black vertices represent the healthy, infected and dead vertices at each time. this case, taking the admissible initial state f0 for which U0 = H0 and U1 = I0, the evolution is given, for every t ≥ 1, by Ht = ∅, It =…
Figure 7
Figure 7. Figure 7: A graph such that E(G) is conformed by three separated integer intervals In the case that HIV(G) = hiv(G), the set E(G) is the integer interval [HIV(G),∞). We found graphs for which E(G) is not composed for a single interval, for example, the flag graph Fk satisfies E(…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

9 extracted references · 5 canonical work pages

  1. [1]

    Pastor-Satorras, A

    R. Pastor-Satorras, A. Vespignani, Epidemic spreading in scale-free networks, Physical Review Letters 86 (14) (2001) 3200–3203.doi:10.1103/PhysRevLett.86.3200

    doi:10.1103/physrevlett.86.3200 2001

  2. [2]

    Van Mieghem, J

    P. Van Mieghem, J. Omic, R. Kooij, Virus spread in networks, IEEE/ACM Transactions on Net- working 17 (1) (2009) 1–14.doi:10.1109/TNET.2008.925623

    arXiv 2009

  3. [3]

    Pastor-Satorras, C

    R. Pastor-Satorras, C. Castellano, P. Van Mieghem, A. Vespignani, Epidemic processes in complex networks, Reviews of Modern Physics 87 (3) (2015) 925–979.doi:10.1103/RevModPhys.87.925

    doi:10.1103/revmodphys.87.925 2015

  4. [4]

    O. J. Cohen, G. Pantaleo, G. K. Lam, A. S. Fauci, Studies on lymphoid tissue from hiv-infected indi- viduals: implications for the design of therapeutic strategies, Springer Seminars in Immunopathology 18 (3) (1997) 305–322.doi:10.1007/bf00813500

    work page doi:10.1007/bf00813500 1997

  5. [5]

    S. Mukwembi, A note on the effects of replenishment of depleted cells on hiv infection dynamics: A graph-theoretic approach, Physica A: Statistical Mechanics and its Applications 387 (5-6) (2008) 1200–1204.doi:10.1016/j.physa.2007.10.038

    work page doi:10.1016/j.physa.2007.10.038 2008

  6. [6]

    S. H. White, A. M. Del Rey, G. R. S´ anchez, Modeling epidemics using cellular automata, Applied Mathematics and Computation 186 (1) (2007) 193–202.doi:10.1016/j.amc.2006.06.126

    work page doi:10.1016/j.amc.2006.06.126 2007

  7. [7]

    B. U. Pfeifer, D. B¨ aumgartner, A cellular automaton framework for infectious disease spread, The Open Medical Informatics Journal 2 (2008) 70–81.doi:10.2174/1874431100802010070

    work page doi:10.2174/1874431100802010070 2008

  8. [8]

    A. S. Jarrah, R. Laubenbacher, Finite dynamical systems: A mathematical framework for computer simulation, in: Mathematical Modeling, Simulation, Visualization and e-Learning, Springer, 2008, pp. 343–358.doi:10.1007/978-3-540-74339-2_21

    work page doi:10.1007/978-3-540-74339-2_21 2008

Show all 9 references
  1. [9]

    Garc ´ ıa, A

    L. Garc ´ ıa, A. S. Jarrah, R. Laubenbacher, Classification of finite dynamical systems, Mathematical and Computer Modelling 35 (9–10) (2002) 1001–1020. 16

    2002

Pith tools

Reviewed August 4, 2026 · model on record in the stance chip above.