Efficient Scalable Contact Network Generation from Population Data

Ritwick Mishra, Sudip Seal

Research output: Book/ReportCommissioned report

Abstract

Modeling the contacts among a population is critical to understanding the dynamics of a disease outbreak. Contact networks, where nodes are individuals and edges are contacts among them, are used to represent these complex individual-level interactions. In this work, we are given the daily activity schedules of an urban population that represent the activity location and time of individuals in a population during a single twenty four hour period over multiple days. Using collocation to determine contact between individuals, our goal is to extract hourly contact networks from large-scale activity data. We improve upon the existing adjacency matrix-based method by implementing our custom sparse matrix multiplication algorithm. Starting with a Python implementation, we achieve a 1600x speed up in the computation with a fast custom designed sparse matrix multiplier algorithm implemented in the C++ language. This work is central to future parallel designs of the problem.
Original languageEnglish
Place of PublicationUnited States
DOIs
StatePublished - Sep 2024

Fingerprint

Dive into the research topics of 'Efficient Scalable Contact Network Generation from Population Data'. Together they form a unique fingerprint.

Cite this