James Neill, Lloyd A. C. Chapman, Chris Jewell
9 min
Abstract
Stochastic state-transition models of infectious disease transmission can be used to deduce relevant drivers of transmission when fitted to data using statistically principled methods. Fitting this individual-level data requires inference on individuals' unobserved disease statuses over time, which form a high-dimensional and highly correlated state space. We introduce a novel Bayesian (data-augmentation Markov chain Monte Carlo) algorithm for jointly estimating the model parameters and unobserved disease statuses, which we call the Rippler algorithm. This is a non-centred method that can be applied to any individual-based state-transition model. We compare the Rippler algorithm to the state-of-the-art inference methods for individual-based stochastic epidemic models and find that it performs better than these methods as the number of disease states in the model increases.
Sam: Good question. In the usual way, you'd pick a new state for a person at one time point by drawing randomly from a list of possibilities based on the model's rules—like spinning a wheel divided into slices for each disease stage, where slice sizes match the chances. But that often lands on the same state again. Instead, they use a non-centred setup: draw a random number between 0 and 1 first, then see which slice it falls into by adding up the chances cumulatively—like finding your spot on a number line marked by growing pie slices. For the existing states, they calculate narrow bounds—low and high values of that number—for each person-time spot that would recreate the current disease paths exactly.
Alex: Okay, so the uniform random number picks the state through cumulative probabilities. And to propose a change—they tweak just one of those numbers outside its bounds?
Sam: Yes. They choose one person-time spot, then draw the new number there, guaranteeing it flips that state. With other numbers unchanged, they re-run the mapping forward: starting from the beginning, each new state uses its number and the updated probabilities, which now depend on the flipped upstream states, so changes propagate like a chain reaction through time and people.
Alex: Huh—so one guaranteed flip ripples downstream because probabilities at later times depend on prior states.
Sam: Precisely. To decide if this new full set of states sticks, they use a standard check called Metropolis-Hastings: compare how well the new paths fit the spotty test data versus the old ones, then adjust for how likely the tweak was in both directions. Many terms cancel out nicely, leaving just that simple comparison. This keeps the random walk fair and efficient.
Alex: So the acceptance boils down to how well the new paths match the test data, adjusted for the tweak's likelihood. Does the basic version already use the data fully, or is there a way to weave it in earlier?
Sam: The standard Rippler uses just the model's transition rules to set bounds and map uniforms to states. To make proposals smarter, they created a data-informed version: it tweaks those rules by weighting them with how well each possible state fits the actual test results for that person-time. This is done using Bayes' theorem—a way to update chances based on new evidence, like revising your guess on a friend's location after spotting clues.
Alex: Okay, so for proposing the next state, a good data fit makes that slice bigger—like the test result nudging the wheel toward likely outcomes?
Sam: Exactly. For initial states, the modified starting probabilities favor options matching the first test. For later ones, when figuring the new state from its uniform, it uses these data-weighted slices based on the upstream ripple. The bounds for current uniforms get updated similarly. Many math terms cancel in the acceptance step, leaving a simple ratio.
Alex: Huh, so the data shapes the proposals upfront without extra cost, and acceptance stays clean. Does that mean it explores better-fitting paths more often?
Sam: Yes, the paper suggests it guides the random walk toward data-plausible epidemics. They alternate parameter tweaks with multiple latent updates per cycle.
Alex: Right, so it's like giving the ripple a data compass. How does Rippler stack up against iFFBS and reversible-jump in terms of raw computing demands as models get more detailed?
Sam: First, the baseline method is forward filtering backward sampling, or FFBS: it computes chances for every possible state combo up to each time point using only past test data, then samples backward to draw a full set of hidden paths. That explodes here—each time point has as many possibilities as disease stages raised to the number of people. They fix it with individual FFBS, or iFFBS: pick one person, run a mini-version just for them while freezing others.
Alex: Okay, so iFFBS focuses narrow to stay feasible, but misses crowd effects?
Sam: Exactly, and that's where Rippler shines. Reversible-jump MCMC just updates transitions one slice at a time. iFFBS lands at quadratic cost in stages times people times time. Rippler's forward ripple computes next-state chances for every stage option per person-time, but only once per update—linear in stages times people times time, a clear edge as disease stages grow.
Alex: Huh, linear beats quadratic when compartments pile up, like adding exposure steps before infectious.
Sam: The paper tests this in simulations, starting simple with a basic outbreak splitting folks into susceptible, infective, recovered—tests hit about one in ten times. All methods trace the true hidden counts closely after runs.
Alex: So they match on a three-stage setup. What changes with more stages, like exposed phases?
Sam: They extend to an SEIR-like model, stacking extra steps for non-exponential exposure before spreading starts. To gauge exploration, they track mean absolute jump distance—average steps needed to shift between guessed states. Rippler keeps jumps solid as stages rise, while iFFBS falters harder due to that quadratic drag.
Alex: Makes sense—the linear scaling pays off with extra exposure layers. The paper mentions testing on extended exposure and multi-strain setups—how do those play out?
Sam: In the extended exposure model, they ramp states from four to ten with a hundred people over a hundred days. Rippler takes over as complexity grows, measuring bigger jumps through the possibilities per computing time spent. The multi-strain test splits infection into separate types, like different virus variants. Here, data-informed Rippler edges out the standard one, as tests help pick likely strains amid all possible switches. Overall, Rippler variants outperform baselines when states multiply, thanks to that linear cost.
Alex: Huh, so data-weighting shines when paths crisscross more. Any catches to this approach?
Sam: A key limit is it's built for individual tracking—each person's path separately, not crowd counts or grouped regions. Extending to those population models means reworking the uniform draws for bundled outcomes. It also assumes data tweaks don't zero out any chances, which fits test data but needs checking elsewhere.
Alex: Fair—stays individual-focused for now. Still, for hospital outbreaks with patient tests, that seems targeted.
Sam: Exactly. The paper positions it for routine Bayesian estimates on models with twenty-plus compartments, following strain shifts, fading immunity, or intervention effects during live surveillance. It's a grounded advance in handling tangled hidden paths from spotty data, without the scaling traps of prior methods.
Alex: That's a clear picture—efficient exploration opens doors for detailed epidemic guesses. Thanks, Sam, for walking through this.
Sam: My pleasure, Alex. This work strengthens inference on complex outbreaks. Thanks for listening to ResearchPod.