Design improvements for message propagation in malleable social networks

• Autores: Ram Gopal, Hooman Hidaji, Raymond A. Patterson, Erik Rolland, Dmitry Zhdanov
• Localización: Production and Operations Management, ISSN-e 1937-5956, Vol. 25, Nº. 6, 2016, págs. 993-1005
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • This study presents the formal problem definition and computational analysis of the network design improvements for idea and message propagation in both enterprise and consumer social networks (ESN and CSN, respectively). Message propagation in social networks is impacted by how messages are seeded in the network, and by propagation characteristics of the network topology itself. It has been recognized that the propagation properties of these networks can be actively influenced by network design interventions, such as the deliberate creation of new connections. We address the problem of finding cost-effective message seeding, and identifying potential new network connections that allow improved propagation in social networks with cascade propagation. We use the hop-constrained minimum spanning tree (HMST) model to find the seeds and possible new connections that result in networks with improved propagation properties. Moreover, we present new heuristic algorithms that substantially improve the solution quality for the HMST problem. Computational results posit that the design improvements proposed by the HMST approach can greatly improve cascade propagation performance of the networks at low cost.