MakarovSuites
English
EnglishDeutschРусскийУкраїнськаFrançaisEspañolItalianoPolski
Contact & licences

Math

Epidemic: SIR on a network

Compare an SIR compartment model with stochastic infection and recovery on a contact network. Explore transmission, recovery, initial immunity and variability between runs.

Epidemic: SIR on a network — Actual application image
Actual application image

Try this

Compare homogeneous SIR equations with random transmission on a fixed contact graph. Rates use days; network outcomes vary with the seed. This is a teaching model, not an epidemic forecast.

Equations used in the module
Equations
S′ = −βSI; I′ = βSI − γI; R′ = γI
S + I + R = 1; Re = βS/γ
Network events: exponential waiting time with total hazard
Susceptible hazard = β × infected neighbours / mean degree

Related experiments

Back to catalogue
Queues: why 90 % busy means waiting — Actual application image

Math

Queues: why 90 % busy means waiting

Run an event-based FIFO M/M/1 queue. Inspect congestion, measured residence times, stable and overloaded regimes, and the finite-run approach to Little’s law.

Stable matching — Actual application image

Math

Stable matching

Watch Gale–Shapley matching progress through proposals, tentative engagements and rejections. Reverse the proposing side and verify the absence of blocking pairs at completion.

Prisoner's dilemma tournament — Actual application image

Math

Prisoner's dilemma tournament

Compare five strategies in a noisy repeated prisoner’s dilemma, inspect cooperation histories and watch population shares evolve from a tournament payoff matrix.