SearcharxivSearch

arXiv · 2406.19204

CoDiNG -- Naming Game with Continuous Latent Opinions of Individual Agents

Abstract

Understanding the mechanisms behind opinion formation is crucial for gaining insight into the processes that shape the spread of political beliefs, cultural attitudes, consumer choices, and social movements in society. This work introduces a realistic model of opinion dynamics that captures the intricacies of real-world opinion dynamics by synthesizing principles from cognitive science. The proposed model is a hybrid continuous-discrete extension of the well-known Naming Game opinion model. The continuous layer captures the strength of each opinion through reinforcement and forgetting in the human brain, akin to memory imprints. The discrete layer allows for converting intrinsic continuous opinion into a discrete form, which often occurs when we publicly verbalize our opinions. We evaluated our model on longitudinal data combining real communication events with repeated surveys of the same individuals, comparing it against the Naming Game, the hybrid SJBO model, and four simple baselines at the population and the individual level. Unlike rigid baselines and the classic Naming Game, which inherently capture only a single aspect, hybrid models can be tuned to model either individual-level opinions or aggregate opinion dynamics. However, this flexibility comes with a strict trade-off, as they cannot accurately reproduce both simultaneously. Out of the six analysed topics, our model exceeds or matches SJBO, showing that reinforcement and forgetting grounded in cognition contribute to explaining opinion dynamics. Additionally, in our empirical data, individuals change their opinions while the aggregate distribution stays almost stationary, so a model reproducing no dynamics can still score well. This observation indicates that evaluating opinion models must be multidimensional and rely on more than one metric.

Explore related subjects

Keep this discovery

BibTeXRIS

Mateusz Nurek, Joanna Kołaczek, Radosław Michalski, Bolesław K. Szymański, Omar Lizardo. 2026-08-28. CoDiNG -- Naming Game with Continuous Latent Opinions of Individual Agents. https://arxiv.org/abs/2406.19204

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related discoveries

Dilemmas and trade-offs in the diffusion of conventions

Outside ideal settings, conventions are shaped by heterogeneous competing processes that can challenge the emergence of norms. In order to acknowledge this complexity, this paper develops a generalized account of conventions and identifies three trade-offs involved in their diffusion: (I) the trade-off between the imperatives of social, sequential, and contextual consistency that individuals balance when choosing between conventions; (II) the competition between local (bottom-up) and global (top-down) coordination, depending on whether individuals coordinate their behavior via interactions throughout a social network or external factors transcending the network; and (III) the balance between decision optimality (e.g., collective satisfaction) and decision costs when collectives with conflicting preferences choose a convention. A broadly applicable statistical physics framework for exploring these trade-offs is developed and applied to a sign convention in physics. The method can infer the structure of the underlying coordination game, the networks of social interactions involved, and the processes through which conflicts are resolved. This shows that the purpose of conventions may exceed coordination, and that individual preferences towards conventions are concurrently shaped by cultural factors and multiple social networks. Finally, this work emphasizes the role of leadership in the resolution of conflicts.

physics.soc-ph

Criticality and universality in network dismantling

Identifying the smallest set of elements whose removal dismantle a complex network, known as the network dismantling problem, is a fundamental task with many practical applications. Whereas network dismantling has been extensively studied over the past decade, most work has focused on developing efficient algorithms for large but finite networks. By contrast, the physics of the network dismantling process, namely how the network structural connectivity is affected by the removal of nodes or edges, remains largely unexplored in the thermodynamic limit. Here, we shed light on this understudied aspect of network dismantling by introducing an adaptive biased percolation process able to optimally dismantle a network. Through a systematic analysis of synthetic network models, we find that the proposed percolation process displays a universal phase transition, characterized by the abrupt and simultaneous disappearance of both the giant connected component and the largest 2-core, across networks with markedly different degree distributions. Simulations on real networks further support this universality, indicating that the physics of network dismantling is insensitive to a broad range of topological properties. Together, these results suggest that a topology-agnostic theory could be developed to explain the critical behavior of network dismantling.

physics.soc-ph

Measuring Collective Semantic Change in Populations of Language Model Agents

Collective semantic change in populations of language model agents is a measurable dynamical phenomenon. We present a passive longitudinal instrument called Kopterix that observes the semantic state of an agent population as a sequence of bounded observations under a protocol defined before the observations begin. Each observation divides the sampled feed by post age into surface, mid-stream, and residue layers, which makes semantic differences across content age measurable alongside run-to-run change. We validate the instrument on Moltbook, an agent-native social platform, over a two-month window of scheduled observations, with the periodicity check extended across approximately four months. At the lexical level, rarefied entropy resolves an April-May difference in the evenness of the stored top 200 unigram distributions, and adjacent states are lexically closer than states paired after timestamp shuffling. At the geometric level, grand mean centering exposes the scale of a common embedding direction, and scheduled shuffle checks support a recurring excess in the mid-stream to residue separation relative to the shuffled reference. At the temporal level, detrended scalar quantities and centered layer centroids lose much of their similarity over several hours, and a weaker positive component declines across longer separations with no strong weekly recurrence. Several attractive apparent structures failed their controls, and each reading is limited to the level its controls support. The design applies wherever a population of agents produces a timestamped language environment that can be observed repeatedly and divided by content age.

physics.soc-ph