Search arXiv⌕ Search

arXiv · 2610.07971

Probabilistic neighbors' selection competes with confirmation bias in a bounded confidence model

Abstract

In this work, we investigate three modified versions of the classic Hegselmann-Krause opinion dynamics model, incorporating features that are typical of many real-world systems, such as uncertainty in the selection of interacting agents and a weighted evaluation of the relevance of their opinions in the influence function to enhance confirmation bias. Through extensive simulations across different network topologies, ranging from stylized network models (Barabási-Albert, Erdős-Rényi, and Watts-Strogatz networks) to empirical networks with community structure, we identify the influence of each modification on opinion evolution and convergence. Our findings reveal that they exert opposite effects on the bounded confidence threshold required for consensus. We further explore an extension based on a data-driven opinion initialization on the empirical networks, where initial opinions are drawn from Gaussian distributions specific to each detected community. While the qualitative effects of the three modified models remain consistent, this new initialization strategy reveals distinct dynamics within the network communities. These insights provide a new and comprehensive perspective on how realistic variations of the Hegselmann-Krause model, in terms of both interaction rules and initial opinion distributions, affect opinion dynamics and shed light on the mechanisms of consensus formation within structured communities.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chiara Giaquinta, Laura Hernández, David Chavalarias. 2026-10-06. Probabilistic neighbors' selection competes with confirmation bias in a bounded confidence model. https://arxiv.org/abs/2610.07971

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

KEEP EXPLORING

Related papers

The Steel Scrap Age: Bridging the Quality Gap through Structural Supply Chain Reorganization

The transition to a circular economy is pivotal for industrial decarbonization, particularly in the energy-intensive steel sector. While recycling scrap via electric arc furnaces offers a low-carbon alternative to primary production, the accumulation of contaminants in post-consumer steel threatens to render secondary material unusable for high-grade applications. This quality problem creates a market failure where traditional spot markets cannot guarantee the material provenance required for high quality (e.g. automotive-grade) steel. Here we show, using a massive longitudinal analysis of 1,163,561,858 news articles combined with global trade network data, that the industry addresses this partly through direct, vertically integrated alliances. We demonstrate that steelmakers are bypassing intermediaries to forge sovereign, closed-loop ties with manufacturers, effectively substituting market mechanisms with organizational integration. This reorganization coexists with a division between circular network cores in the Americas and Europe that pair their steel and scrap flows most tightly within their region, and economies whose steel and scrap flows are far less matched. At firm level, the quality of the returned scrap is a stated reason in twelve of thirty-six reciprocal loops closing after 2020 and in none of the eight loops detected before. Our results indicate that the circular economy is evolving into a geopolitical contest for material control, where competitive advantage is defined by the sovereign possession of closed material cycles rather than mere cost efficiency.

physics.soc-ph↗

Universal time scales linking topology and dynamics in temporal networks

Temporal networks underlie a wide range of social, technological, and biological phenomena, highlighting how temporal inhomogeneities drive interactions in complex systems. Despite vast research on the area, the way temporal network connectivity evolves across time scales remains poorly understood. By analyzing temporal network data of informational and societal origin, involving tens of systems, millions of nodes, and observation periods from days to years, we find systematic evidence of an optimal time scale for coarse-graining interaction events. At this level of aggregation, networks are maximally dynamic in their local structure, while retaining system-wide connectivity. To understand the origins of such a seemingly generic interplay of time and topology, we explore a minimal temporal network model based on uncorrelated renewal processes, and show that intermittent yet globally connected activity may arise solely due to heterogeneities in inter-event times and degrees, and no other system-specific details. All coarse-grained empirical networks studied show persistent patterns of cyclic node degree change yet stationary system-level degree distributions, a striking coexistence of microscopic self-regulation and macroscopic stability. Our results give support to the notion of a universal pattern in temporal networks that involves both time and topology, via the nontrivial interplay of aggregation and temporal inhomogeneity, with consequences for the study of spreading dynamics on networks and the balance between robustness and adaptability in complex systems.

physics.soc-ph↗

Keeping the interaction structure explicit: comment on "Graphs are maximally expressive for higher-order interactions"

Peixoto et al. (arXiv:2602.16937v2) stress that graph-based formulations can express any interaction model, a point the literature on higher-order networks (HONs) has often overlooked. We agree with much of their critique. We argue that expressiveness, however, might not be the main reason hypergraphs are often preferred. A network is read from a model rather than assumed, and to properly study the role of structure-one of the most basic questions in complex systems research-one needs a representation that keeps that structure separate from the functional form of the interactions. We show that such representation is in general a directed hypergraph (equivalently, a directed factor graph), with one hyperarc per interaction term, recovering a (directed) graph for pairwise interactions, and an undirected hypergraph for symmetric, higher-order ones. Most of the HONs literature has focused so far on symmetric interactions, which, in light of what established here, might explain why there (undirected) hypergraphs are regularly presented as the natural representation for systems with higher-order interactions.

physics.soc-ph↗