Jun 2026· arXiv.org· Vol abs/2606.30069· 0 citations· 14 references
Computer Science
Abstract
Complex contagion models, in which adoption requires reinforcement from multiple neighbors, have been extensively studied in the monotone (no-recovery) setting, but the phase diagram of threshold models with SIS-like recovery on networks remains unmapped. We study a stochastic Watts-threshold SIS model on Erdos-Renyi and Barabasi-Albert networks and reconstruct its extinction-persistence phase boundary in the joint parameter space of transmission rate $\beta$, adoption threshold $\theta$, and infectious duration $d$. Using adaptive Delaunay-based sampling and weighted logistic regression on over 180,000 Monte Carlo trials, we find that: (i) the boundary is well described by a six-parameter interaction model whose structure is invariant across both topologies; (ii) the transition is sharp, with the 10-90\% extinction-probability band spanning only $\Delta\theta \approx 0.005$-$0.008$; and (iii) the adoption threshold is the dominant parameter governing epidemic feasibility, with transmission rate and infectious duration playing secondary and asymmetric roles. The characterization provides a quantitative reference for the complex-contagion analogue of the classical SIS epidemic threshold.
Extreme epidemic risk is controlled by the right tail of the outbreak-size distribution, but this distribution is generally unknown for non-Markovian spreading on networks. Here we determine this distribution by mapping non-Markovian SIR dynamics to an effective Markovian description. We show that arbitrary infection a...
The framework supports data-informed platform governance by linking propagation thresholds, algorithmic down-ranking, reply thread moderation, intervention cost, and robustness bounds within a common threshold control language for practical settings.
The application of Monte Carlo simulation to stochastic resource-constrained project scheduling (SRCPSP) relies fundamentally on what we term the Topological Continuity Assumption [1]–the implicit hypothesis that the underlying directed acyclic graph (DAG) structure remains invariant across simulation iterations. We de...
Venkata Mukesh Chadaram· International Conference on...· 0 citations
This paper provides the rigorous mathematical foundations and algorithmic details underlying the CPMC framework, and details a dynamic programming scheme to exactly implement complex boundary conditions - including patient-zero and macroscopic outbreak-size constraints - enabling the rejection-free generation of valid...
Thomas Barthel, Jiazheng Sun, Jhao-Hong Peng· 1 citation
This work shows that a dual-threshold bootstrap percolation model on random hypergraphs separates a connected active backbone from large-scale endogenous activation, providing a basis for predicting cascade risk and designing targeted node- and group-level interventions in complex systems.
This work forms a correction-aware network model that tracks susceptible, exposed, infectious, and corrected agents and derive its early-invasion condition for heterogeneous communication networks, and couple this propagation model to an analytic majority-vote benchmark in which a clean-task reliability target imposes...
