Local Edge Dynamics and Opinion Polarization

• URL: http://arxiv.org/abs/2111.14020v2
• Date: Thu, 8 Dec 2022 22:52:05 GMT
• Title: Local Edge Dynamics and Opinion Polarization
• Authors: Nikita Bhalla, Adam Lechowicz, Cameron Musco
• Abstract summary: We study how local edge dynamics can drive opinion polarization. We introduce a variant of the classic Friedkin-Johnsen opinion dynamics, augmented with a simple time-evolving network model. We show that our model is tractable to theoretical analysis, which helps explain how these local dynamics erode connectivity across opinion groups.
• Score: 17.613690272861053
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The proliferation of social media platforms, recommender systems, and their joint societal impacts have prompted significant interest in opinion formation and evolution within social networks. We study how local edge dynamics can drive opinion polarization. In particular, we introduce a variant of the classic Friedkin-Johnsen opinion dynamics, augmented with a simple time-evolving network model. Edges are iteratively added or deleted according to simple rules, modeling decisions based on individual preferences and network recommendations. Via simulations on synthetic and real-world graphs, we find that the combined presence of two dynamics gives rise to high polarization: 1) confirmation bias -- i.e., the preference for nodes to connect to other nodes with similar expressed opinions and 2) friend-of-friend link recommendations, which encourage new connections between closely connected nodes. We show that our model is tractable to theoretical analysis, which helps explain how these local dynamics erode connectivity across opinion groups, affecting polarization and a related measure of disagreement across edges. Finally, we validate our model against real-world data, showing that our edge dynamics drive the structure of arbitrary graphs, including random graphs, to more closely resemble real social networks.

Related papers

• Linear Opinion Dynamics Model with Higher-Order Interactions [17.413930396663833]
  We extend the popular Friedkin-Johnsen model for opinion dynamics on graphs to hypergraphs. We show that higher-order interactions play an important role in the opinion dynamics.
  arXiv  Detail & Related papers  (2023-10-09T12:56:11Z)
• A Unified View on Neural Message Passing with Opinion Dynamics for Social Networks [4.0201694410781235]
  This research harmonizes concepts from sociometry and neural message passing to analyze and infer the behavior of dynamic systems. We propose ODNet, a novel message passing scheme incorporating bounded confidence, to refine the influence weight of local nodes for message propagation. We show that ODNet enhances prediction performance across various graph types and alleviates oversmoothing issues.
  arXiv  Detail & Related papers  (2023-10-02T15:18:19Z)
• Delayed and Indirect Impacts of Link Recommendations [23.583662580148133]
  We study the impacts of recommendations on social networks in dynamic settings. We find that link recommendations have surprising delayed and indirect effects on the structural properties of networks. We show that, in counterfactual simulations, removing the indirect effects of link recommendations can make the network trend faster toward what it would have been under natural growth dynamics.
  arXiv  Detail & Related papers  (2023-03-17T00:09:19Z)
• Graph Transformer GANs for Graph-Constrained House Generation [223.739067413952]
  We present a novel graph Transformer generative adversarial network (GTGAN) to learn effective graph node relations. The GTGAN learns effective graph node relations in an end-to-end fashion for the challenging graph-constrained house generation task.
  arXiv  Detail & Related papers  (2023-03-14T20:35:45Z)
• Self-supervised Graph-based Point-of-interest Recommendation [66.58064122520747]
  Next Point-of-Interest (POI) recommendation has become a prominent component in location-based e-commerce. We propose a Self-supervised Graph-enhanced POI Recommender (S2GRec) for next POI recommendation. In particular, we devise a novel Graph-enhanced Self-attentive layer to incorporate the collaborative signals from both global transition graph and local trajectory graphs.
  arXiv  Detail & Related papers  (2022-10-22T17:29:34Z)
• Network polarization, filter bubbles, and echo chambers: An annotated review of measures and reduction methods [0.0]
  Polarization arises when the underlying network becomes characterized by highly connected groups with weak inter-group connectivity. This work presents an annotated review of network polarization measures and models used to handle the polarization.
  arXiv  Detail & Related papers  (2022-07-27T21:23:27Z)
• The drivers of online polarization: fitting models to data [0.0]
  echo chamber effect and opinion polarization may be driven by several factors including human biases in information consumption and personalized recommendations produced by feed algorithms. Until now, studies have mainly used opinion dynamic models to explore the mechanisms behind the emergence of polarization and echo chambers. We provide a method to numerically compare the opinion distributions obtained from simulations with those measured on social media.
  arXiv  Detail & Related papers  (2022-05-31T17:00:41Z)
• Handling Distribution Shifts on Graphs: An Invariance Perspective [78.31180235269035]
  We formulate the OOD problem on graphs and develop a new invariant learning approach, Explore-to-Extrapolate Risk Minimization (EERM) EERM resorts to multiple context explorers that are adversarially trained to maximize the variance of risks from multiple virtual environments. We prove the validity of our method by theoretically showing its guarantee of a valid OOD solution.
  arXiv  Detail & Related papers  (2022-02-05T02:31:01Z)
• TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learning [87.38675639186405]
  We propose a novel graph neural network approach, called TCL, which deals with the dynamically-evolving graph in a continuous-time fashion. To the best of our knowledge, this is the first attempt to apply contrastive learning to representation learning on dynamic graphs.
  arXiv  Detail & Related papers  (2021-05-17T15:33:25Z)
• Interpretable Signed Link Prediction with Signed Infomax Hyperbolic Graph [54.03786611989613]
  signed link prediction in social networks aims to reveal the underlying relationships (i.e. links) among users (i.e. nodes) We develop a unified framework, termed as Signed Infomax Hyperbolic Graph (textbfSIHG) In order to model high-order user relations and complex hierarchies, the node embeddings are projected and measured in a hyperbolic space with a lower distortion.
  arXiv  Detail & Related papers  (2020-11-25T05:09:03Z)
• Optimizing Mode Connectivity via Neuron Alignment [84.26606622400423]
  Empirically, the local minima of loss functions can be connected by a learned curve in model space along which the loss remains nearly constant. We propose a more general framework to investigate effect of symmetry on landscape connectivity by accounting for the weight permutations of networks being connected.
  arXiv  Detail & Related papers  (2020-09-05T02:25:23Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.