Sequential Monte Carlo for Resilient Networks: Assessment, Mitigation, and Generative Modeling

Abstract: Resilience is becoming crucial for future wireless networks, which must withstand, adapt to, and recover from rare but potentially cascading disruptions. This paper develops a sequential Monte Carlo (SMC) simulation framework for such systems, in which resilience failures are formulated as path-dependent rare events arising from staged degradation and delayed recovery, and are decomposed into semantically interpretable levels defined by a reaction coordinate. Building on this structure, we present a fixed-level splitting approach with budget-aware population control, enabling efficient estimation of rare non-recovery probabilities. We discuss the potential reuse of SMC checkpoints as representative near-critical states for policy evaluation and simulation-based selection. We further extend the methodology to learned stochastic simulation by using generative sequence models as restartable surrogates within data-driven digital twins. We showcase the framework in a delay-critical wireless network use case, where SMC substantially improves over standard Monte Carlo in rare-event regimes with both physical and learned simulators.

• The paper introduces a budget-adaptive, fixed-level SMC method that estimates path-dependent non-recovery probabilities more efficiently than naive Monte Carlo, reaching about 10⁻⁸ versus 2.4×10⁻⁴ under equal computational cost in the case study.
• The framework reuses near-critical trajectory checkpoints to compare finite sets of mitigation policies, selecting recovery actions with bounded lookahead while preserving causal evaluation through fresh post-decision simulations.
• The paper integrates criticality-aware conditional diffusion surrogates into data-driven digital twins, showing that DDPM-based SMC can reproduce delay and persistence-tail behavior while retaining rare-event estimation advantages over surrogate-based Monte Carlo.

Overview and motivation

This paper develops a sequential Monte Carlo (SMC) framework for assessing and controlling resilience in future wireless networks, where resilience failures are treated as path-dependent rare events arising from staged degradation and delayed recovery. The work extends the authors' earlier conference paper (López, 1 Apr 2026) with a formal treatment of estimator design, computational budgeting, mitigation-policy evaluation, and the integration of learned generative surrogates within data-driven digital twins (DTs). The central premise is that naive Monte Carlo (MC) estimation of rare non-recovery probabilities requires $\mathcal{O}(1/p)$ full-trajectory simulations, which is prohibitive when $p \ll 1$, whereas SMC exploits the sequential structure of degradation by splitting trajectories as they cross intermediate levels of a reaction coordinate.

Problem formulation

The system is modeled as a stochastic process $X(t)$ over a finite horizon $T$, with a failure event $\xi$ defined as hitting a fault set $\mathcal{F}$ at least once during the horizon. Because $\xi$ depends on the trajectory rather than the terminal state, it is path-dependent. A reaction coordinate $g: \mathcal{X} \to \mathbb{R}$ induces nested level sets $\mathcal{L}_0 \supset \cdots \supset \mathcal{L}_K$ with $\mathcal{L}_K \subseteq \mathcal{F}$, allowing the rare-event probability to factorize as $p \ll 1$0 with stage-wise conditional probabilities $p \ll 1$1. The paper adopts fixed-level splitting rather than adaptive multilevel splitting (AMS) or subset simulation, arguing that semantically meaningful levels aligned with resilience phases (nominal operation, degradation, service-level agreement violation, non-recovery) preserve interpretability of intermediate states — a property the authors consider more valuable for resilience studies than aggressive variance minimization.

Budget-aware population control

A key methodological contribution is a budget-adaptive population-control mechanism. Levels are fixed a priori from semantic criteria, so conditional probabilities $p \ll 1$2 may differ substantially across stages, risking particle extinction at difficult transitions. The proposed algorithm fixes a total computational budget $p \ll 1$3 and, at each level, samples trajectory continuations with fresh randomness until both a success threshold $p \ll 1$4 and an attempt threshold $p \ll 1$5 are met, or the budget is exhausted. The next pool size scales inversely with the estimated transition probability:

$p \ll 1$6

so difficult transitions induce larger subsequent populations. The final estimator retains the multiplicative structure $p \ll 1$7.

The paper acknowledges that outcome-dependent stopping introduces bias, as in other adaptive SMC schemes. Two theorems quantify this: under stopping dominated by $p \ll 1$8, the relative bias and variance of each stage estimator scale approximately as $p \ll 1$9; under approximate independence across levels, the product estimator's relative bias and variance follow multiplicative accumulation laws that reduce to first-order sums across levels. The practical implication is that overall error accumulates roughly linearly in the number of levels, making the estimator sensitive to poorly estimated stages; increasing $X(t)$0 and $X(t)$1 yields asymptotic consistency, and batch-wise stopping checks reduce bias.

Mitigation policies via checkpoint reuse

The framework reuses first-hitting checkpoints stored during splitting as representative near-critical states for policy evaluation. Candidate policies $X(t)$2 modify disturbance, recovery, or corrective dynamics, inducing policy-dependent failure probabilities $X(t)$3 and stage-wise quantities $X(t)$4. Provided the controlled process remains Markovian with respect to the checkpointed state and the level sets remain policy-invariant, standard SMC guarantees carry over, so differences in estimated performance are attributable to policy effects.

