اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe Deffuant model on $mathbb{Z}$ with higher-dimensional opinion spaces
104
0
0.0
(
0
)
تأليف
Timo Hirscher
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
When it comes to the mathematical modelling of social interaction patterns, a number of different models have emerged and been studied over the last decade, in which individuals randomly interact on the basis of an underlying graph structure and share their opinions. A prominent example of the so-called bounded confidence models is the one introduced by Deffuant et al.: Two neighboring individuals will only interact if their opinions do not differ by more than a given threshold $theta$. We consider this model on the line graph $mathbb{Z}$ and extend the results that have been achieved for the model with real-valued opinions by considering vector-valued opinions and general metrics measuring the distance between two opinion values. Just as in the univariate case, there exists a critical value for $theta$ at which a phase transition in the long-term behavior takes place.
قيم البحث
اقرأ أيضاً
During the last decades, quite a number of interacting particle systems have been introduced and studied in the border area of mathematics and statistical physics. Some of these can be seen as simplistic models for opinion formation processes in grou
ps of interacting people. In the one introduced by Deffuant et al. agents, that are neighbors on a given network graph, randomly meet in pairs and approach a compromise if their current opinions do not differ by more than a given threshold value $theta$. We consider the two-sidedly infinite path $mathbb{Z}$ as underlying graph and extend former investigations to a setting in which opinions are given by probability distributions. Similar to what has been shown for finite-dimensional opinions, we observe a dichotomy in the long-term behavior of the model, but only if the initial narrow-mindedness of the agents is restricted.
A version of the Schelling model on $mathbb{Z}$ is defined, where two types of agents are allocated on the sites. An agent prefers to be surrounded by other agents of its own type, and may choose to move if this is not the case. It then sends a reque
st to an agent of opposite type chosen according to some given moving distribution and, if the move is beneficial for both agents, they swap location. We show that certain choices in the dynamics are crucial for the properties of the model. In particular, the model exhibits different asymptotic behavior depending on whether the moving distribution has bounded or unbounded support. Furthermore, the behavior changes if the agents are lazy in the sense that they only swap location if this strictly improves their situation. Generalizations to a version that includes multiple types are discussed. The work provides a rigorous analysis of so called Kawasaki dynamics on an infinite structure with local interactions.
When the interactions of agents on a network are assumed to follow the Deffuant opinion dynamics model, the outcomes are known to depend on the structure of the underlying network. This behavior cannot be captured by existing mean-field approximation
s for the Deffuant model. In this paper, a generalised mean-field approximation is derived that accounts for the effects of network topology on Deffuant dynamics through the degree distribution or community structure of the network. The accuracy of the approximation is examined by comparison with large-scale Monte Carlo simulations on both synthetic and real-world networks.
We investigate a model for opinion dynamics, where individuals (modeled by vertices of a graph) hold certain abstract opinions. As time progresses, neighboring individuals interact with each other, and this interaction results in a realignment of opi
nions closer towards each other. This mechanism triggers formation of consensus among the individuals. Our main focus is on strong consensus (i.e. global agreement of all individuals) versus weak consensus (i.e. local agreement among neighbors). By extending a known model to a more general opinion space, which lacks a central opinion acting as a contraction point, we provide an example of an opinion formation process on the one-dimensional lattice with weak consensus but no strong consensus.
The Deffuant model is a spatial stochastic model for the dynamics of opinions in which individuals are located on a connected graph representing a social network and characterized by a number in the unit interval representing their opinion. The syste
m evolves according to the following averaging procedure: pairs of neighbors interact independently at rate one if and only if the distance between their opinions does not exceed a certain confidence threshold, with each interaction resulting in the neighbors opinions getting closer to each other. All the mathematical results collected so far about this model assume that the individuals are located on the integers. In contrast, we study the more realistic case where the social network can be any finite connected graph. In addition, we extend the opinion space to any bounded convex subset of a normed vector space where the norm is used to measure the level of disagreement or distance between the opinions. Our main result gives a lower bound for the probability of consensus. Interestingly, our proof leads to a universal lower bound that depends on the confidence threshold, the opinion space~(convex subset and norm) and the initial distribution, but not on the size or the topology of the social network.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
