Title: Algorithmic Problems in Epidemiology
Speaker: V.S. Anil Kumar, Dept. of Computer Science, and Virginia Bioinformatics Institute, Virginia Tech
Date: November 28, 2005, 12:00 - 1:30pm
Location: DIMACS Center, CoRE Bldg, Room 431, Rutgers University, Busch Campus, Piscataway, NJ
Traditional epidemiological research has focused on rate-based differential-equation models on completely mixing populations. An alternative approach, based on a combination of network theory and discrete-event simulations, allows a more realistic setting to study epidemics in large urban areas. In this talk, we will discuss two algorithmic problems which arise out of such a "network approach". The first problem involves modeling social networks, which can be used for such simulations, and we will discuss results on a random graph model by Chung and Lu, and variants of it which can be generated in almost linear time. The second problem involves policy planning in social networks. We will describe combinatorial formulations and approximation algorithms for quarantining, vaccination and sensor placement problems, as aids to decision-making.
Seminar web page: http://dimacs.rutgers.edu/SpecialYears/2002_Epid/seminars05-06.html