arXiv subjects

Aram Vajdi

Publications and source records attributed to Aram Vajdi.

9 recordsLinked to original sources

arXiv2026

Optimal Scheduling of Dengue Vector Control

Dengue transmission is shaped by the population dynamics of the Aedes aegypti mosquito, making vector control a central strategy for disease mitigation. The impact of interventions such as larvicide, adulticide, and breeding-site reduction depends critically on their timing under fluctuating environmental conditions. We build on a high-fidelity, non-Markovian mechanistic model of the Aedes life cycle that captures stage-structured, temperature-dependent developmental delays, and mortality, and extend it to incorporate multiple vector control measures. Rather than using continuous abstract control amplitudes as in standard optimal control formulations, we introduce intervention-specific temporal profiles that better reflect operational practice. We then develop an adjoint-based gradient descent framework to compute the optimal timing of a sequence of interventions by minimizing the time-dependent dengue reproduction number, R0. Numerical simulations based on seasonal temperature data from Miami, Florida, show that appropriately timed combinations of interventions can substantially suppress transmission risk, with outcomes strongly influenced by seasonal temperature variation and intervention duration. We further propose embedding the resulting optimization framework within a Model Predictive Control architecture, yielding a closed-loop approach for real-time, surveillance-driven vector management under environmental and operational uncertainty.

math.DS↗

arXiv2026

FlashSpread: IO-Aware GPU Simulation of Non-Markovian Epidemic Dynamics via Kernel Fusion

Non-Markovian (renewal) epidemic simulation on multi-million-node contact networks is essential for realistic forecasting under general age-dependent holding-time distributions (log-normal, Weibull, Erlang, and similar), but the age-dependent hazard forces dense per-step updates that render the sparse event-queue strategies of standard CPU methods ineffective. We present FlashSpread, a GPU framework that consolidates the per-step renewal pipeline (CSR traversal, numerically stable erfcx-based hazard evaluation, Bernoulli tau-leaping, state transition, and next-step infectivity write-back) into a single fused Triton kernel whose intermediates never leave streaming-multiprocessor registers, with block-scalar skips that preserve CUDA Graph capture and a degree-aware CSR dispatch (thread / warp / edge-merge) that keeps the peak throughput on scale-free graphs. On an NVIDIA A100 the fused CUDA-Graph engine reaches 8.09 Giga-NUPS at N = 10^6 on a uniform-degree graph, a 217x strict hardware speedup over optimised CPU tau-leaping at the same N; on a Barabasi-Albert graph of the same size the merge-based dispatch recovers 4.5x (0.45 to 2.0 Giga-NUPS) over the default kernel, and the framework scales to N = 10^8 on a single A100 (40 GB), with a mixed-precision storage path that extends the L2-reachable scale by roughly 3x and delivers a 1.15x throughput lift at the far bandwidth-bound end. Validation against an exact non-Markovian Gillespie reference shows a structural-bias floor of approximately 6% on peak infection and approximately 7% on final attack rate that does not detectably decrease as epsilon nears 0 across two decades of tolerance, comfortably within typical epidemiological parameter uncertainty. Code: https://github.com/Shakeri-Lab/FlashSpread.

cs.DC↗

arXiv2023

Assessing Dengue Risk Globally Using Non-Markovian Models

Dengue is a vector-borne disease transmitted by Aedes mosquitoes. The worldwide spread of these mosquitoes and the increasing disease burden have emphasized the need for a spatio-temporal risk map capable of assessing dengue outbreak conditions and quantifying the outbreak risk. Given that the life cycle of Aedes mosquitoes is strongly influenced by habitat temperature, numerous studies have utilized temperature-dependent development rates of these mosquitoes to construct virus transmission and outbreak risk models. In this study, we advance existing research by developing a mechanistic model for the mosquito life cycle that accurately accounts for the non-Markovian nature of the process. By fitting the model to data on human dengue cases, we estimate several model parameters, allowing the development of a global spatiotemporal dengue risk map. This risk model employs temperature and precipitation data to assess the environmental suitability for dengue outbreaks in a given area. Furthermore, we demonstrate how to reduce the model to the corresponding differential equations, enabling us to utilize existing methods for analyzing the system and fitting the model to observations. This approach can be further applied to similar non-Markovian processes that are currently described with less accurate Markovian models.

stat.AP↗

arXiv2021

A Non-Markovian Model to Assess Contact Tracing for the Containment of COVID-19

COVID-19 remains a challenging global threat with ongoing waves of infections and clinical disease which have resulted millions of deaths and an enormous strain on health systems worldwide. Effective vaccines have been developed for the SARS-CoV-2 virus and administered to billions of people; however, the virus continues to circulate and evolve into new variants for which vaccines may ultimately be less effective. Non-pharmaceutical interventions, such as social distancing, wearing face coverings, and contact tracing, remain important tools, especially at the onset of an outbreak. In this paper, we assess the effectiveness of contact tracing using a non-Markovian, network-based mathematical model. To improve the reliability of the novel model, empirically determined distributions were incorporated for the transition time of model state pairs, such as from exposed to infected states. The first-order closure approximation was used to derive an expression for the epidemic threshold, which is dependent on the number of close contacts. Using survey contact data collected during the 2020 fall academic semester from a university population, we determined that even four to five contacts are sufficient to maintain viral transmission. Additionally, our model reveals that contact tracing can be an effective outbreak mitigation measure by reducing the epidemic size by more than three-fold. Increasing the reliability of epidemic models is critical for accurate public health planning and use as decision support tools. Moving toward more accurate non-Markovian models built upon empirical data is important.

