HPCgen A Fast Generator of Contact Networks of Large Urban Cities for Epidemiological Studies

A contact network is the well representation of heterogeneous contact behaviors within the population. Incorporating contact networks as well as community structures is important in realistic modeling and simulation for the spread of infectious diseases. We developed the “HPCgen”, a fast and generic generator of contact networks of large urban cities, with the capacity of automating network re-generations for intervention studies. The produced contact networks are applicable in both analytical modeling and agent-based simulations. In this paper, we presented the design and realization of HPCgen followed by the empirical results of building Singapore contact networks with six types of community structures in the common urban settings. The results showed our 8-node parallelized HPCgen could generated a contact network of 3.4 million populations within 62.17 seconds, which is 90% reduction of runtime.

[1]  Alexei Vazquez,et al.  Spreading dynamics on heterogeneous populations: multitype network approach. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[3]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[4]  M. Newman.  Spread of epidemic disease on networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[6]  Eli Upfal,et al.  Stochastic models for the Web graph , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[7]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

[8]  Youcef Saad,et al.  A Basic Tool Kit for Sparse Matrix Computations , 1990 .

[9]  Cláudia T. Codeço,et al.  Epigrass: a tool to study disease spread in complex networks. , 2007, Source Code for Biology and Medicine.

[10]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[11]  R. May,et al.  Infectious Diseases of Humans: Dynamics and Control , 1991, Annals of Internal Medicine.

[12]  Alan M. Frieze,et al.  A general model of web graphs , 2003, Random Struct. Algorithms.

[13]  Peter S. Pacheco.  Parallel programming with MPI , 1996 .

[14]  M. Newman,et al.  Network theory and SARS: predicting outbreak diversity , 2004, Journal of Theoretical Biology.

[15]  F. Chung,et al.  Connected Components in Random Graphs with Given Expected Degree Sequences , 2002 .

[16]  Y. Moreno,et al.  Epidemic outbreaks in complex heterogeneous networks , 2001, cond-mat/0107267.

[17]  Aravind Srinivasan,et al.  Structural and algorithmic aspects of massive social networks , 2004, SODA '04.

[18]  Mancia Anguita,et al.  SCE Toolboxes for the Development of High-Level Parallel Applications , 2006, International Conference on Computational Science.

[19]  P. Kaye.  Infectious diseases of humans: Dynamics and control , 1993 .

[20]  O. Diekmann.  Mathematical Epidemiology of Infectious Diseases , 1996 .

[21]  M. Kuperman,et al.  Social games in a social network. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  Brendan D. McKay,et al.  The Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges , 1990, Random Struct. Algorithms.

[23]  F. Brauer,et al.  Mathematical Models in Population Biology and Epidemiology , 2001 .

[24]  G. Amdhal,et al.  Validity of the single processor approach to achieving large scale computing capabilities , 1967, AFIPS '67 (Spring).

[25]  I. M. Sokolov,et al.  Firewalls, Disorder, and Percolation in Epidemics , 2001, cond-mat/0106450.

[26]  Jon M. Kleinberg,et al.  The Web as a Graph: Measurements, Models, and Methods , 1999, COCOON.