Year: 2025
Type: article
Abstract: . Influence propagation in social networks is a central problem in modern social network analysis, with important societal applications in politics and advertising. A large body of work has focused on cascading models, viral marketing, and finite-horizon diffusion. There is, however, a need for more developed, mathematically principled adversarial models, in which multiple, opposed actors strategically select nodes whose influence will maximally sway the crowd to their point of view. In the present work, we develop and analyze such a model based on harmonic functions and linear diffusion. Our general problem is known to be NP-hard and that the objective function is monotone and submodular; consequently, we can greedily approximate the solution within a constant factor. Introducing and analyzing a convex relaxation, we show that the problem can be approximately solved using smooth optimization methods. We illustrate the effectiveness of our approach on a variety of example networks.
DOI: 10.1137/24m1697013
Language: English
Subfield: Statistical and Nonlinear Physics
Field: Physics and Astronomy
Domain: Physical Sciences
Open Access status: green
Awards: LEAPS-MPS: Structure and Dynamics of Global Supply Chain Networks, FRG: Collaborative Research: Mathematical and Statistical Analysis of Compressible Data on Compressive Networks, RTG: Networks: Foundations in Probability, Optimization, and Data Sciences, RTG: Optimization and Inversion for the 21st Century Workforce, G5545775909, CAREER: Variational and Geometric Methods for Data Analysis, G618468917, G7452299184, Collaborative Research: HNDS-I: IDEANet: Integrating Data Exchange and Analysis of Networks, Spectral Theory and Applications for Models with Localized or Boundary Defects
OpenAlex ID: W4414393739
