A density description of a bounded-confidence model of opinion dynamics on hypergraphs

Abstract

Social interactions often occur between three or more agents simultaneously. Examining opinion dynamics on hypergraphs allows one to study the effect of such polyadic interactions on the opinions of agents. In this paper, we consider a bounded-confidence model (BCM), in which opinions take continuous values and interacting agents comprise their opinions if they are close enough to each other. We study a density description of a Deffuant--Weisbuch BCM on hypergraphs. We derive a rate equation for the mean-field opinion density as the number of agents becomes infinite, and we prove that this rate equation yields a probability density that converges to noninteracting opinion clusters. Using numerical simulations, we examine bifurcations of the density-based BCM's steady-state opinion clusters and demonstrate that the agent-based BCM converges to the density description of the BCM as the number of agents becomes infinite.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…