stat.AP↗

arXiv2018

SIS Epidemics in Multilayer-based Temporal Networks

To improve the accuracy of network-based SIS models we introduce and study a multilayer representation of a time-dependent network. In particular, we assume that individuals have their long-term (permanent) contacts that are always present, identifying in this way the first network layer. A second network layer also exists, where the same set of nodes can be connected by occasional links, created with a given probability. While links of the first layer are permanent, a link of the second layer is only activated with some probability and under the condition that the two nodes, connected by this link, are simultaneously participating to the temporary link. We develop a model for the SIS epidemic on this time-dependent network, analyze equilibrium and stability of the corresponding mean-field equations, and shed some light on the role of the temporal layer on the spreading process.

physics.soc-ph↗

arXiv2018

Contact Adaption during Epidemics: A Multilayer Network Formulation Approach

People change their physical contacts as a preventive response to infectious disease propagations. Yet, only a few mathematical models consider the coupled dynamics of the disease propagation and the contact adaptation process. This paper presents a model where each agent has a default contact neighborhood set, and switches to a different contact set once she becomes alert about infection among her default contacts. Since each agent can adopt either of two possible neighborhood sets, the overall contact network switches among 2^N possible configurations. Notably, a two-layer network representation can fully model the underlying adaptive, state-dependent contact network. Contact adaptation influences the size of the disease prevalence and the epidemic threshold---a characteristic measure of a contact network robustness against epidemics---in a nonlinear fashion. Particularly, the epidemic threshold for the presented adaptive contact network belongs to the solution of a nonlinear Perron-Frobenius (NPF) problem, which does not depend on the contact adaptation rate monotonically. Furthermore, the network adaptation model predicts a counter-intuitive scenario where adaptively changing contacts may adversely lead to lower network robustness against epidemic spreading if the contact adaptation is not fast enough. An original result for a class of NPF problems facilitate the analytical developments in this paper.

cs.SI↗

arXiv2017

Missing Link Identifcation Using SIS Epidemic Traces

The study of SIS epidemics on networks has stressed the role of the network topology on the spreading process. However, accurate models of SIS epidemics rely on the complete knowledge of the network topology, which is often not available. This paper tackles the problem of inferring the network topology from observed infection time traces, especially where the network topology is partially known or known with some uncertainty. We propose a Bayesian method to infer the posterior probability of uncertain links in the network, and we derive closed form equations for these probabilities. We also propose a numerical approach based on a Gibbs sampling when the number of uncertain links is large such that using the closed form equations becomes impractical. Numerical results show the capability of the proposed approach to assign high probability to existing links and low probability to non-existing links of the network when the SIS traces are sufficiently long.

physics.soc-ph↗

arXiv2016

Delocalized Epidemics on Graphs: A Maximum Entropy Approach

The susceptible--infected--susceptible (SIS) epidemic process on complex networks can show metastability, resembling an endemic equilibrium. In a general setting, the metastable state may involve a large portion of the network, or it can be localized on small subgraphs of the contact network. Localized infections are not interesting because a true outbreak concerns network--wide invasion of the contact graph rather than localized infection of certain sites within the contact network. Existing approaches to localization phenomenon suffer from a major drawback: they fully rely on the steady--state solution of mean--field approximate models in the neighborhood of their phase transition point, where their approximation accuracy is worst; as statistical physics tells us. We propose a dispersion entropy measure that quantifies the localization of infections in a generic contact graph. Formulating a maximum entropy problem, we find an upper bound for the dispersion entropy of the possible metastable state in the exact SIS process. As a result, we find sufficient conditions such that any initial infection over the network either dies out or reaches a localized metastable state. Unlike existing studies relying on the solution of mean--field approximate models, our investigation of epidemic localization is based on characteristics of exact SIS equations. Our proposed method offers a new paradigm in studying spreading processes over complex networks.

physics.soc-ph↗

arXiv2016

GEMFsim: A Stochastic Simulator for the Generalized Epidemic Modeling Framework

The recently proposed generalized epidemic modeling framework (GEMF) \cite{sahneh2013generalized} lays the groundwork for systematically constructing a broad spectrum of stochastic spreading processes over complex networks. This article builds an algorithm for exact, continuous-time numerical simulation of GEMF-based processes. Moreover the implementation of this algorithm, GEMFsim, is available in popular scientific programming platforms such as MATLAB, R, Python, and C; GEMFsim facilitates simulating stochastic spreading models that fit in GEMF framework. Using these simulations one can examine the accuracy of mean-field-type approximations that are commonly used for analytical study of spreading processes on complex networks.

physics.soc-ph↗