At a policy-hosting level, a decision-support procedure branches each checkpoint into inner simulations under candidate policies and selects

$X(t)$5

where $X(t)$6 captures implementation cost and $X(t)$7 is a lookahead depth. The authors are explicit that this is bounded, simulation-driven selection over a finite policy set applied selectively at near-critical states — not global policy synthesis or optimal control. Causality is preserved because simulated futures inform only the choice, while post-decision evolution restarts from the same checkpoint with fresh randomness.

Generative surrogates for data-driven digital twins

Recognizing that explicit simulators are rarely available in deployment, the paper extends the framework to learned stochastic simulators. A sequence-to-sequence model learns the conditional continuation law $X(t)$8 over history/future windows, with side information $X(t)$9 encoding regime, control action, reaction coordinate, or persistence counters. Three parameterizations are discussed: a single conditional generator, regime-specific generators (which risk mode averaging avoided but require per-regime data and may introduce switching discontinuities), and mixture-of-experts architectures with gating weights (smoother regime transitions but susceptible to expert collapse on underrepresented rare regimes).

A distinct contribution is criticality-aware data representation: training windows are stratified by reaction-coordinate level into subsets $T$0, and batches are drawn from a level-aware mixture $T$1 with larger weights on high-criticality windows. The authors argue that model expressiveness alone is insufficient — if training data do not expose degradation, persistence, and near-failure transitions, the surrogate reproduces average dynamics and misses the tail paths that dominate resilience failures.

Delay-critical wireless network case study

The use case models an end-to-end service queue with constant normalized load $T$2, backlog evolution, logistic capacity mapping driven by a latent health state with log-normal autoregressive fatigue, and Little's-law delay approximation. A resilience break occurs if delay exceeds a threshold $T$3 continuously for a grace period $T$4 after first exceedance — explicitly a two-stage path-dependent event. The augmented state includes a persistence counter $T$5, rendering the process time-homogeneous Markov and the failure event equivalent to hitting $T$6. The reaction coordinate combines normalized delay and persistence progress, $T$7, with four levels capturing progression toward critical affectation and non-recovery.

Rare-event estimation. Under equal cost ($T$8 base-simulator steps), MC can resolve failure probabilities only down to roughly $T$9 (about 4167 full trajectories), whereas SMC's conservative resolution scale $\xi$0 reaches approximately $\xi$1. This is the paper's strongest quantitative claim: a resolution improvement of several orders of magnitude at identical computational cost in the regime $\xi$2.

Reconfiguration. With candidate policies accelerating the recovery rate at proportional cost, myopic selection at level $\xi$3 shows that larger policy sets yield better recovery-cost trade-offs; low-rank (cheap) policies dominate under low stress variability $\xi$4, while aggressive policies gain traction as stress increases. The authors note this reveals that consistently aggressive fault handling can incur costs affecting future system states.

Diffusion-based surrogate. A conditional DDPM with GRU history encoder, criticality-context MLP, and 1-D U-Net denoiser learns delay-window transitions, trained with criticality-reweighted loss and DDIM-style sampling (50 reverse steps) for tractable inference. The surrogate reproduces the physical model's delay mean/standard deviation trajectories and the distribution of longest threshold-exceedance runs — the latter directly tied to persistence-driven failure. Under matched inference cost, DDPM-SMC estimates rarer events than DDPM-MC and closely tracks physical-model baselines across load values, providing evidence that a learned diffusion DT can substitute for the physical simulator within SMC-based resilience assessment.

Limitations and open questions

Several limitations are conceded explicitly. The bias/variance scaling laws rely on assumptions of approximate independence across levels and stopping dominated by the success threshold; when both stopping conditions are active or the global budget truncates the procedure, the expressions become more involved and are not fully characterized. The relative-variance approximation ignores inter-stage dependence due to resampling. The policy-selection mechanism is myopic or shallow-lookahead by construction, with deeper lookahead increasing cost without formal optimality guarantees. For generative surrogates, regime-specific and mixture-of-experts designs raise data-partitioning and expert-collapse concerns for rare regimes, and the numerical validation uses only the single conditional generator. The case study assumes constant offered load to isolate resilience effects, a simplification relative to realistic traffic fluctuation. Open questions include whether the bias induced by outcome-dependent stopping remains acceptable at the population sizes used in practice, how surrogate error propagates through the multiplicative SMC estimator, and whether deeper-lookahead policy selection justifies its cost in operational settings.

Conclusion

This paper provides a formal, budget-aware SMC methodology for resilience assessment in wireless networks, coupling interpretable fixed-level splitting with checkpoint-based mitigation-policy selection and diffusion-based stochastic surrogates for digital twins. Its principal results are the demonstrated orders-of-magnitude efficiency gains over naive MC in rare non-recovery regimes under matched budgets, and evidence that these gains persist when the physical simulator is replaced by a learned generative surrogate. The framework's scope is deliberately bounded — local policy selection rather than optimal control, and a single-regime surrogate in the validated experiments — leaving the generalization of these components as clearly stated open problems.