Controlling the dissemination of an entity (eg, meme, virus, etc) on a large graph is an
interesting problem in many disciplines. Examples include epidemiology, computer security …

How can we optimize the topology of a networked system to bring a flu under control, propel
a video to popularity, or stifle a network malware in its infancy? Previous work on information …

Given a snapshot of a large graph, in which an infection has been spreading for some time,
can we identify those nodes from which the infection started to spread? In other words, can …

Information diffusion and virus propagation are fundamental processes taking place in
networks. While it is often possible to directly observe when nodes become infected with a …

Given a snapshot of a large graph, in which an infection has been spreading for some time,
can we identify those nodes from which the infection started to spread? In other words, can …

Given a graph, like a social/computer network or the blogosphere, in which an infection (or
meme or virus) has been spreading for some time, how to select the k best nodes for …

With their blistering expansions in recent years, popular on-line social sites such as Twitter,
Facebook and Bebo, have become some of the major news sources as well as the most …

We address the problem of minimizing the propagation of undesirable things, such as
computer viruses or malicious rumors, by blocking a limited number of links in a network, a …

With their blistering expansion in recent years, popular online social sites such as Twitter,
Facebook and Bebo, have become not only one of the most effective channels for viral …

The largest eigenvalue of the adjacency matrix of a network (referred to as the spectral
radius) is an important metric in its own right. Further, for several models of epidemic spread …