Linear Opinion Dynamics Model with Higher-Order Interactions

• URL: http://arxiv.org/abs/2310.05689v1
• Date: Mon, 9 Oct 2023 12:56:11 GMT
• Title: Linear Opinion Dynamics Model with Higher-Order Interactions
• Authors: Wanyue Xu and Zhongzhi Zhang
• Abstract summary: 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.
• Score: 17.413930396663833
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Opinion dynamics is a central subject of computational social science, and various models have been developed to understand the evolution and formulation of opinions. Existing models mainly focus on opinion dynamics on graphs that only capture pairwise interactions between agents. In this paper, we extend the popular Friedkin-Johnsen model for opinion dynamics on graphs to hypergraphs, which describe higher-order interactions occurring frequently on real networks, especially social networks. To achieve this, based on the fact that for linear dynamics the multi-way interactions can be reduced to effective pairwise node interactions, we propose a method to decode the group interactions encoded in hyperedges by undirected edges or directed edges in graphs. We then show that higher-order interactions play an important role in the opinion dynamics, since the overall steady-state expressed opinion and polarization differ greatly from those without group interactions. We also provide an interpretation of the equilibrium expressed opinion from the perspective of the spanning converging forest, based on which we design a fast sampling algorithm to approximately evaluate the overall opinion and opinion polarization on directed weighted graphs. Finally, we conduct experiments on real-world hypergraph datasets, demonstrating the performance of our algorithm.

Related papers

• GraphGI:A GNN Explanation Method using Game Interaction [5.149896909638598]
  Graph Neural Networks (GNNs) have garnered significant attention and have been extensively utilized across various domains. Current graph explanation techniques focus on identifying key nodes or edges, attributing the critical data features that drive model predictions. We propose a novel explanatory method GraphGI, which identifies the coalition with the highest interaction strength and presents it as an explanatory subgraph.
  arXiv  Detail & Related papers  (2024-09-24T03:24:31Z)
• Balanced Multi-Relational Graph Clustering [5.531383184058319]
  Multi-relational graph clustering has demonstrated remarkable success in uncovering underlying patterns in complex networks. Our empirical study finds the pervasive presence of imbalance in real-world graphs, which is in principle contradictory to the motivation of alignment. We propose Balanced Multi-Relational Graph Clustering (BMGC), comprising unsupervised dominant view mining and dual signals guided representation learning.
  arXiv  Detail & Related papers  (2024-07-23T22:11:13Z)
• Multi-Agent Dynamic Relational Reasoning for Social Robot Navigation [55.65482030032804]
  Social robot navigation can be helpful in various contexts of daily life but requires safe human-robot interactions and efficient trajectory planning. We propose a systematic relational reasoning approach with explicit inference of the underlying dynamically evolving relational structures. Our approach infers dynamically evolving relation graphs and hypergraphs to capture the evolution of relations, which the trajectory predictor employs to generate future states.
  arXiv  Detail & Related papers  (2024-01-22T18:58:22Z)
• Beyond spectral gap (extended): The role of the topology in decentralized learning [58.48291921602417]
  In data-parallel optimization of machine learning models, workers collaborate to improve their estimates of the model. Current theory does not explain that collaboration enables larger learning rates than training alone. This paper aims to paint an accurate picture of sparsely-connected distributed optimization.
  arXiv  Detail & Related papers  (2023-01-05T16:53:38Z)
• Causally-guided Regularization of Graph Attention Improves Generalizability [69.09877209676266]
  We introduce CAR, a general-purpose regularization framework for graph attention networks. Methodname aligns the attention mechanism with the causal effects of active interventions on graph connectivity. For social media network-sized graphs, a CAR-guided graph rewiring approach could allow us to combine the scalability of graph convolutional methods with the higher performance of graph attention.
  arXiv  Detail & Related papers  (2022-10-20T01:29:10Z)
• EvolveHypergraph: Group-Aware Dynamic Relational Reasoning for Trajectory Prediction [39.66755326557846]
  We propose a group-aware relational reasoning approach (namedHypergraph) with explicit inference of the underlying dynamically evolving relational structures. Our approach infers explainable, reasonable group-aware relations and achieves state-of-the-art performance in long-term prediction.
  arXiv  Detail & Related papers  (2022-08-10T17:57:10Z)
• 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)
• 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)
• Hyperbolic Graph Embedding with Enhanced Semi-Implicit Variational Inference [48.63194907060615]
  We build off of semi-implicit graph variational auto-encoders to capture higher-order statistics in a low-dimensional graph latent representation. We incorporate hyperbolic geometry in the latent space through a Poincare embedding to efficiently represent graphs exhibiting hierarchical structure.
  arXiv  Detail & Related papers  (2020-10-31T05:48:34Z)
• Towards Deeper Graph Neural Networks [63.46470695525957]
  Graph convolutions perform neighborhood aggregation and represent one of the most important graph operations. Several recent studies attribute this performance deterioration to the over-smoothing issue. We propose Deep Adaptive Graph Neural Network (DAGNN) to adaptively incorporate information from large receptive fields.
  arXiv  Detail & Related papers  (2020-07-18T01:11:14Z)
• EvolveGraph: Multi-Agent Trajectory Prediction with Dynamic Relational Reasoning [41.42230144157259]
  We propose a generic trajectory forecasting framework with explicit relational structure recognition and prediction via latent interaction graphs. Considering the uncertainty of future behaviors, the model is designed to provide multi-modal prediction hypotheses. We introduce a double-stage training pipeline which not only improves training efficiency and accelerates convergence, but also enhances model performance.
  arXiv  Detail & Related papers  (2020-03-31T02:49: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.