Adversarial Perturbations of Opinion Dynamics in Networks

In this paper, we study the connections between network structure, opinion dynamics, and an adversary's power to artificially induce disagreements. We approach these questions by extending models of opinion formation in the mathematical social sciences to represent scenarios, familiar from recent events, in which external actors have sought to destabilize communities through sophisticated information warfare tactics via fake news and bots. In many instances, the intrinsic goals of these efforts are not necessarily to shift the overall sentiment of the network towards a particular policy, but rather to induce discord. These perturbations will diffuse via opinion dynamics on the underlying network, through mechanisms that have been analyzed and abstracted through work in computer science and the social sciences. Here we investigate the properties of such attacks, considering optimal strategies both for the adversary seeking to create disagreement and for the entities tasked with defending the network from attack. By employing spectral techniques, we show that for different formulations of these types of objectives, different regimes of the spectral structure of the network will limit the adversary's capacity to sow discord; in fact, somewhat surprisingly, the entire spectrum can be relevant, rather than just the extreme eigenvectors. Via the strong connections between spectral and structural properties of graphs, we are able to qualitatively describe which networks are most vulnerable or resilient against these perturbations. We then consider the algorithmic task of a network defender to mitigate these sorts of adversarial attacks by insulating nodes heterogeneously; we show that, by considering the geometry of this problem, this optimization task can be efficiently solved via convex programming. Finally, we generalize these results to allow for two network structures, where the opinion dynamics process and the measurement of disagreement become uncoupled; for instance, this may arise when opinion dynamics are controlled by an online community via social media, while disagreement is measured along "real-world" connections. We characterize conditions on the relationship between these two graphs that will determine how much power the adversary gains when this occurs.

[1]  Shang-Hua Teng,et al.  Spectral Sparsification of Graphs , 2008, SIAM J. Comput..

[2]  Matthew O. Jackson,et al.  Naïve Learning in Social Networks and the Wisdom of Crowds , 2010 .

[3]  Luca Trevisan,et al.  Max cut and the smallest eigenvalue , 2008, STOC '09.

[4]  D. Welsh,et al.  A Spectral Technique for Coloring Random 3-Colorable Graphs , 1994 .

[5]  Noah E. Friedkin,et al.  Social influence and opinions , 1990 .

[6]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[7]  Jon M. Kleinberg,et al.  How Bad is Forming Your Own Opinion? , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[8]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[9]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[10]  Miklós Z. Rácz,et al.  Network disruption: maximizing disagreement and polarization in social networks , 2020, ArXiv.

[11]  Herbert S. Lin,et al.  Technology, Policy, Law, and Ethics Regarding U.S. Acquisition and Use of Cyberattack Capabilities , 2009 .

[12]  Sanjeev Goyal,et al.  Targeting Interventions in Networks , 2017, Econometrica.

[13]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[14]  David A. Broniatowski,et al.  Weaponized Health Communication: Twitter Bots and Russian Trolls Amplify the Vaccine Debate , 2018, American journal of public health.

[15]  M. Degroot Reaching a Consensus , 1974 .

[16]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[17]  Nathan Linial,et al.  Lifts, Discrepancy and Nearly Optimal Spectral Gap* , 2006, Comb..

[18]  Guy Kindler,et al.  Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[19]  Nikhil Srivastava,et al.  Twice-ramanujan sparsifiers , 2008, STOC '09.

[20]  Aristides Gionis,et al.  Opinion Maximization in Social Networks , 2013, SDM.

[21]  Charles Delorme,et al.  Laplacian eigenvalues and the maximum cut problem , 1993, Math. Program..

[22]  Charalampos E. Tsourakakis,et al.  Minimizing Polarization and Disagreement in Social Networks , 2017, WWW.

[23]  Christopher Musco,et al.  Analyzing the Impact of Filter Bubbles on Social Network Polarization , 2020, WSDM.

[24]  Ben Johnson,et al.  The tactics & tropes of the Internet Research Agency , 2018 .

[25]  Noga Alon,et al.  Approximating the cut-norm via Grothendieck's inequality , 2004, STOC '04.