Node immunization on large graphs: Theory and algorithms
Given a large graph, like a computer communication network, which k nodes should we
immunize (or monitor, or remove), to make it as robust as possible against a computer virus …
immunize (or monitor, or remove), to make it as robust as possible against a computer virus …
Approximation algorithms for reducing the spectral radius to control epidemic spread
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 …
radius) is an important metric in its own right. Further, for several models of epidemic spread …
Friend recommendation with content spread enhancement in social networks
Social network is becoming an increasingly popular media for information sharing. More and
more people are interacting with others via major social network sites such as Twitter and …
more people are interacting with others via major social network sites such as Twitter and …
[HTML][HTML] Forecasting social unrest using activity cascades
Social unrest is endemic in many societies, and recent news has drawn attention to
happenings in Latin America, the Middle East, and Eastern Europe. Civilian populations …
happenings in Latin America, the Middle East, and Eastern Europe. Civilian populations …
Data-aware vaccine allocation over large networks
Y Zhang, BA Prakash - ACM Transactions on Knowledge Discovery from …, 2015 - dl.acm.org
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 …
meme or virus) has been spreading for some time, how to select the k best nodes for …
Selecting shortcuts for a smaller world
The small world phenomenon is a desirable property of social networks, since it guarantees
short paths between the nodes of the social graph and thus efficient information spread on …
short paths between the nodes of the social graph and thus efficient information spread on …
Refining social graph connectivity via shortcut edge addition
M Papagelis - ACM Transactions on Knowledge Discovery from Data …, 2015 - dl.acm.org
Small changes on the structure of a graph can have a dramatic effect on its connectivity.
While in the traditional graph theory, the focus is on well-defined properties of graph …
While in the traditional graph theory, the focus is on well-defined properties of graph …
[HTML][HTML] Developing multi-target therapeutics to fine-tune the evolutionary dynamics of the cancer ecosystem
Multi-target therapies, either in combination or in sequential order, have been advocated to
combat intrinsic and acquired resistance to anti-cancer drugs (Holohan et al., 2013; Yardley …
combat intrinsic and acquired resistance to anti-cancer drugs (Holohan et al., 2013; Yardley …
Fast eigen-functions tracking on dynamic graphs
Many important graph parameters can be expressed as eigen-functions of its adjacency
matrix. Examples include epidemic threshold, graph robustness, etc. It is often of key …
matrix. Examples include epidemic threshold, graph robustness, etc. It is often of key …
Controlling propagation at group scale on networks
Given a network with groups, such as a contact-network grouped by ages, which are the
best groups to immunize to control the epidemic? Equivalently, how to best choose …
best groups to immunize to control the epidemic? Equivalently, how to best choose …