New Mexico Supercomputing Challenge

Comparison of Disease Propagation Models that Predict the Speed of an Outbreak

Team: 5

School: Albuquerque Academy

Area of Science: Epidemiology

Interim: Interim Report

Team 5

1. Definition of the Problem

Diseases are common and often dangerous without proper precautions. Throughout the years, analysts and scientists have studied outbreaks of viruses to predict what would happen in the case of another outbreak, and could then plan what to do. Predicting the speed and scale of an outbreak would greatly help medical authorities prepare for it. This takes large amounts of time, which can be a major problem if outbreaks are quick to occur. This year we plan to create software simulations that model the propagation of several diseases. This is built upon our project’s accomplishments from last year, in which only one disease and algorithm were simulated.
We are going to utilize several different algorithms to model the propagation of a few diseases. Some of these algorithms may include: RBAs (Rule Based Algorithm), MBAs (Math Based Algorithm) and RMBA (Rule and Math hybrid Based Algorithm). The RBA algorithm uses rules to determine whether an agent’s state of infection (susceptible, infected, or recovered). The MBA algorithm uses math to determine an agent’s state. The goal of our project is to effectively and accurately model the spread of multiple viruses, through the use of separate algorithms for each.

2. Plan for Computationally Solving the Problem

We have chosen to simulate the propagation of several diseases using the Java programming language. Propagation model simulations are graphically displayed inside of a UI (User Interface) software application. A simulation run will affect thousands of Agents over several hundred days. The agents will be independent of one another using threads and will travel daily according to their occupation. We plan to implement a transportation algorithm so that the agents will travel along routes and provide their location and state of infection. Our application will show propagation quantitatively through a graph plotting the number of infected agents per day. Last, actual data will be gathered on previous outbreaks for comparison analysis.

3. Description of the Progress Made to Date

A Java software engine has been created which can successfully run a sample simulation. This simulation moves thousands of agents randomly on a map of the United States showing a 365 day simulation. In a simulation, thousands of independent agents are instantiated and each agent runs in its own thread which allows the agents, like people, to "live" individual lives. This is a step above last year’s project which used a static-structure to model agents. Software stubs have been added into each agent's class for instantiating child classes which will govern agent life patterns including travel and social behavior. Actual virus propagation data from epidemics has successfully been acquired. This raw data acquired has been plotted and initial analysis has begun.

4. Expected Results

The goal of this project is to accurately model the spread of selected diseases using different algorithms for each disease. We intend to do this with both graphical and computational analysis to gain an understanding of the basis of disease propagation, and to determine any general patterns.

5. Citations

Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on strings. Cambridge University Press, Cambridge (2007)
Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: A review. ACM Computing Survey 31, 264–323 (2000)
National Center for Biotechnology Information (NCBI): Influenza virus resources (2008),
Russell, C.A., Jones, T.C., Barr, I.G., Cox, N.J., Garten, R.J., et al.: The global circulation of seasonal influenza A (H3N2) viruses. Science 320, 340–346 (2008)
Zhang T, Soh SH, Fu X, Lee KK, Wong L, Ma S, Xiao G, Kwoh CK. HPCgen a fast generator of contact networks of large urban cities for epidemiological studies. International Conference on Computational Intelligence, Modeling and Simulation. 2009. pp. 198–203.
Martín G, Marinescu MC, E Singh D, Carretero J. EpiGraph: a scalable simulation tool for epidemiological studies. The 2011 International Conference on Bioinformatics and Computational Biology. 2011. pp. 529–536.
Keeling MJ, Eames KT. Networks and epidemic models. J R Soc Interface. 2005;2(4):295–307. doi: 10.1098/rsif.2005.0051.
Newman M. Spread of epidemic disease on networks. Phys Rev E Stat Nonlin Soft Matter Phys. 2002;66:016128.
Read J, Eames K, Edmunds W. Dynamic social networks and the implications for the spread of infectious disease. J R Soc Interface. 2008;5(26):1001. doi: 10.1098/rsif.2008.0013.
Coelho FC, Cruz OG, Codeco CT. Epigrass: a tool to study disease spread in complex networks. Source Code Biol Med. 2008;3:3. doi: 10.1186/1751-0473-3-3.
Chung F, Lu L. Connected components in random graphs with given expected degree sequences. Annals of Combinatorics. 2002;6:125–145. doi: 10.1007/PL00012580.
Volz E, Meyers L. Susceptible-infected-recovered epidemics in dynamic contact networks. Proc Biol Sci. 2007;274(1628):2925. doi: 10.1098/rspb.2007.1159.
Mossong J, Hens N, Jit M, Beutels P, Auranen K, Mikolajczyk R, Massari M, Salmaso S, Tomba G, Wallinga J. et al. Social contacts and mixing patterns relevant to the spread of infectious diseases. PloS Med. 2008;5(3):e74. doi: 10.1371/journal.pmed.0050074.
Bian L. A conceptual framework for an individual-based spatially explicit epidemiological model. Environment and Planning B. 2004;31(3):381–396. doi: 10.1068/b2833.
Mao L, Bian L. Spatial-temporal transmission of influenza and its health risks in an urbanized area. Computers, Environment and Urban Systems. 2010;34(3):204–215. doi: 10.1016/j.compenvurbsys.2010.03.004.
Carley K, Fridsma D, Casman E, Yahja A, Altman N, Chen LC, Kaminsky B, Nave D. BioWar: scalable agent-based model of bioattacks. IEEE Transactions on Systems, Man and Cybernetics. 2006;36(2):252–265.
Eichner M, Schwehm M, Duerr HP, Brockmann S. The influenza pandemic preparedness planning tool InfluSim. BMC Infect Dis. 2007;7:17. doi: 10.1186/1471-2334-7-17.
Miritello G, Moro E, Lara R. Dynamical strength of social ties in information spreading. Phys Rev E Stat Nonlin Soft Matter Phys. 2011;83(4):045102.
Longini IM, Halloran EM, Nizam A, Yang Y. Containing pandemic influenza with antiviral agents. Am J Epidemiol. 2004;159(7):623–633. doi: 10.1093/aje/kwh092.

Team Members:

  Marcus Dominguez-Kuhne
  David Kohler
  Josh Konopka
  Trevor Kann
  Hisham Temmar

Sponsoring Teacher: Jim Mims

Mail the entire Team

For questions about the Supercomputing Challenge, a 501(c)3 organization, contact us at: consult1314 @

New Mexico Supercomputing Challenge, Inc.
Post Office Box 30102
Albuquerque, New Mexico 87190
(505) 667-2864

Supercomputing Challenge Board of Directors
Board page listing meetings and agendas
If you have volunteered for the Challenge, please fill out our In Kind form.