Ghost Dynamics in Receptor Signalling Networks: A Fast--Slow Adaptive Extension of Competitive Cancer Inhibition Models
arXiv:2608.15300
2026
Dynamics
2 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper provides a transferable fast–slow mechanism: a rapidly relaxing variable can be reduced quasi-steadily, while a slowly adapting variable can move an activity subsystem through a saddle-node fold. Near the fold, trajectories exhibit a quantitatively predictable ghost delay, with residence time proportional to the inverse square root of the distance from the fold and, under slow transverse passage, a delay of order \(\varepsilon^{-1/3}\). This suggests neural architectures with fast feature states, slower adaptive context states, and an explicit fold-distance controller that allocates computation or memory when the network enters a ghost regime. The mechanism is especially promising for recurrent, state-space, neural-ODE, and long-horizon models because it predicts when transient persistence and delayed regime switching should occur rather than treating them as unexplained memory.
Ideas from this paper
✗ Failed on benchmark
2026
Replace a single recurrent state update with fast feature relaxation, activity evolution, and a slow adaptive state that modulates the activity vector field. Tune the activity subsystem near a controllable saddle-node so that it retains a useful transient regime for a predictable number of steps, enabling delayed switching and long-horizon memory without requiring a large hidden state.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use the estimated distance to a saddle-node ghost as an inference-time controller for recurrent or neural-ODE computation. Far from a fold, take large integration steps or update only the fast state; near the fold, reduce the step size or allocate extra recurrent evaluations because the state is expected to linger and become sensitive to small parameter changes.
Useful7/10
Difficulty5/10
Novelty8/10