Virus Propagation in Social Networks

General Description: This project is a C implementation for simulating the propagation of a virus in social networks.

Input: a one-dimensional or two-dimensional lattice augmented with long range contacts that models a social network.

Implementation period: January - July 2009

virus

Technical details:
This package is an efficient simulator written in C. It simulates a disease propagates in social networks by employing the bond percolation theory. It takes the number of nodes, the number of short-range contact for each node in the lattice as well as the probability of infection [1]. At the end, it produces the probability distribution of the resulting components. This distribution shows how far a disease can spread in a social network.

Refs:
[1] J. Kleinberg. The small-world phenomenon: An algorithmic perspective. Proc. 32nd ACM Symposium on Theory of Computing, 2000.