activity
20122016
most citedA lower bound on the performance of dynamic curing policies for epidemics on graphs

8 citations · 17 across the 4 of their papers we have counts for

collaborators

5 papers

cs.CV2016

Theoretical Analysis of Active Contours on Graphs

Christos Sakaridis, Kimon Drakopoulos, Petros Maragos

Active contour models based on partial differential equations have proved successful in image segmentation, yet the study of their geometric formulation on arbitrary geometric grap…

cs.SI2015★ 8 cited

A lower bound on the performance of dynamic curing policies for epidemics on graphs

Kimon Drakopoulos, Asuman Ozdaglar, John N. Tsitsiklis

We consider an SIS-type epidemic process that evolves on a known graph. We assume that a fixed curing budget can be allocated at each instant to the nodes of the graph, towards the…

cs.SI2015★ 5 cited

When is a network epidemic hard to eliminate?

Kimon Drakopoulos, Asuman Ozdaglar, John N. Tsitsiklis

We consider the propagation of a contagion process (epidemic) on a network and study the problem of dynamically allocating a fixed curing budget to the nodes of the graph, at each…

cs.SI2014★ 3 cited

An efficient curing policy for epidemics on graphs

Kimon Drakopoulos, Asuman Ozdaglar, John N. Tsitsiklis

We provide a dynamic policy for the rapid containment of a contagion process modeled as an SIS epidemic on a bounded degree undirected graph with n nodes. We show that if the budge…

cs.GT2012★ 1 cited

On Learning with Finite Memory

Kimon Drakopoulos, Asuman Ozdaglar, John Tsitsiklis

We consider an infinite collection of agents who make decisions, sequentially, about an unknown underlying binary state of the world. Each agent, prior to making a decision, receiv…