Searcharxiv⌕ Search

arXiv subjects

Alina Dubovskaya

Publications and source records attributed to Alina Dubovskaya.

3 recordsLinked to original sources

Opinion polarization from compression-based decision making where agents optimize local complexity and global simplicity

Understanding social polarization requires integrating insights from psychology, sociology, and complex systems science. Agent-based modeling provides a natural framework to combine perspectives from different fields and explore how individual cognition shapes collective outcomes. This study introduces a novel agent-based model that integrates two cognitive and social mechanisms: the desire to be unique within a group (optimal distinctiveness theory) and the tendency to simplify complex information (cognitive compression). In the model, virtual agents interact in pairs and decide whether to adopt each other's opinions by balancing two opposing drives: maximizing opinion diversity within their local social group while simplifying the overall opinion landscape, with both evaluated using Shannon entropy. We show that the combination of these mechanisms can reproduce real-world patterns, such as the emergence of distinct heterogeneous opinion clusters. Moreover, unlike many existing models where opinions become fixed once opinion groups form, individuals in our model continue to adjust their opinions after clusters emerge, leading to ongoing variation within and between opinion groups. Computational experiments reveal that polarization emerges when local group sizes are moderate (consistent with Dunbar's number), while smaller groups cause fragmentation and larger ones hinder distinct cluster formation. Higher cognitive compression increases unpredictability, while lower compression produces more consistent group structures. These results demonstrate how simple psychological rules can generate complex, realistic social behavior and advance understanding of polarization in human societies.

physics.soc-ph↗

Modeling diffusion in networks with communities: a multitype branching process approach

The dynamics of diffusion in complex networks are widely studied to understand how entities, such as information, diseases, or behaviors, spread in an interconnected environment. Complex networks often present community structure, and tools to analyze diffusion processes on networks with communities are needed. In this paper, we develop theoretical tools using multi-type branching processes to model and analyze diffusion processes, following a simple contagion mechanism, across a broad class of networks with community structure. We show how, by using limited information about the network -- the degree distribution within and between communities -- we can calculate standard statistical characteristics of propagation dynamics, such as the extinction probability, hazard function, and cascade size distribution. These properties can be estimated not only for the entire network but also for each community separately. Furthermore, we estimate the probability of spread crossing from one community to another where it is not currently spreading. We demonstrate the accuracy of our framework by applying it to two specific examples: the Stochastic Block Model and a log-normal network with community structure. We show how the initial seeding location affects the observed cascade size distribution on a heavy-tailed network and that our framework accurately captures this effect.

physics.soc-ph↗

Analysis of mean-field approximation for Deffuant opinion dynamics on networks

Mean-field equations have been developed recently to approximate the dynamics of the Deffuant model of opinion formation. These equations can describe both fully-mixed populations and the case where individuals interact only along edges of a network. In each case, interactions only occur between individuals whose opinions differ by less than a given parameter, called the confidence bound. The size of the confidence bound parameter is known to strongly affect both the dynamics and the number and location of opinion clusters. In this work we carry out a mathematical analysis of the mean-field equations to investigate the role of the confidence bound and boundaries on these important observables of the model. We consider the limit in which the confidence bound interval is small, and identify the key mechanisms driving opinion evolution. We show that linear stability analysis can predict the number and location of opinion clusters. Comparison with numerical simulations of the model illustrates that the early-time dynamics and the final cluster locations can be accurately approximated for networks composed of two degree classes, as well as for the case of a fully-mixed population.

physics.soc-ph↗