Extinction thresholds in a graph-based model of HIV infection dynamics
arXiv:2608.00340
2026
Dynamics
2 ideas extracted · analyzed Aug 31, 2026
What the math gives to ML
The paper provides a constructive extinction-versus-persistence mechanism for a deterministic graph cellular automaton with healthy, infected, and dead states. Its most transferable result is the characterization of exact period-two persistence: a graph admits a 2-cycle at replacement threshold R when its vertices can be partitioned into two sets such that every vertex has at least R neighbors across the partition. This gives neural message-passing and recurrent architectures a computable oscillation certificate, rather than relying only on spectral-radius estimates. A second transferable asset is the finite state-transition graph viewpoint, which supports empirical extinction monitoring and threshold scheduling for quantized or binary recurrent networks.
Ideas from this paper
✗ Failed on benchmark
2026
Add a graph-structural anti-oscillation constraint to binary or thresholded recurrent message-passing networks. The paper shows that a partition with sufficiently many cross-partition neighbors creates an exact period-two orbit, so training can explicitly penalize such high cross-degree bipartite cores or choose the threshold above their strength.
Useful7/10
Difficulty5/10
Novelty7/10
Unverified
2026
Treat a quantized recurrent network as a finite deterministic state-transition system and distinguish absorption from latent periodic behavior during inference or training. Use the observed extinction threshold to adapt the activation threshold or recurrent gain, stopping once all tested trajectories reach the zero state and increasing the threshold when trajectories enter nontrivial cycles.
Useful5/10
Difficulty4/10
Novelty8/10