Maximizing Influence Propagation in Networks with Community Structure

dc.creatorGalstyan, Aram
dc.creatorMusoyan, Vahe
dc.creatorCohen, Paul
dc.date2009-05-07
dc.date.accessioned2026-07-07T13:12:44Z
dc.date.available2026-07-07T13:12:44Z
dc.descriptionWe consider the algorithmic problem of selecting a set of target nodes that cause the biggest activation cascade in a network. In case when the activation process obeys the diminishing returns property, a simple hill-climbing selection mechanism has been shown to achieve a provably good performance. Here we study models of influence propagation that exhibit critical behavior, and where the property of diminishing returns does not hold. We demonstrate that in such systems, the structural properties of networks can play a significant role. We focus on networks with two loosely coupled communities, and show that the double-critical behavior of activation spreading in such systems has significant implications for the targeting strategies. In particular, we show that simple strategies that work well for homogeneous networks can be overly sub-optimal, and suggest simple modification for improving the performance, by taking into account the community structure.
dc.description7 pages, 8 figures
dc.identifierhttps://arxiv.org/abs/0905.1108
dc.identifierhttp://arxiv.org/abs/0905.1108
dc.identifierPhys. Rev. E 79, 056102 (2009)
dc.identifierdoi:10.1103/PhysRevE.79.056102
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/229666
dc.subjectPhysics and Society
dc.subjectStatistical Mechanics
dc.subjectComputers and Society
dc.titleMaximizing Influence Propagation in Networks with Community Structure
dc.typetext

Files

Collections