Characterizing Polarization in Social Networks using the Signed Relational Latent Distance Model

• URL: http://arxiv.org/abs/2301.09507v1
• Date: Mon, 23 Jan 2023 16:01:26 GMT
• Title: Characterizing Polarization in Social Networks using the Signed Relational Latent Distance Model
• Authors: Nikolaos Nakis and Abdulkadir \c{C}elikkanat and Louis Boucherie and Christian Djurhuus and Felix Burmester and Daniel Mathias Holmelund and Monika Frolcov\'a and Morten M{\o}rup
• Abstract summary: A major current concern in social networks is the emergence of polarization and filter bubbles promoting a mindset of "us-versus-them" We propose the latent Signed relational Latent dIstance Model (SLIM) utilizing for the first time the Skellam distribution as a likelihood function for signed networks. We demonstrate that the model extracts low-dimensional characterizations that well predict friendships and animosity while providing interpretable visualizations defined by extreme positions.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Graph representation learning has become a prominent tool for the characterization and understanding of the structure of networks in general and social networks in particular. Typically, these representation learning approaches embed the networks into a low-dimensional space in which the role of each individual can be characterized in terms of their latent position. A major current concern in social networks is the emergence of polarization and filter bubbles promoting a mindset of "us-versus-them" that may be defined by extreme positions believed to ultimately lead to political violence and the erosion of democracy. Such polarized networks are typically characterized in terms of signed links reflecting likes and dislikes. We propose the latent Signed relational Latent dIstance Model (SLIM) utilizing for the first time the Skellam distribution as a likelihood function for signed networks and extend the modeling to the characterization of distinct extreme positions by constraining the embedding space to polytopes. On four real social signed networks of polarization, we demonstrate that the model extracts low-dimensional characterizations that well predict friendships and animosity while providing interpretable visualizations defined by extreme positions when endowing the model with an embedding space restricted to polytopes.

Related papers

• Signed Graph Autoencoder for Explainable and Polarization-Aware Network Embeddings [20.77134976354226]
  Signed Graph Archetypal Autoencoder (SGAAE) framework designed for signed networks. SGAAE extracts node-level representations that express node memberships over distinct extreme profiles. Model achieves high performance in different tasks of signed link prediction across four real-world datasets.
  arXiv  Detail & Related papers  (2024-09-16T16:40:40Z)
• Leveraging Low-Rank and Sparse Recurrent Connectivity for Robust Closed-Loop Control [63.310780486820796]
  We show how a parameterization of recurrent connectivity influences robustness in closed-loop settings. We find that closed-form continuous-time neural networks (CfCs) with fewer parameters can outperform their full-rank, fully-connected counterparts.
  arXiv  Detail & Related papers  (2023-10-05T21:44:18Z)
• A Hybrid Membership Latent Distance Model for Unsigned and Signed Integer Weighted Networks [0.17265013728931003]
  Graph representation learning (GRL) has become a prominent tool for furthering the understanding of complex networks. We propose the Hybrid Membership-Latent Distance Model (HM-LDM) by exploring how a Latent Distance Model (LDM) can be constrained to a latent simplex.
  arXiv  Detail & Related papers  (2023-08-29T13:30:48Z)
• Hierarchical Neural Implicit Pose Network for Animation and Motion Retargeting [66.69067601079706]
  HIPNet is a neural implicit pose network trained on multiple subjects across many poses. We employ a hierarchical skeleton-based representation to learn a signed distance function on a canonical unposed space. We achieve state-of-the-art results on various single-subject and multi-subject benchmarks.
  arXiv  Detail & Related papers  (2021-12-02T03:25:46Z)
• Local Edge Dynamics and Opinion Polarization [17.613690272861053]
  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.
  arXiv  Detail & Related papers  (2021-11-28T01:59:57Z)
• 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)
• Polarization Model of Online Social Networks Based on the Concept of Spontaneous Symmetry Breaking [3.084629788740097]
  It is necessary to understand the mechanism of polarization to establish technologies that can counter polarization. This paper introduces a fundamental model for understanding polarization that is based on the concept of spontaneous symmetry breaking.
  arXiv  Detail & Related papers  (2020-11-10T21:03:11Z)
• Discriminability of Single-Layer Graph Neural Networks [172.5042368548269]
  Graph neural networks (GNNs) have exhibited promising performance on a wide range of problems. We focus on the property of discriminability and establish conditions under which the inclusion of pointwise nonlinearities to a stable graph filter bank leads to an increased discriminative capacity for high-eigenvalue content.
  arXiv  Detail & Related papers  (2020-10-17T18:52:34Z)
• A Multi-Semantic Metapath Model for Large Scale Heterogeneous Network Representation Learning [52.83948119677194]
  We propose a multi-semantic metapath (MSM) model for large scale heterogeneous representation learning. Specifically, we generate multi-semantic metapath-based random walks to construct the heterogeneous neighborhood to handle the unbalanced distributions. We conduct systematical evaluations for the proposed framework on two challenging datasets: Amazon and Alibaba.
  arXiv  Detail & Related papers  (2020-07-19T22:50:20Z)
• CSNE: Conditional Signed Network Embedding [77.54225346953069]
  Signed networks encode positive and negative relations between entities such as friend/foe or trust/distrust. Existing embedding methods for sign prediction generally enforce different notions of status or balance theories in their optimization function. We introduce conditional signed network embedding (CSNE) Our probabilistic approach models structural information about the signs in the network separately from fine-grained detail.
  arXiv  Detail & Related papers  (2020-05-19T19:14:52Z)

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.