ﻻ يوجد ملخص باللغة العربية
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 system 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.
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
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 shar
We employ stabilization methods and second order Poincare inequalities to establish rates of multivariate normal convergence for a large class of vectors $(H_s^{(1)},...,H_s^{(m)})$, $s geq 1$, of statistics of marked Poisson processes on $mathbb{R}^
A finite graph $G$ is said to be {em $(G,3)$-$($connected$)$ homogeneous} if every isomorphism between any two isomorphic (connected) subgraphs of order at most $3$ extends to an automorphism $gin G$ of the graph, where $G$ is a group of automorphism
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