Aarhus University Seal / Aarhus Universitets segl
CS frontpage Debate Lecture / talk Alumni Future students Staff Students

CS Colloquium - Panagiotis Karras: Robustness in Probabilistic Networks

Info about event


Friday 31 January 2020,  at 14:15 - 15:00


Building 5335-016 (Peter Bøgh Andersen Auditoriet)


How can we assess a network's ability to maintain its functionality under attacks? While network robustness has been studied extensively in the deterministic case, applications in information diffusion and the behavior of networked public raise a question of robustness in probabilistic networks. In this talk, we will discuss three novel robustness measures for networks hosting a diffusion process susceptible to node attacks. The outcome of such a process depends on the selection of its initiators, or seeds, by a seeder, and on two factors outside the seeder's discretion: the attack strategy and probabilistic outcomes.

  Each of our measures corresponds to a level of seeder awareness regarding these factors and evaluates the network's viability over all possible extents of attack. We introduce novel algorithms to evaluate these measures. An experimental study with synthetic and real, scale-free and homogeneous networks shows that these algorithms are effective and efficient, while the proposed measures highlight differences among networks in terms of the surprise they furnish when attacked. These results inform the design of robust probabilistic networks.