arXiv subjects

René Schmieding

Publications and source records attributed to René Schmieding.

4 recordsLinked to original sources

arXiv2026

MEmilio -- A high performance Modular EpideMIcs simuLatIOn software for multi-scale and comparative simulations of infectious disease dynamics

Epidemic and pandemic preparedness with rapid outbreak response rely on timely, trustworthy evidence. Mathematical models are crucial for supporting timely and reliable evidence generation for public health decision-making with models spanning approaches from compartmental and metapopulation models to detailed agent-based simulations. Yet, the accompanying software ecosystem remains fragmented across model types, spatial resolutions, and computational targets, making models harder to compare, extend, and deploy at scale. Here we present MEmilio, a modular, high-performance framework for epidemic simulation that harmonizes the specification and execution of diverse dynamic epidemiological models within a unified and harmonized architecture. MEmilio couples an efficient C++ simulation core with coherent model descriptions and a user-friendly Python interface, enabling workflows that run on laptops as well as high-performance computing systems. Standardized representations of space, demography, and mobility support straightforward adaptations in resolution and population size, facilitating systematic inter-model comparisons and ensemble studies. The framework integrates readily with established tools for uncertainty quantification and parameter inference, supporting a broad range of applications from scenario exploration to calibration. Finally, strict software-engineering practices, including extensive unit and continuous integration testing, promote robustness and minimize the risk of errors as the framework evolves. By unifying implementations across modeling paradigms, MEmilio aims to lower barriers to reuse and generalize models, enable principled comparisons of implicit assumptions, and accelerate the development of novel approaches that strengthen modeling-based outbreak preparedness.

q-bio.PE↗

arXiv2026

Efficient numerical computation of traveler states in explicit mobility-based metapopulation models: Mathematical theory and application to epidemics

Metapopulation models are powerful tools for capturing the spatio-temporal spread of infectious diseases. Models that explicitly account for traveler origins and destinations, such as Lagrangian metapopulation models, enable a detailed representation of mobility and traveling subpopulations. However, in densely connected networks, tracking these subpopulations leads to quadratic growth in system size with the number of spatial patches. While specific approaches reducing the effort of traveler state estimation have been proposed, these approaches are either model-specific or heuristic. Here, we introduce a Runge-Kutta (RK) stage-aligned computation of traveler states that leverages the precomputed intermediate stage values of explicit RK methods under the assumption of localized homogeneous mixing. We prove that the resulting numerical solution is identical to that of the standard Lagrangian formulation when solved with the corresponding RK method. For compartments without inflows, we further show that the exact same results can be obtained using a simple algebraic scaling based on the initial traveler share. When embedded in a recently proposed metapopulation framework that combines local dynamics with discrete mobility, the stage-aligned approach eliminates the need for heuristic traveler approximations. In contrast to the standard Lagrangian formulation, the resulting method enables efficient simulations by reducing the global ODE system to linear scaling in the number of patches, while the remaining quadratic interactions are handled through highly efficient algebraic updates. Numerical experiments confirm the theoretical results, demonstrating optimal convergence order. Benchmarks on fully connected networks with up to 1025 patches, 1024 local travel connections, and six age groups achieve speedups of up to 76 and 50 for first- and fourth-order Runge-Kutta methods, respectively.

math.NA↗

arXiv2025

Revisiting the Linear Chain Trick in epidemiological models: Implications of underlying assumptions for numerical solutions

In order to simulate the spread of infectious diseases, many epidemiological models use systems of ordinary differential equations (ODEs) to describe the underlying dynamics. These models incorporate the implicit assumption, that the stay time in each disease state follows an exponential distribution. However, a substantial number of epidemiological, data-based studies indicate that this assumption is not plausible. One method to alleviate this limitation is to employ the Linear Chain Trick (LCT) for ODE systems, which realizes the use of Erlang distributed stay times. As indicated by data, this approach allows for more realistic models while maintaining the advantages of using ODEs. In this work, we propose an advanced LCT SECIR-type model incorporating eight infection states with demographic stratification. We review key properties of the corresponding LCT model and demonstrate that predictions derived from a simple ODE-based model can be significantly distorted, potentially leading to wrong political decisions. Our findings demonstrate that the influence of distribution assumptions on the behavior at change points and on the prediction of epidemic peaks is substantial, while the assumption has no effect on the final size of the epidemic. With respect to prior findings in literature, we demonstrate that the influence of the number of subcompartments on the timing and size of the epidemic peak is nontrivial and that a general statement cannot be obtained. We, then, show how these age-resolved LCT SECIR-type models capture the spread of SARS-CoV-2 in Germany in 2020. Eventually, we study the implications on the time-to-solution for different LCT models using fixed and adaptive step-size Runge-Kutta methods and provide computational performance for these models in the MEmilio software framework, also using distributed memory parallelism to speed up ensemble runs.

math.DS↗

arXiv2024

Hybrid metapopulation agent-based epidemiological models for efficient insight on the individual scale: a contribution to green computing

Emerging infectious diseases and climate change are two of the major challenges in 21st century. Although over the past decades, highly-resolved mathematical models have contributed in understanding dynamics of infectious diseases and are of great aid when it comes to finding suitable intervention measures, they may need substantial computational effort and produce significant CO2 emissions. Two popular modeling approaches for mitigating infectious disease dynamics are agent-based and population-based models. Agent-based models (ABMs) offer a microscopic view and are thus able to capture heterogeneous human contact behavior and mobility patterns. However, insights on individual-level dynamics come with high computational effort that scales with the number of agents. On the other hand, population-based models using e.g. ordinary differential equations (ODEs) are computationally efficient even for large populations due to their complexity being independent of the population size. Yet, population-based models are restricted in their granularity as they assume a (to some extent) homogeneous and well-mixed population. To manage the trade-off between computational complexity and level of detail, we propose spatial- and temporal-hybrid models that use ABMs only in an area or time frame of interest. To account for relevant influences to disease dynamics, e.g., from outside, due to commuting activities, we use population-based models, only adding moderate computational costs. Our hybridization approach demonstrates significant reduction in computational effort by up to 98% -- without losing the required depth in information in the focus frame. Concluding, hybrid epidemiological models can provide insights on the individual scale where necessary, using aggregated models where possible, thereby making a contribution to green computing.

q-bio.PE↗