University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Dynamic monopolies and degenerate sets

## Dynamic monopolies and degenerate setsAdd to your list(s) Download to your calendar using vCal - Stefan Ehard, University of Ulm
- Thursday 22 November 2018, 15:00-16:00
- Watson LTB.
If you have a question about this talk, please contact Felix Joos. Dynamic monopolies are a widely studied model for influence diffusion in social networks. For a graph $G$ and an integer-valued threshold function $\tau$ on its vertex set, a dynamic monopoly is a set of vertices of $G$ such that iteratively adding to it vertices $u$ of $G$ that have at least $\tau(u)$ neighbours in it eventually yields the entire vertex set of $G$. I present recent bounds, algorithms, and hardness results for minimum dynamic monopolies and its dual problem of maximum degenerate sets. Some parts are joint work with S. Bessy, C. Brause, L.D. Penso, and D. Rautenbach. This talk is part of the Combinatorics and Probability Seminar series. ## This talk is included in these lists:Note that ex-directory lists are not shown. |
## Other listsArtificial Intelligence and Natural Computation seminars BritGrav 15 Theoretical computer science seminar## Other talksMSBC Seminar MSBC Seminar MC Seminar To Be Confirmed TBC TBC Origins of Life Systems Chemistry |