Next Article in Journal
Consistent Model Selection Procedure for Random Coefficient INAR Models
Next Article in Special Issue
Contrarian Majority Rule Model with External Oscillating Propaganda and Individual Inertias
Previous Article in Journal
Energy Conversion and Entropy Production in Biased Random Walk Processes—From Discrete Modeling to the Continuous Limit
Previous Article in Special Issue
An Agent-Based Statistical Physics Model for Political Polarization: A Monte Carlo Study
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Bounded Confidence and Cohesion-Moderated Pressure: A General Model for the Large-Scale Dynamics of Ordered Opinion

1
Department of Sociology, East China University of Science and Technology, Shanghai 200030, China
2
School of Physical Science and Engineering, Beijing Jiaotong University, Beijing 100044, China
*
Authors to whom correspondence should be addressed.
Entropy 2023, 25(8), 1219; https://doi.org/10.3390/e25081219
Submission received: 16 June 2023 / Revised: 31 July 2023 / Accepted: 6 August 2023 / Published: 16 August 2023
(This article belongs to the Special Issue Statistical Physics of Opinion Formation and Social Phenomena)

Abstract

:
Due to the development of social media, the mechanisms underlying consensus and chaos in opinion dynamics have become open questions and have been extensively researched in disciplines such as sociology, statistical physics, and nonlinear mathematics. In this regard, our paper establishes a general model of opinion evolution based on micro-mechanisms such as bounded confidence, out-group pressure, and in-group cohesion. Several core conclusions are derived through theorems and simulation results in the model: (1) assimilation and high reachability in social networks lead to global consensus; (2) assimilation and low reachability result in local consensus; (3) exclusion and high reachability cause chaos; and (4) a strong “cocoon room effect” can sustain the existence of local consensus. These conclusions collectively form the “ideal synchronization theory”, which also includes findings related to convergence rates, consensus bifurcation, and other exploratory conclusions. Additionally, to address questions about consensus and chaos, we develop a series of mathematical and statistical methods, including the “energy decrease method”, the “cross-d search method”, and the statistical test method for the dynamical models, contributing to a broader understanding of stochastic dynamics.

1. Introduction

1.1. Opinion Evolution: Micro-Mechanisms and Macroscopic Issues

In recent years, owing to the rapid advancement of social media and online communities, we have witnessed a remarkable phenomenon: the potency of opinion evolution frequently sparks intricate public opinion events and mobilizes collective action. This captivating dynamic, intertwined with aspects such as group decision-making and related concerns, has emerged as a prominent area of research in the field of opinion dynamics. In this area, ordered opinions, which include common types such as political perspectives and emotional intensity, have garnered significant attention. Existing literature addressing this matter has primarily focused on examining the micro elements of macro consequences, such as consensus [1], thereby establishing a fundamental problem awareness in statistical physics. Furthermore, this research can effectively engage in constructive discourse with social influence theory and agent-based modeling methods in the domain of mathematical sociology [2,3,4,5]. Drawing on these foundations, certain studies in nonlinear dynamics and social learning theory have directly formulated update rules for individual opinions based on empirical assumptions, such as “interpersonal imitation” and “Bayesian updating” [6,7]. To elucidate the reliability of such micro assumptions, our objective is to comprehensively review behavioral science and communication studies concerning several mechanisms, which encompass the “bounded confidence hypothesis”, “out-group pressure mechanism”, and “in-group cohesion mechanisms” (their meanings will be explained below). This endeavor not only helps us to present the problem awareness of our paper but also establishes a solid groundwork for subsequent modeling in the ensuing sections.
Firstly, within a particular social context, individuals often adhere to a “bounded confidence” mechanism when deciding whether to engage in an interaction. In the realm of opinion dynamics models, this can be simplified as a hypothesis: individual i possesses a confidence threshold d and only engages with j at time t + 1 if the difference between j’s opinion value at time t and i’s opinion value at time t falls below d(|xi(t) − xj(t)| < d) [8]. To establish the reliability of this mechanism, we can direct our attention to some empirical research on selective exposure and echo chambers in communication studies, which shows people tend to contact and understand information similar to their cognitions and opinions because bounded confidence serves as its idealized manifestation. This body of literature scrutinizes discourses on platforms like Twitter, Facebook, and Reddit through online experiments and data mining, illustrating that many individuals exhibit a strong inclination to interact with content that aligns with their own, such as by commenting and sharing [9,10]. Simultaneously, some scholars have identified that people give more weight to nearby opinions while forming their opinions based on behavior experiments [11]. These findings can substantiate the applicability of the “bounded confidence hypothesis” in large-scale social networks.
Secondly, having explored the local groups formed by bounded confidence/echo chambers and their consequences, we can categorize people into in-groups and out-groups based on a fixed agent. For a given agent i, the former encompasses “current interactors” and “frequent interactors” of i, a phenomenon explicable by the localized bounded confidence mechanism. The latter represents other individuals within social networks who are numerous and more likely to exert overall social pressure/out-group pressure. Taking Facebook as an illustration, individual i engages in conversations with j1… jn at time t(in-groups) while simultaneously perusing a substantial volume of content posted by unfamiliar individuals (out-groups). Both aspects can influence individual i’s opinion state at time t + 1, and the effect from out-groups can be called as out-group pressure. In this regard, certain literature in behavioral science and opinion dynamics regards the source of pressure as a composite of multiple individuals’ states, such as the average of opinions held by all out-group users, thereby revealing its “intervention” effect on individual cognition and decision-making. Consequently, the existence of “out-group pressure mechanisms” (or “social pressure”) is verified [12,13].
Thirdly, to exemplify the extent of influence exerted by the aforementioned mechanisms on individual opinions, an exploration of the interplay between the in-group/bounded confidence mechanism and the out-group/social pressure mechanism is warranted. This interaction is pertinent to the “group cohesion” observed within small groups (abbreviated as cohesion), and the meaning of this concept is the degree to which group members coordinate and maintain consistency with each other. In this regard, it is imperative to integrate the realms of psychology and communication to explain relevant mechanisms. Within the field of psychology, research on cohesion can be classified into two distinct categories. Firstly, it centers on the definition and quantification of cohesion, primarily encompassing individuals’ identification with the group and similarity among group members. However, this endeavor encounters substantial ambiguity and lacks a universally accepted consensus [14]. Secondly, it delves into investigating the moderating impact of in-group cohesion on out-group pressure, wherein it diminishes individuals’ perception of pressure, leading them to resist external opinions and succumb to “group blindness [15]”. Therefore, the role of social pressure mechanisms in opinion evolution can be mitigated. Regarding communication studies, emphasis is placed on the attribute of the “filter bubble” within small groups in social networks [16]. This concept suggests that when an individual exclusively receives homogeneous information, their exposure to divergent opinions becomes limited [17]. Extensive empirical data has validated this phenomenon, with a significant focus placed on the “information/opinion homogeneity” of group members. This perspective serves as a vital factor in assessing cohesion during the evolution of opinions. In this context, the similarities among opinions within the in-group can serve as a metric for measuring the strength of cohesion, and we will obtain the “out-group pressure” moderated by “in-group cohesion mechanisms” through the method.
In addition, building upon the preceding discussion on the foundational mechanisms governing interactions between individuals, we shall augment the existing understanding with two inconclusive micro/intermediate mechanisms (depending on individuals’ attributes). This endeavor seeks to construct a comprehensive portrayal of opinion evolution, facilitating the transition towards overarching macroscopic issues. Within this framework, the micro-mechanism manifests as follows: when individual i engages with individual j, they engage in reciprocal communication and imitation, thereby converging their opinions. Alternatively, they may elect to maintain their respective opinions unaltered or actively oppose one another, precipitating a polarization of attitudes [18]. On the other hand, the intermediate mechanism revolves around the premise that within a given context (such as platforms for mutual attention or dissemination), the likelihood of “individual i interacting with individual j” varies contingent upon social network factors. This notion elucidates the essence of “large-scale”, as denoted in the title of our scholarly contribution, signifying the presence of a multitude of unfamiliar relationships within the network. Consequently, this engenders a distinctive manifestation of large-scale opinion dynamics that is different from localized dynamics.
Arising from the elucidated micro and intermediate mechanisms, we frequently encounter three distinct macroscopic phenomena: global consensus, local consensus, and chaos. Global consensus denotes the convergence of all individual opinions within the system, culminating in a nearly homogeneous state (i.e., the final count of opinion categories (Opinion categories refer to the several kinds of opinions that the system converges to when time approaches infinity.) represented by N (consensus) equals 1, and it’s also called as “consensus categories” below). Local consensus signifies the convergence of opinions within the system towards multiple states (i.e., 1 < N (consensus) < n, where n represents the number of individuals). Lastly, chaos manifests when individual opinions fail to converge, thereby evincing intricate fluctuations. These phenomena shall be rigorously defined in the preliminary sections of our manuscript.
In reference to the micro-mechanisms and macroscopic phenomena, we aim to respectively elucidate the problem awareness: 1. Probing the sufficient conditions for the emergence of a global consensus within the opinion system (the question 1); 2. Delving into the conditions for attaining the local consensus within the opinion system (the question 2-1), and also investigating the mechanisms (Conditions and mechanisms are two different concepts in sociology. Condition refers to the factors that cause consequences, and mechanism refers to the way in which conditions act on the results (usually represented as agent action combinations and system processes).) that impede its transformation into a global consensus (the question 2-2); 3. Exploring the conditions for the opinion system to enter the chaos (the question 3-1) and mechanisms that hinder its transformation into a local consensus (the question 3-2). It is important to note that the aforementioned conditions in each of the 3 cases pertain to “individuals’ attributes” or “the potency of particular micro-mechanisms”, while the conclusions evidently represent macroscopic outcomes, such as consensus.
To address these questions effectively, we must pose explicit steps/problems that warrant attention. Regarding this, we can solve three problems to answer questions 1/2/3: 1. Presenting a formal model that accurately depicts the intricacies of an opinion interaction on a micro level (Problem A); 2. Scrutinizing the conditions and outcomes within this formal model through mathematical deductions and numerical simulations to unravel the laws and mechanisms underlying consensus and chaos generation (Problem B); 3. Utilizing data from social media to infer and validate the model parameters, thereby substantiating their alignment with real-world processes (Problem C). We will review the existing solutions to problems A/B/C in Section 1.2.1, Section 1.2.2 and Section 1.2.3, respectively.

1.2. General Model: Bounded Confidence and Its Properties

1.2.1. Modeling

In the realm of problem A, scholars in social dynamics have undertaken numerous endeavors to model the fluctuations in opinions based on the aforementioned micro-mechanisms. These models can be broadly classified into two categories, depending on the specific context being explored. When investigating offline social dynamics and discrete value/category perspectives, prominent models like “voter” assume a vital role in transforming individual interactions into a collective decision-making process, enabling effective explanations and predictions of political behaviors, such as citizen elections [19]. Conversely, models like bounded confidence/social influence demonstrate remarkable reliability when examining the continuum/ordered opinions exchanged online [19]. These models primarily emphasize large-scale assimilation mechanisms and can be effectively analyzed within the context of social networks, which is precisely the focal point of our scholarly investigation and will be elaborated upon in subsequent sections.
Within the framework of the bounded confidence hypothesis, two widely accepted formal models are the H-K model and the D-W model. While these models differ in terms of the mechanisms governing the evolution of opinions, they both exhibit robust convergence and synchronization. Specifically, the H-K model is well-suited for scenarios involving open and conversational opinion interactions, such as Reddit questions or Twitter posts. Its updating strategy involves individuals computing the arithmetic mean of others’ opinions within their neighborhood. The basic formulation of the H-K model is the following: Equation (1) [6]. On the other hand, the Deffuant model operates within the context of pairwise communication between individuals, such as Facebook conversations, and incorporates significant stochastic attributes. It utilizes the weighted average of opinions between pairs of individuals to update the original opinion. The basic representation of the Deffuant model is as shown in the following Equation (2) (where xi(t) denotes the opinion of individual i at time t):
x i ( t + 1 ) = j : x i t x j ( t ) 1 x j ( t ) j : x i t x j ( t ) 1 1
x i ( t + 1 ) = x i ( t ) + u x j ( t ) x i ( t ) x j ( t + 1 ) = x j ( t ) + u x i ( t ) x j ( t )
In the classic HK and DW frameworks, the assumptions of individual homogeneity, environmental certainty, and other characteristics are far from reality. Recently, scholars have weakened these assumptions and presented complexity characteristics in the following ways (written as strategy 1/2/3/4): (1) they have studied heterogeneous bounded confidence models, which require different confidence thresholds (di) and individual learning rates (ui) [20]; and (2) they have emphasized the asymmetric opinion updating mechanism. In the classic Deffuant model, paired individuals often update their opinions simultaneously. However, this assumption can be weakened to “individual i updates their own opinion based on individual j, but individual j does not update based on individual i” [21]. This adjustment is suitable for large-scale social networks where individual i browses individual j’s tweets; (3) They have introduced stochastic noise to add uncertainty to the HK model and incorporate global effects into opinion transitions. Individuals are not only influenced by opinions within the confidence threshold but also closely related to attitudes in the overall environment [22,23]; (4) They have added stubborn agents [24,25] with unchanged opinions into the model and have explained the formation of opinion polarization through simulation and empirical results [26].
Some of these revision strategies are closely related to the psychological mechanisms [27,28] mentioned earlier and can be included in the general model of this article. For strategy (1), the subsequent framework will incorporate heterogeneity to adapt to complex individual behaviors. For strategy (3), considering the limited research on group pressure in opinion evolution and the neglect of its transmission effect, we can choose an appropriate expression for random noise to represent the effect of out-group pressure on individual interactions and regulate this effect through in-group cohesion. As for strategy (4), existing models often lack social exclusion effects (ui is less than 0). Therefore, our paper will consider this special condition as a supplement to “stubborn agents”, who are non-assimilatory and may have consequences that differ from synchronization. In general, the integration of different mechanisms (by revision strategies of the D-W/H-K models) can construct a new model close to reality, serving as the solution to problem A.

1.2.2. Synchronization Research

For problem B, the pertinent literature has extensively investigated the synchronization of bounded confidence models (the meaning of synchronization is the same as the global consensus aforementioned in the field of opinion dynamics); however, the mechanisms behind chaos remain insufficiently understood. Regarding numerical simulation, some scholars have not only explored the sufficient conditions for the formation of global consensus (such as d > 1/2) but have also simulated the number of consensus categories and convergence rates under various parameter conditions [29,30]. These endeavors yield reliable hypotheses and conjectures for subsequent theorem proofs while unearthing critical values and “statistical laws” governing model phase transitions.
When it comes to proving the synchronization theorems, the H-K and D-W frameworks offer two representative approaches. Under the original conditions (i.e., as per the model proposed), researchers have demonstrated the following theorem: “individual opinions either synchronize or diverge by more than the confidence threshold d” [31]. This conclusion possesses inherent intuitiveness: the governing rules of both model types effectively capture the process of opinion assimilation, and when there is a global or local consensus, it signifies a convergence of opinions. Achieving such convergence necessitates that interactions falling within the confidence threshold exert minimal influence on opinion values. However, multiple avenues exist to substantiate this claim, and through rigorous mathematical analysis, one can derive a plethora of insightful conclusions (theorems).
In terms of existing methodologies, they can be broadly classified into three distinct categories: (1) Predominantly centered on the inherent characteristics of the model, these approaches leverage mathematical techniques such as scaling and probability approximation for processing. For instance, within the context of H-K, synchronization outcomes can be derived through inductive reasoning based on the order-preserving property of xi(t) under the update rule F or by considering the non-decreasing and non-increasing attributes of the upper and lower bounds [31]. (2) Regarding bounded confidence models as dynamical systems, researchers draw upon conclusions and methodologies from various fields, including topological methods and ergodic theory. An example involves treating D-W as a random flow, exploring its stability and attractiveness, and subsequently formulating synchronization conditions and establishing proofs [32]. (3) Models such as D-W/H-K might view uncertainty as a perturbation to the control system, whereby the analysis of the stochastic system can undergo a transformation into the design of a stochastic control algorithm. This framework, pioneered by Chen, Su, et al. [33], has been introduced and partially developed.
In terms of the existing theorems, within the realm of homogeneous models (where u1 = … = un = u, d1 = … = dn = d), the convergence of the H-K model has been extensively addressed, attaining either synchronization or convergence towards multiple opinion values (with a difference between the convergence values greater than d) [31]. The D-W model can be categorized into symmetric and asymmetric cases (i.e., whether i/j updates opinions in pairs). The former guarantees a synchronization probability of 1 when d > 1/2, while the latter has convergence rate-based findings presented by Chen et al. [34,35]. Within the context of heterogeneity models (where individual di/ui differ from one another), several scholars have demonstrated that their convergent features are similar to those of homogeneous models, and global synchronization can also be achieved when maxdi = 1 [34,36].
The above methods are highly skilled and can be extended to the synchronous proof of numerous opinion dynamics models. In these methods, the idea of understanding the model as a dynamical system and proving synchronization through studying its geometric properties is worth noting, which is expected to be used for solving problem B and further developed in our paper.

1.2.3. Data Validation: Random Optimization and Bayesian Approaches

For problem C, it is imperative to broaden our perspective on the validation process of various dynamic models, which can be effectively applied to the model presented in this paper. This can be divided into parameter estimation of the model (obtaining unknown parameter values) and theoretical testing of models with specific parameter values (verifying the model’s capacity to explain the real world). The literature on the former (estimation) is relatively rich, while the methods of the latter (test) are still immature, with only some empirical attempts. In this regard, I will focus on reviewing the methods related to the former and providing a few introductions to the practice of the latter.
In regard to parameter estimation of dynamic models (such as opinion dynamics), existing methods can be classified into three distinct categories: (1) direct assignment of values by leveraging the structural information of parameters; (2) utilization of optimization techniques to search for parameters that minimize the disparity between simulation results and empirical data; and (3) utilization of sample/prior information to statistically infer parameters.
Regarding (1), certain literature has obtained numerical values about the number of agents/interaction attributes in the model through experimental design or empirical investigation [37,38]. However, due to the sensitivity of opinion updates to environmental conditions, it is challenging for researchers to design universally applicable experimental scenarios and directly employ measured values (e.g., social learning rate u or confidence threshold d) as parameter estimates in the model. As for (2), its fundamental concept revolves around measuring the “distance” between simulated data and real data, thereby identifying the optimal parameter values that sufficiently minimize this discrepancy through appropriate optimization methods. This approach frequently relies on intelligent algorithms and stochastic optimization techniques, such as particle swarm optimization or genetic algorithms [39,40,41], which offer reliable search strategies for “finding parameters that align with reality”. The convergence of these algorithms has been effectively proven under certain conditions. Furthermore, some scholars have integrated this “distance” into the loss function within the deep learning framework, employing gradient-based methods to determine the optimal parameter values for fitting [42].
Regarding (3), it not only acquires model parameters that align with the actual data (by minimizing the distance, etc.), as mentioned in (1)/(2), but also incorporates rigorous mathematical statistical techniques and probability theory interpretation into the parameter inference process, considering the variable distribution within the model. This includes parameter estimation and hypothesis testing. Given the intricacy of dynamic simulation rules (models), statistical strategies employed in this approach often necessitate the utilization of large sample theory, nonparametric estimation, and other methodologies, complemented by Bayesian analysis. In this context, some works either integrate such models with discrete selection frameworks or provide maximum likelihood estimates of parameters based on the assumption of samples and updating rules (such as those related to dynamics like Markov chains) [43]. Another publication introduces an intriguing notion, suggesting an approach in which the initial step entails determining the posterior distribution of parameters using the approximate Bayesian method. Subsequently, the distribution is smoothed through kernel density estimation, ultimately leading to an integrable density function. Finally, parameter estimators and test statistics can be computed using methods like Markov Chain Monte Carlo (MCMC), thus offering a comprehensive framework for analysis and inference [44]. In the forthcoming article, we shall adopt this idea as the foundation to propose a validation method for a class of opinion dynamic models and apply it to real-world data.
Concerning theoretical testing, some scholars apply machine learning methods to segment the dataset from social media into the training set and the testing set, then determine the accuracy of the model on the testing set [42]; if the accuracy is high, it can indicate the reliability of the theoretical model in prediction. In addition, scholars have collected cases of multiple social processes (such as multiple opinion evolution datasets), obtained simulation data through numerical calculations of the model, and verified the consistency between simulation data and case data in probability distribution [5]. In these methods, the researcher only tests whether the model results match the actual results (such as whether the opinion values obtained by simulation are the same as opinion values in the real world), but the consistency test between the “model rules” and the “real rules” is ignored (such as whether the “update method of opinions in the model” matches the “evolutionary rule of opinions in reality”). This is a significant direction worth exploring in our paper for solving problem C.

1.3. Literature Summary and Subsequent Research

Based on the above literature review, we have found that there are some problems with the existing solutions to problems A/B/C: (1) For problem A, mechanisms such as in-group cohesion and social exclusion have not yet been introduced into opinion evolution models, resulting in insufficient consideration of their impact on consensus/chaos. (2) For question B, the method of proving synchronization based on dynamical system theory needs further development, which will help to confirm the law between micro-mechanisms and macro-phenomena. (3) For problem C, we still lack effective means to test the consistency between the theoretical model rules and real-world rules. Therefore, we will introduce the mechanism described in (1) in the model of Section 2 (and explore its effects and laws in Section 3 and Section 4), develop the dynamic system method in the proof of theorems in Section 2, and propose solutions to the test problem in (3) in Section 5, thus solving problems A/B/C, respectively, and ultimately helping us answer the core questions 1/2/3 (global consensus/local consensus/chaos) in our research.

2. Model and Theorems

2.1. Overview

Based on the micro-level mechanisms described in Section 1.1, we attempt to propose a general model for opinion evolution that reflects micro-mechanisms (such as bounded confidence/group pressure illustrated in Section 1.1) and includes models (such as H-K/D-W and social influence models introduced in Section 1.1 and Section 1.2.1) to address Problem A. At the same time, the model also needs to describe the macroscopic outcomes mentioned earlier, such as global consensus/local consensus/chaos. From this, we can derive the correlation between micro-mechanisms and macro-phenomena in the model and obtain multiple theorems to preliminarily solve problem B.

2.2. Model

Guided by the above ideas, we establish a dynamical model consisting of the following parts, reflecting the interaction of ordered opinions among individuals (the strict version of our model is presented in Appendix A):
(1)
Environment: The environment of our model includes a social network G = ( V ,   E ) , a confidence threshold set D = { d i 0 , 1 :   i = 1 n } , a social learning/exclusion rate set   U = { u i j R :   i , j = 1 n } , and a pressure coefficient set K = { k i 0 , 1 :   i = 1 n } . Here, V = v 1 v n / E = e i j in G represents the set of all individuals/the set of all relationships between individuals (individuals can be called agents in the following text). Specifically, vi represents individual i (abbreviated as i), and eij represents the social relationship between individual i and individual j. di in D represents the confidence threshold of vi depending on the agent i, whose meaning is the same as the confidence threshold in the D-W model. uij in U represents the “social learning rate of vi towards vj’s opinion”/“the social influence rate of vj on vi’s opinion”, that is, “the degree to which vi adopts vj’s opinion after interacting with each other”. ki in K represents the influence of group pressure/mainstream opinion on individual i, hence the term “pressure coefficient”.
(2)
Variables: The variables of our model encompass opinion xi(t), social neighborhood N(i), and confidence neighborhood N(i, t), which can be explained respectively. First, Each individual vi has an opinion value at time t, denoted as x i ( t ) [ 0 , 1 ] , representing preferences for certain goods or political positions on certain events, etc. Second, each individual vi has a “social neighborhood”, denoted as N i = v j :   e i j E , which represents all individuals in the social network G who have relationships with vi, such as being friends or following each other. Third, each individual vi has a “confidence neighborhood” denoted as     N i t = v j :   x j t x i t < m a x d i , d j , which represents all individuals vj whose opinion difference with vi at time t is not greater than the larger of i’s and j’s thresholds. Under the bounded confidence hypothesis, this represents “all agents with whom vi could potentially engage in communication at least unilaterally” (regardless of whether “vi initiates communication with vj” or “vj initiates communication with vi”; this is because it just needs a single person to start a conversation in most scenes).
(3)
In-group Rule: At time t, for any individual vi, considering all individuals vj in Ni∩Nit (i.e., individuals with whom vi has a social relationship and whose opinion differences can be trusted and accepted by vi), a subset { v i 1 v i k } is randomly selected from this set to interact and exchange opinions with i, and the selection is denoted as a random event wt, with its probability defined in some contents like M1/M2/M3 in the section of Main Theorems and Appendix A. (This is because strictly defining probability is very cumbersome and relies on the measure theory, so it is included in the Appendix A). This subset consists of all individuals who interact with i, written as N(i, t). In this context, we denote the average influence of all vj’s opinions on vi as 1 / | N i , t | j N ( i , t ) u i j · x j t , where uij ∈ U represents the social learning rate defined earlier, and |·| represents the cardinality of a set. Additionally, individual i retains a portion of his original opinion, denoted as   [ 1 1 / | N i , t | · j N ( i , t ) u i j ] · x i t , where the coefficient of xi(t) is for weight normalization purposes.
(4)
Out-group Rule: At the same time, at time t, individual i browses information posted by other individuals in the social network G and is influenced by the average opinion E x t = 1 / n · v i V x i t of the network. The degree of this influence is adjusted by the “difference between individual i’s opinion and the mean opinion in Ni(t)” (referred to as “local discrepancy”), denoted as | x i t 1 / | N i , t | · j N i , t x j t | . Then, We can denote the environmental noise experienced by individual i at time t as the following equation: n o i s e i ( t + 1 ) = | x i t 1 / | N i , t | · j N i , t x j t | · ( E x t 1 / | N i , t | · j N i , t x j t ) , representing the adjusted group pressure. The overall effect of this pressure on individual i’s opinion is related to the pressure coefficient and denoted as k i · n o i s e i ( t + 1 ) .
(5)
The General Equation: Based on the rules described in (3) and (4), after opinion exchange/random event wt occurs, the opinions of all individuals i evolve from xi(t) to xi (t + 1), following the update equation:
  x i t + 1 = [ 1 1 / | N i , t | · j N i , t u i j ] · x i t + 1 / | N i , t | j N i , t u i j · x j t + k i · n o i s e i ( t + 1 )
In this equation, the environmental noise from (4) is incorporated, and the average influence of various vj’s on vi from (3) is considered to capture a richer range of opinion sources.
Clearly, (1) and (2) describe the environmental setup of the model, which is necessary for characterizing a class of social network dynamics. (3), (4), and (5) represent the evolution rules of the model, whose effectiveness relies on the behavior patterns and ways of interactions among individuals. From this perspective, we can explain how the evolution rules are derived from the micro-level mechanisms described in Section 1.1. The correspondence between this model and the mechanisms can be illustrated in the following Figure 1.
Regarding (3), it integrates the “bounded confidence hypothesis” and the “social influence mechanism”. The “bounded confidence” is reflected in the confidence threshold d, which determines the agents in N(i, t) who have opinion differences within the threshold, and only they can interact with the agent i. “Social influence” refers to the ability to change others’ opinions through persuasion/control, etc. Unlike the parameter u/ui in the homogeneous/heterogeneous H-K/D-W models (see Section 1.2.1), this influencing ability depends on the fixed social network structure (if there is no edge between vi and vj, there is no social influence) and has more heterogeneity (the influence of j on i varies for different j), which can be described using Ni/U and uij in the model and is similar to the strategies 1/4 in Section 1.2.1. This part integrates the “bounded confidence hypothesis” and characterizes social networks/assimilation, and exclusion as different social influence effects, represented by the yellow and blue parts in the diagram.
Regarding (4), noisei (t) is composed of the average opinion Ex(t) of the network and the local discrepancy | x i t 1 / | N i , t | · x j t | of individual i’s opinion. The former measures group pressure, which essentially indicates the pressure and influence of “mainstream opinions” perceived by individuals when browsing extensive information. The latter measures internal cohesion and focuses on the consistency of individual i’s opinion with the “internal group” to which they belong (in this case, the “small group N (i, t)” with which i interacts at time t), which is consistent with the measurement mentioned in Section 1.1. Thus, this part reflects the combination of the “out-group pressure mechanism” and the “in-group cohesion mechanism” based on strategy 3 in Section 1.2.1, represented by the purple part in the diagram.
Based on the above content, we have established a stochastic dynamic framework that integrates bounded confidence and social influence, taking into account different interaction mechanisms involving the in-group and the out-group. Based on this, we can further explain the generality of this model; the D-W/H-K/Degroot models (showing social influence) can all be viewed as special cases of this model. For D-W, it corresponds to the case of our model under the conditions of “G is a complete graph, uij = u, there exists a unique i and j such that N i , t = N j , t = 1 , and P i   i n t e r a c t s   w i t h   j = 1 / V ”. For H-K, it corresponds to the case of “G is a complete graph, 1 u i j = 1 / N i t · j N ( i , t ) u i j , and if x i t x j t < d ,   P i   i n t e r a c t s   w i t h   j = 1 ”. Similarly, the Degroot model is also an example of our model under specific conditions (When G is a complete graph, di = 1 for all of vi and P(i interact with j) = 1 for any i/j, our model is same with a kind of degroot model (xi(t + 1) = ∑wij•xj(t)).),which ensures that the theorems established later can be generalized to these types of special cases.

2.3. Main Theorems

In response to the model proposed earlier, we establish three fundamental theorems to answer questions 1/2/3, namely the global consensus/local consensus/chaos theorem, serving as preliminary solutions to Problem B. To this end, we first introduce three sub-models of our main model, which aid in stating the theorems. These sub-models have the same form as the main model but need to satisfy different conditions (representing different social environments) and are denoted as M1/M2/M3. We will describe them separately in the following sections. After that, we can intuitively define the macroscopic outcomes (consensus/chaos) in our model and illustrate our theorems.
In M1, there exists an individual i in the social network G who can engage in an opinion exchange with anyone. This requires his confidence threshold to be greater than maxdi(0)-mindi(0), and there should be edges between vi and any v j   ( d v i   =   n 1 , referred to as “star topology” in the related literature [45]). At each moment, an individual i randomly interacts with only one individual in his neighborhood N i N i t N i , t = 1 . Additionally, “the conversation between any i and j” and “the social learning rates” are symmetric (namely, i interacts with j if and only if j interacts with i; uij = uji > 0). These conditions indicate that M1 describes an assimilation system with an “active agent” (vi), where opinions among two individuals approach each other after the conversation. It is an extension of the heterogeneous D-W and H-K models.
In M2, the social network G is a complete graph Kn, meaning “there is an edge between any i and any j”. The social learning rates and confidence thresholds of all individuals are constants (ui = u, di = d), and they are not influenced by out-group pressure (ki = 0). Additionally, at each moment, individual i only interacts with one individual in its neighborhood, Ni∩Nit, and “the conversation between any i and j” and “the social learning rates” are also symmetric, the same with M1. Clearly, M2 represents an ideal scenario that depicts the evolution of opinions within a localized social group (a relatively closed group with closer and tighter connections among members). Moreover, M2 is a variation of the homogeneous D-W model that allows for multiple pairs of interactions among individuals at any time t, while D-W only allows one pair of interactions at each time step.
In M3, the social network G is only required to be a connected graph, meaning “there is a path between any i and j connecting them”. The confidence threshold di(t) of each individual i is a monotonically increasing function with a limit of 1. Additionally, individual i is similar to M2 and is not influenced by out-group pressure (ki = 0). Clearly, M3 can be understood as an “open society” where a connected graph allows unrestricted propagation of opinions and information among individuals. The increasing confidence threshold represents an expanded range of communication for individuals, and the absence of group pressure indicates freedom of expression of opinions. Furthermore, the social influence model can be viewed as a special case of M3, where di = 1 for any individual i.
In addition, we also need to clarify the definitions of several types of macroconsequences in the model in order to elucidate our theorems below: (1) Global consensus can be considered as “for any individual vi and vj, when t approaches infinity, the probability of   x i   t     x j   t   approaching 0 is 1” (strictly speaking, it is called “quasi consensus”), which is determined by the randomness of the above model. (2) Local consensus is equivalent to “the probability of N(consensus) > 1 is 1”, that is, “the probability of x1 (t)… xn (t) tending to multiple different values is 1”. (3) Chaos indicates that the probability of x1 (t)… xn (t) not converging/and constantly fluctuating is 1.
Under the conditions of these three models and the core definitions presented before, we derive sufficient conditions for achieving global consensus/local consensus/chaos. Based on the above discussion, these conditions also apply to the H-K, D-W, and social influence models (with slight deductions). The formal statements of the theorems are complex and require reference to Appendix A.
Theorem 1 (global consensus).
Under    M 1 , 0 , 1 n ,   Ω   , F  has stable quasi-consensus.
Theorem 2 (local consensus).
Under M2, if u 1 / 2 , n = [ 1 / d ] + 1 , x 0 [ 0 , 1 ] n , P w : N c o n s e n s u s w , x 0 n = 1 .
Theorem 3 (chaos).
Under M3, if F ˜ is an expanding map, thus P { w : x ( t )   h a s   L Y   c h a o s } = 1 , and it will not reach quasi-consensus.
For the stated theorems, we can provide intuitive sociological explanations: Theorem 1 indicates that in an assimilation system with active agents (M1), opinions will eventually evolve into a global consensus. Theorem 2 suggests that in a relatively closed group with close connections among members and high similarity (M2), the upper bound of the number of opinion categories under local consensus decreases as d increases. Theorem 3 states that in an open society with free information propagation, broad communication, and low group pressure (M3), if there is a certain degree of social exclusion (ui < 0), opinions will evolve into chaos. These explanations can answer questions 1, 2-1, and 3-1 under ideal conditions and demonstrate the significant impact of parameters di, ui, and ki on macroscopic results, thus inspiring the subsequent simulation studies.

3. Results: Experiment Design and Simulation Analysis

3.1. Overview

Based on the model and theorems in the previous section, we attempt to explore the macro-impact of micro-mechanisms (reflected by parameters such as uij) on opinions through simulation in this section to further solve problem B. This is because, compared to previous theorems, simulation can obtain weaker conditions and a wider applicability, which is closer to the real world. Therefore, the section revolves around numerical simulation and is divided into experiment design and results analysis, which will be elaborated in the following parts.

3.2. Simulation Experiment Design

According to the ideas in Overview, considering that the aforementioned theorem is only applicable to complete graphs and connected graphs, we perform numerical simulations on a small-world network [46] within our model. This choice ensures that the social relationships represented by the network closely resemble the actual conditions of opinion evolution. Furthermore, we aim to elucidate the influence of various factors, such as network structure, confidence threshold, and social learning rate, on the formation of consensus, to further solve problem B.
To achieve this, we will conduct multiple experiments based on our model. In these experiments, we set up the probability P (i interacts with j) = 0.5 when vj belongs to Nit∩Ni (except for the simulation of M1/M2/M3 to verify the theorems) and focus on the following parameters: (1) the average degree (briefly written as d*) of the network; (2) the social learning rate, denoted as “uij”; (3) the confidence threshold, denoted as “di”; and (4) the group pressure coefficient, denoted as “ki”. Moreover, to elucidate the micro-mechanisms impact on macro-level effects, we will first simulate a homogeneous model (with an arbitrary agent i/j, uij = u, di = d, and ki = k). Additionally, we will simulate the model under heterogeneity conditions (uij = ui/di varying upon the agent i). These practices serve to accomplish two fundamental tasks: A. Conducting numerical verification of the aforementioned theorem; B. Investigating the evolutionary mechanisms of consensus/chaos under other broad conditions (both helpful for solving problem B).
Our simulation environment can be illustrated briefly: First, the number of nodes in the network is 300. Second, the probability of random reconnection is established at 0.3 in the small-world network, and each experiment entails no less than 50 iterations. Furthermore, the model incorporates several parameters as variables, such as uij/di/ki, which are manipulated across diverse experiments to ascertain their numerical impact on the outcomes. To facilitate comprehensive analysis, we have devised distinct experimental strategies that can be categorized into two different types mentioned above: the homogeneous model (for any agent i and j, uij = u, di = d) and the heterogeneous model (different agents have different values of ui and di). Through simulation, the former unveils multiple ideal mechanisms, whereas the latter shows a substantial departure from ideal mechanisms, thereby enabling a thorough exploration. These experimental strategies are expounded upon below.
To handle task A, we endeavor to validate the consistency between our simulation results and the conclusions derived from Theorems 1–3 by opting for parameter values that satisfy the prescribed conditions. As for task B, we should separately handle the simulation of the homogeneous model and the heterogeneous model, as detailed and illustrated below.
For the homogeneous model, we are in pursuit of comprehending the enduring outcomes of distinct u/d variables and discerning the remarkable influences of k. Therefore, we shall take “the influence of the confidence threshold d on opinion outcomes” as an example to present a comprehensive framework for conducting the control experiment in the subsequent sections of our paper.
(1)
Arising from the mechanisms of imitation and exclusion, assign the variable “u” into two categories (denoted as u > 0/u < 0).
(2)
Under these two categories of u, analyze the impact of parameter “d” on the evolutionary outcomes of opinions separately. When u > 0, the experimental procedure entails the following steps: A. Control the values of u, d*, and k and observe the simulation results at various values of “d”; B. Conduct multiple experiments using fixed parameter values of d, u, d*, and k; C. Visualize the simulation results, such as the trend of individual opinion values, frequency of global synchronization, and distribution of consensus numbers; Similarly, when u < 0, perform simulation experiments analogous to those conducted when u > 0, such as controlling the same values of d*.
(3)
Finally, summarize and compare the obtained results to elucidate the comprehensive influence of “d” on the evolution of opinions under different values of “u”.
In a similar vein, we can apply this experimental protocol (or select particular stages within the protocol based on our needs) to investigate the influence of parameters, such as “d*/k”, on the outcomes of evolution. This endeavor aims to answer questions 1/2/3 about the phenomena of synchronization and chaos.
For the heterogeneous model, our focus lies in examining the interaction between imitators and repulsors (representing individuals i whose uij = ui > 0/uij = ui < 0 for all agents j, respectively). This interaction raises a question, stemming from the preceding text: when all agents are imitators (namely, they satisfy ui > 0), if given values of d/d* can engender global or local synchronization, how many repulsors (ui < 0 transformed from ui > 0) can disrupt synchronization and induce chaos? The conclusion drawn from Theorem 3 is confined to the scenario where the network is connected and d is large. However, simulation experiments can further elucidate this question, and we can break it down into two steps:
(1)
Set up the imitators/repulsors proportion, denoted as α/1 − α.
(2)
Employing the simulation strategy of the homogeneous model, control a set of d/d*/k values that lead to synchronization (when ui > 0) and simulate varying α values to comprehend their impact on consensus formation. Subsequently, we can depict relevant charts based on the results.
Consequently, we can integrate the findings from homogeneity/heterogeneity experiments to investigate the mechanism’s response to “global consensus”, “local consensus”, and the “chaotic state” as mentioned in the introduction (questions 1, 2, and 3 in Section 1.1, respectively). Moreover, the subsequent text will present simulation results categorized according to this classification (questions 1/2/3), accompanied by corresponding explanations and conclusions.

3.3. Simulation Results Analysis

3.3.1. Global Consensus

In this part, we expect to provide some analysis conducive to answering question 1 (in the Discussion), which requires us to search for the numerical conditions of global consensus arising from the theorems proved before. Therefore, it first involves the verification of these theorems: utilizing the aforementioned approach, we initially simulate the evolution of opinions under the conditions outlined in the preceding Theorems 1–3. As depicted in Figure 2a–c, the simulation shows the formation processes of global consensus, local consensus, and chaos. These simulation results substantiate the reliability of theorems to a certain extent.
Additionally, to considering the theorems and the experiment design, our focus shifts towards comprehensively elucidating the influence of some parameters on opinion dynamics, especially the impact of the network’s average degree (d*)/the confidence threshold (d)/social learning rate (u) and group pressure coefficient (k) on opinion formation. In this context, we proceed to present an intricate analysis of the simulation results of these four parameters while simultaneously exploring their correlation with the synchronization patterns exhibited by our model. In the Discussion section, we will use these analyses and conclusions to answer question 1 systematically.
In terms of network structure, specified as the average degree d*, the concept at hand pertains to “social reachability”, denoting “the possibility of contact between agents i and j about sharing opinions and information”. In a small-world network characterized by a high average degree, nodes possess a greater number of adjacent nodes, thus exhibiting high “social reachability”. Consequently, employing the aforementioned experimental approach, we control u = 0.4/k = 0.1/d = 0.3 (and d = 0.6) to observe the simulation results across different average degrees (d* = 2/5/8). Figure 3a–i illustrate the dual effects of the average degree d* on the model: (1) with a high average degree d*, few categories of local consensus emerge after multiple simulations, potentially leading to global consensus (as depicted in Figure 3a–c); (2) when d is large, an increase in the average degree d* can accelerate model convergence and facilitate the attainment of global consensus (as demonstrated in Figure 3d–i). In essence, both of these phenomena can be ascribed to a fundamental conclusion: the opinion system can achieve global consensus within a limited timeframe, contingent upon relatively elevated social reachability (a large d*).
Regarding the confidence threshold d, we relax the conditions specified in theorem 2 for the complete graph, obtaining different results from setting d = 0.3/0.6/1 while controlling u = 0.4/k = 0.1 and d* varying between 2/5/8. Upon examining the comparison between Figure 3a and Figure 3d (Figure 3b and Figure 3e), as well as Figure 3d and Figure 3f (Figure 3e and Figure 3g), it becomes apparent that an increase in d from 0.3 to 0.6 triggers a dramatic transformation in the final state of opinion evolution. The transition includes a shift from multiple types of local consensus to global consensus. However, when d escalates from 0.6 to 1, the discrepancies between the final states become less pronounced. This particular characteristic warrants further investigation in subsequent discussions. In general, the increase in threshold d brings out the emergence of global consensus or results in a smaller number of local consensus categories. This attribute represented by threshold d may be referred to as “confidence reachability”, signifying “the likelihood that agents i and j of the system are willing to engage in subsequent interactions (In this article, contact and interaction have different meanings. The former refers to an individual’s exposure to information from others, while the latter refers to an individual’s willingness to communicate and update his opinion with others after exposure to information) following their initial contact”.
In addition, it is imperative to consider the influence of the social learning rate (u) and the group pressure coefficient (k). Before the discussion, we can designate the effects of u and k as the assimilation effect (or exclusion effect when u < 0) and homogenization effect, respectively. The former represents the mutual approach of opinions after interactions between people (such as agent i and agent j), while the latter stands for the tendency of opinions to the mainstream opinion (shown as the average opinion) arising from group pressure. Specifically, assimilation refers to the effects of strategies such as mutual imitation/persuasion in communication (taking agent i as an example, its information source is agents interacting with i), while homogenization refers to individuals’ identification with the opinions of the majority due to group pressure (agent i’s information source is all individuals in the social network). Below are detailed elucidations for these two effects based on simulation results for parameters u and k.
For the parameter u, in accordance with the results provided in Figure 4a–c, the process of consensus formation accelerates when the variables d/d* satisfy the synchronization condition and u ascends from 0.2 to 0.5/0.8. In other words, when u surpasses 0, the increase in u plays a significant role in improving the assimilation effect and speeding up the emergence of global consensus. This is because from Figure 4a–c, the time for different individuals’ opinions to converge on consensus is significantly reduced (while u is increasing). Conversely, if u < 0, this assimilation effect will be transformed into an exclusive effect, thereby rendering it inapplicable within the above framework. This phenomenon will be discussed later in the “Chaos” section. For the parameter k, according to the results depicted in Figure 4d–f, the value of the group pressure coefficient k exhibits a positive correlation with the possibility of synchronization. This correlation can be attributed to the fact that the presence of noise (i, t) inclines towards transforming divergent individual opinions into the average opinion (although the small values of d/d * limit communication between some individuals, such as the upper and lower opinions in Figure 4a, the higher k allows each individual to consider the average opinion of everyone in the network), resulting in the consensus, which is called the homogenization effect above. The amplification of noise serves to convert local consensus into global consensus, which will be further expounded upon in subsequent sections. On the whole, the attributes of u and k encapsulate an additional imperative component that engenders global consensus: the assimilation and homogenization within the opinion system.
In the above paragraphs, we preliminarily explored the influence of parameters d/d*/u/k on synchronization. In order to depict the formation of global consensus in different micro-conditions more quantitatively, we conducted additional experiments to verify the macroscopic impacts of the two core parameters aforementioned, which have been known to have distinct roles, respectively: the average degree d* and the confidence threshold d, representing different “reachability”. Our experiments are comprised of three parts: (1) regarding social reachability d*, we conduct 20 simulation experiments on systems with varying average degrees (d* = 2…10) while keeping d = 0.4, and the frequencies of attaining global consensus in experiments (freq = number of global consensus/20) are recorded, yielding Figure 5a; (2) for confidence reachability, we set d* = 5 and recorded the frequencies of achieving global consensus for d values ranging from 0.3 to 0.6. The corresponding results are illustrated in Figure 5d; and (3) for both social reachability and confidence reachability, we draw the 3-dimensional graphs to show the evolution of opinions under different values of parameters d/d*, presented in Figure 5b,d.
From the results obtained from the experiment elaborated above, we find the synchronization frequency (the frequency to achieve global consensus) is positively correlated with d and d* (Figure 5a,c), and the number of opinion categories is decreasing when the value of d (or d*) is increasing (Figure 5b,d). These results are consistent with the analysis in the above paragraphs and are more reliable because of the comparison between more possible results under many values of d and d*.
In summary, when u > 0, if the values of the confidence threshold d and the average d* are large, the opinion tends to reach global consensus. In this mechanism, as the value of u increases, the rate of reaching global consensus will become faster (assimilation effect). If the value of the confidence threshold d and the average degree d* are not large enough, a larger group pressure coefficient k can convert local consensus into global consensus (homogenization effect). These conclusions will be further explained in the Discussion section, and a general answer to question 1 will be provided based on the concept of reachability defined above.

3.3.2. Local Consensus

In this part, we expect to provide some analysis conducive to answering question 2 (in the Discussion), which requires us to search for the numerical conditions of local consensus. Based on the mechanism obtained by the above results, we recognize the effect of u/d/d*/k on consensus, which can be briefly summarized as assimilation (u), reachability (d and d*), and homogenization (k). Among the three effects, u mainly affects the final result of opinion formation through symbols, and k is not necessary for global consensus (such as k = 0 in Figure 3a); only the absolute values of d and d* play a crucial role in consensus states (global or local). Therefore, we can focus on exploring the effects of d and d * in this section to answer question 2 (local consensus) and probe the influence of k after this exploration.
For the purpose of understanding the relationship between d/d* and local consensus, we can still examine the pertinent experimental results shown in Figure 5a–d in the previous part. It indicates that when given d = 0.4 and d* = 5, both d* and d exhibit minimal impact on the frequency of synchronization as they decrease from higher values (e.g., 0.6/7) to 0.5/6. However, when they decrease further from 0.5/6, the synchronization frequency becomes more sensitive to these changes. Therefore, we hypothesize that beyond a specific threshold for d or d*, multiple “bifurcation points” emerge (a threshold), which may result in a “truncation phenomenon”: When the parameter value surpasses this threshold, the system may only achieve n kinds of local consensus (where n = 1 represents the global consensus). Conversely, when the value falls below this threshold, it has n + 1 kinds of local consensus, just like a truncation of the consensus formation process, which is regarded as a bifurcation in the field of dynamical systems. Specifically, when an individual’s d * or d is less than the ‘bifurcation point’, they are unable to effectively assimilate individuals with significant differences in their own opinions/social distances (xi (t) and xj (t) with significant differences cannot approach each other), resulting in the inability to further narrow down opinions with significant differences. This supposition forms the crux of answering questions 2-1 and 2-2. Hence, we will employ diverse parameter combinations of d/d* in subsequent analyses to experimentally investigate the number of local consensuses.
To investigate the “bifurcation points” and truncation properties of d and d* separately, we meticulously control each of the two parameters in isolation. The specific methodology is elucidated in the figure annotations below. Based on Figure 6a–i, under a fixed d value, the system exhibits remarkable stability across varying d*. However, the count of consensus occurrences still exhibits a dependency on the network average degree. In contrast, as illustrated in Figure 6j–l, with a fixed d*, the system demonstrates a pronounced sensitivity to perturbations in d. Even a modest change of 0.2 can yield significant disparities in the number of consensus categories, such as the conspicuous transition from a global consensus to 2~3 kinds of local consensuses around d = 0.5. Generally speaking, if the value of d(or d*) is fixed, the other parameter d*(or d) will have some bifurcation points transforming n kinds of consensus into n + 1 kinds of consensus.
After elucidating the primary causal factor, namely “truncation” from the values of d and d*, contributing to the emergence of “local consensus, “we can delve into the meditative effect from group pressure coefficient k to the opinion formation outcomes. We control the values of u/d/d* and vary the k, to obtain the simulation results visualized in Figure 7a,b. These figures offer an intuitive depiction of such characteristics: while a global consensus is observed when the parameter combination of (u, d, d*) is set as k = 0.3, reducing the group pressure coefficient (k = 0.1) can lead to an increase in the number of consensus instances, amounting to three, thereby emerging as a crucial property within the model. This is the homogenization mentioned earlier, and it means that k can help the system reach global consensus when it may lead to local consensus with no homogenization effect (k = 0), and vice versa.
Overall, when u > 0 and values of d/d* representing confidence/social reachability are decreasing in the opinion system, it may truncate the original consensus formation, giving rise to more kinds of local consensus. Additionally, a small value of k can retain the local consensus, hindering it from changing into the global consensus.

3.3.3. Chaos Phenomenon

After obtaining some results about questions 1 and 2, we will explore the chaos described in questions 3-1 and 3-2 in this section and deeply excavate them in the Discussion. For question 3, theorem 3 states that under the restriction of a connected graph, if F is an expanding map (showing that people’s opinions are mutually exclusive and distant in the communication), opinions will exhibit chaos, and consensus becomes unachievable. Simulation results further support this conclusion. Figure 6a demonstrates that when the assimilation mechanism shifts towards exclusion (from u > 0 to u < 0) while maintaining strong social and confidence reachability, the system exhibits chaos within a specific range.
To investigate this phenomenon further, we can set the experimental parameters u to −0.3, −0.99, and 1.1, respectively, while controlling the other parameters. It is worth noting that we need to set sufficient reachability (d/d*) to enable effective communication between individuals. By comparing Figure 8a–f, we observe that for −1 < u < 0, the chaotic region expands as the absolute value of u increases (in the context of relatively large d/d*). In other words, when reachability is high, a larger absolute value of u can cause more people’s opinions to enter complex and repetitive fluctuations. This may illustrate the positive correlation between u (the social exclusion rate) and the level of chaos.
However, in the case where u is less than −1 and deviates significantly (e.g., −1.2), an intriguing phenomenon may arise within the system, known as “polarization”, as depicted in Figure 9a,b. Due to the bounded nature of opinions, a peculiar “pseudo convergence” manifests, setting it apart from the local consensus of N (consensus) = 2 discussed before. This distinction is apparent: when the number of local consensus categories is two, the constrained reachability (d/d*) results in the global consensus formation process being truncated, ultimately reaching a stable and convergent state. Meanwhile, the magnitude of the final opinion range is evidently smaller than that of the initial values, indicating a propensity towards assimilation and homogenization of individual opinions (namely, maxxi(t)-minxi(t) < maxxi(0)-minxi(0)). But in the figures below, the “social exclusion” mechanism (u < −1) engenders a growing disparity among individuals with divergent opinions, leading to an expanding range of opinions over time, culminating in convergence values situated at the upper and lower bounds of the opinion spectrum. This may serve as a concise explanation for the polarization of opinions in reality, which needs to be discussed in the following section.
Finally, for the sake of ensuring consistency between our model and the real world, it becomes imperative to utilize the heterogeneous dynamic models mentioned in the experiment design to simulate opinion evolution. In order to explicate evolutionary patterns of the opinion system with multiple ui/di, we set different values of p (representing the ratio of repulsors whose ui < 0) to apprehend the influence of disparate ui/di distributions on synchronization. The outcomes are elucidated in Figure 10a–l. It is noteworthy that irrespective of whether the value of d is 0.2/0.4 or 0.6, the presence of “repulsors” with a ratio of 0.1 in the system (i.e., ui < 0) significantly disrupts the convergence of the model, resulting in the phenomenon of “chaos”. According to subsequent investigations, this characteristic persists even when the proportion of repulsors is 0.01, which may suggest a small perturbation to assimilation that also possesses the capability to entirely subvert the existing (local/global) synchronization mechanism.
To sum up, in the homogeneous model, repulsors with u < 0 and a relatively high level of reachability will cause chaos, and the area of opinion chaos is positively correlated with the absolute value of u within a certain range. However, when u < 0 and deviates from −1, the system may experience polarization. In heterogeneous models, a very small proportion (such as p = 0.01) of repulsors (ui < 0) can disrupt assimilation and generate chaos. These results are worth integrating with the previous results in the discussion to form a theoretical answer to question 3.

4. Discussions: Ideal Synchronization Theory

4.1. Overview

Drawing upon the conclusions from theorems and simulation results (used for solving problem B), we are capable of establishing an integrative explanation for questions 1/2/3, named after ‘ideal synchronization theory’, which is also a general solution to problem B. The theory can be divided into the main part and the supplementary conclusions: the former focuses on providing sufficient conditions for consensus and chaos based on micro-mechanisms like assimilation and reachability (in the ideal context), as a direct answer to our questions; the latter exhibits some factors facilitating or hindering the consensus formation, whose context is more similar to the real world (such as the heterogeneous ui). We’ll first illustrate the main part of our theory below, which is comprised of discussions about global consensus, local consensus, and chaos, respectively.

4.2. Main Part

As for global consensus (question 1), two conditions should be taken into consideration, which are ‘assimilation’ and ‘reachability’: (1) In regard to assimilation, from the theorem 1 in Section 2.3 and the simulation result shown by Figure 2, Figure 3, Figure 5 and Figure 8 in Section 3.3.1 and Section 3.3.3, we regard the feature (u > 0) as essential for synchronization since few repulsors can turn consensus into chaos (which is not a convergent state). However, the level of assimilation (the absolute value of u) may just influence the rate of convergence, which does not have strict restrictions. (2) With respect to reachability, it encompasses “Social reachability” and “confidence reachability”, respectively representing the possibility of “contact” (access to other people’s information) and “interaction” (communicating with other people for updating the opinion). Based on the results in Figure 2, a high level of reachability (value of d/d*) can facilitate an effective interaction among agents, ensuring the outcome of global consensus. Specifically, when there is assimilation between agents, agents can first contact enough other people’s opinions through high social reachability (d* represents the number of friends they can reach), and then because of high confidence reachability, after the contact, they can communicate with more people who have large opinions’ differences with them (d represents acceptable differences in opinions), resulting in mutual proximity of their opinions. This process will continue to repeat itself over a long period of time to achieve consistency of opinion among a large number of individuals and promote consensus. In brief, the answer to question 1 is “assimilation mechanism” and “high reachability” (both social reachability and confidence reachability). This answer will be noted as A1 below.
Concerning the local consensus (question 2), we should respectively reply to questions 2-1/2-2. For 2-1, the assimilation feature (u > 0) is still vital for local consensus arising from its capacity for convergence, which is the same reason for the discussion on global consensus. However, according to the results presented by Theorem 2 in Section 2.3 and Figure 6 in Section 3.3.2, one of low reachability (small values of d or d*) should keep in the opinion evolution to sustain the divergent kinds of local consensus. Therefore, the answer to 2-1 is “assimilation mechanism” and “low reachability” (social reachability or confidence reachability). This answer will be noted as A2 below.
And for 2-2, we discover a phenomenon called “truncation” in Figure 6 in Section 3.3.2, which represents the process from local consensus to global consensus being “truncated”. Generated by the reachability from high level to low level, the phenomena reflect the contact block (low social reachability) and the interaction block (low confidence reachability) among people in different areas of the social network, which is one of the core mechanisms hindering local consensus from global consensus. In other words, when the reachability of most individuals is insufficient, they only communicate with people within their social neighborhood (d*) or those with similar opinions (d), resulting in opinion clusters and triggering local consensus. Moreover, from Figure 7 in Section 3.3.2, we can elucidate the correlation between the homogenization effect (pressure coefficient k) and local consensus: if the former is small, it can be a “maintenance mechanism” for the latter. The small homogenization effect (small value of k) encompasses two distinct aspects: (1) during the initial stages of opinion formation (before convergence), it lacks the requisite resistance against the process of “truncation” caused by low reachability; (2) during the later stages of opinion formation (after convergence), it serves as a “sustaining condition” for the enduring existence of local consensus. We will discuss these two points separately in the following text:
(1)
Regarding the first aspect, when the value of k is small, even if the noise (i, j, t) is substantial (indicating pronounced out-group pressure/low in-group cohesion), the pressure perceived by individual i, denoted as k*noi(i, j, t), remains insufficient to align his opinion with the global average opinion. Therefore, in the early stages of opinion evolution, under the limitations of low reachability (truncation), individuals are unable to communicate with a sufficient number of people, and due to the low-pressure coefficient k, they cannot fully adopt the majority opinion or the average opinion in the network. This results in a large number of individuals only assimilating with people within their social neighborhood or people who are similar to their own opinions (d/d * limitation) for a long time, causing multiple local consensuses within the system.
(2)
As for the second aspect, due to the regulation of cohesion (approaching | xi xj | ≈ 0), group pressure perceived by people is too small to foster consensus formation, thus upholding the prevailing local consensus. This is consistent with the principle of the first aspect, which states that individuals do not consider the average opinion (representing the majority) when there are few people communicating, but the reason for it is that due to the enhanced in-group cohesion, individuals fall into group blindness and no longer accept people from the out-group.
(3)
These two aspects can be termed the “cocoon room mechanism”, encapsulating the shielding effect of external information and the external group influence. In conclusion, the answer to questions 2-2 includes the “truncation” caused by low reachability and the “cocoon room mechanism” (high cocoon room effect means low homogenization represented by pressure coefficient k). This answer will be noted as A2* below.
In regard to chaos (question 3), questions 3-1 and 3-2 should be answered as a whole: From Figure 8 and the analysis of these results, a sufficient level of reachability (d) and the exclusion effect (u < 0) are core conditions leading to the opinion chaos, which constitutes the answer to question 3-1. Meanwhile, this condition is intertwined with a typical mechanism: When individuals exhibit a rejection attitude towards the opinions of others, the contact/interaction facilitated by social/confidence reachability can cause people’s opinions to become distant from each other, leading to opinion chaos, which can be named an “exclusion mechanism”. This is because when individuals are mutually exclusive (such as in arguments), the opinions of the communicator will gradually become distant and unable to converge. At the same time, due to the large number of individuals in the system, their opinions will repeatedly change due to the exclusion of others (such as turning right due to the exclusion of the left-wing people in the previous moment/turning left due to the exclusion of the right-wing people in the later moment), ultimately resulting in complex fluctuations. Generally speaking, the conditions of social exclusion (u < 0)/high reachability (large d and d*) and the “exclusion mechanism” can answer questions 3-1 and 3-2, respectively. This answer will be noted as A3/A3* below.
Based on the aforementioned conclusions, we can synthesize the answers to questions 1/2/3 (A1/A2/A2*/A3/A3*) and provide a coherent conceptual framework constituting the core contents of “ideal synchronization theory”. The framework encompasses three fundamental dimensions, namely “assimilation-exclusion” (designated as A-E), “high reachability-low reachability” (designated as H-L), and “the level of cocoon house effect” (designated as the level of C). Concerning A-E and H-L, the ensuing deductions can be drawn: when the system has the features of A and H, the global consensus can be achieved (A1); when it has the features of A and L, it engenders a local consensus (A2); when it contains the features of E and H, the emergence of chaos becomes feasible (A3 and A3*); when it consists of E and L, the system manifests more intricate and incongruous phenomena (which do not belong to the questions of our paper). As for C, if the level of C is low, the system can transform local consensus into global consensus by preventing truncation phenomena, but if the level of C is high, it is not capable of doing so (A2*). These conclusions can be effectively summarized in the Table 1 below:

4.3. Supplementary Conclusions

In addition to the main framework mentioned above, the ideal synchronization theory also includes some supplementary conclusions that are closer to the real world (and therefore deviate from the ideal scenario). These conclusions are still related to global consensus/local consensus/chaos, so they can be discussed separately from these three aspects.
As far as the global consensus is concerned, we find that according to Figure 4 and its analysis, when the level of assimilation is high (the social learning rate u is high), the rate of convergence of opinions in the system is fast. This conclusion is essential: since the evolution of opinions in the real world is limited by attention to specific issues and often only includes limited updates, the rate of convergence will determine whether consensus can be reached at last. In the general model proposed in our paper, this conclusion depends on subsequent proof.
In terms of local consensus, we find that according to Figure 6 and its analysis, both “social reachability d*” and “confidence reachability d” have bifurcation points, and small perturbations around this point can change the final outcome of opinion evolution. Therefore, we need to deeply study the bifurcation theory of stochastic dynamical systems and apply the pertinent results to the study of this problem.
As far as chaos is concerned, we have made two interesting discoveries: (1) According to Figure 9, in the homogeneous model, when the absolute value of the social exclusion rate is too large (for example, u = −1.2), the opinions will eventually become polarized and lie at the upper and lower bounds of the value range, which may explain the political polarization, which shows the “pseudo convergence” aforementioned; (2) According to Figure 10, in the heterogeneous model, a small proportion of repulsors can destroy consensus and lead to chaos, which may explain the destructive effect of some social robots and the “troll” (with exclusiveness) on public discussion.
In summary, the above conclusions are novel discoveries brought about by the general model proposed in our paper. Although they have not yet been rigorously theorized, they can demonstrate the explanatory power of the model and are expected to be further explored.

5. Validation: Verifying the Theory with Real Data

5.1. Overview

In the above, we have established a general model to describe the evolution of ordered opinions (solving problem A). Through mathematical proof and simulation, we obtain the microscopic conditions leading to consensus/chaos (solving problem B), thus providing answers to questions 1/2/3. However, the above conclusions are theoretical and have not yet established a connection with the real world. Therefore, we should transition to solving problem C in this section, which requires us to estimate and test the model through real data (from social media) in order to verify the reliability of the model and ideal synchronization theory. It is worth noting that we will adopt the model conditions in simulation to carry out our validation, which satisfies “uij = u” (the homogeneous model) or “uij = ui” (the heterogeneous model) for any agent i/agent j, and the probability P (i interacts with j) = 0.5 when j belongs to Nit∩Ni, but the network is directly from our data and not a small-world network in the simulation.

5.2. Data Description

The dataset utilized in this article is sourced from the Harvard Dataverse, which served as the empirical foundation for the study titled “Opinion Dynamics of Online Social Network Users: A Micro Level Analysis” [47]. This dataset, collected from VKontakte, the preeminent social media platform in Russia, can be delineated into two fundamental components: (1) the network of friendships among users on the platform, and (2) the corresponding opinion values of users three times. Concerning the former, the dataset provider employed the networkx library in Python to extract the largest connected component within the network, which forms the central focus of our research. About the latter, the opinion values were generated through a collaborative process involving the annotation of texts and semi-supervised learning techniques. These values can be categorized into five distinct political stances, delineated by the intervals [0, 0.2)…[0.8, 1], thereby representing a continuum ranging from strong liberals to strong conservatives in ideologies. Consequently, this dataset serves as a valuable resource for subsequent statistical inferences and offers substantial support for our study.

5.3. Inference Methods

5.3.1. Validation and Estimation

To validate our opinion model based on the data mentioned above, we should use a reliable and universally applicable statistical method. In this regard, we integrate the Bayesian approach with non-parametric estimation to derive a comprehensive framework. The overall procedure is as follows [37]: (1) employing approximate Bayesian computation (ABC), we generate a posterior distribution sample of parameters (ui/di/ki) by leveraging both real data and model simulation outcomes; (2) utilizing kernel density estimation, we smooth the empirical distribution of parameters into a posterior density function; and (3) employing Markov Chain Monte Carlo (MCMC) [48] and other techniques, we compute various integrals of the density function to obtain posterior estimates and test results for the parameters, thereby accomplishing the inference task. The detailed methods are presented in Appendix C.

5.3.2. Fitting and Testing

Based on the aforementioned estimation method, we can utilize the data to acquire the values of ui/di/ki and subsequently generate multiple simulation samples. In order to test whether the estimated model is sufficiently consistent with the real data (thereby reflecting the ability of the theoretical framework to match real-world phenomena), we initially compute indicators such as the accuracy of the simulation results. This serves as a preliminary examination to determine the alignment between the simulated data and the social media data.
Simultaneously, to further establish the adequacy of the “simulation model” in comparison to the “real model”, we can approach it by assessing the congruity between the simulation rule F and the real evolution rule T in terms of their distributions (mentioned in Section 1.3 as a difficult problem). For this purpose, we have presented an exploratory methodology, shown as follows: (1) Assuming that the genuine evolutionary rule T can be characterized as a stochastic linear operator [49], then F and T (Due to the fact that in the model, individual i randomly selects others to engage in conversations (which is consistent with the randomness of daily communication), we consider F and T as two stochastic rules) can be viewed as two finite-dimensional matrices under the event wt (namely, F(w) and T(w) are two matrices and also two n2-dimensional random vectors); (2) Employing numerical simulation, sampling T and F to obtain two sets of random samples denoted as F(w) and T(w). (3) By utilizing the extended Cramé-von Mises metric [50], we determine whether these two samples are in the same distribution. The detailed procedures for these specific methods are also provided in Appendix C.

5.4. Results and Analysis

5.4.1. Parameter Estimation and Fitting

Based on the aforementioned methodology, we employed the network data and opinion data discussed earlier to estimate the parameters. In order to strike a balance between interpretability and predictability, we conducted estimations for both homogeneous and heterogeneous models. The former solely incorporates three parameters, namely u/d/k, which offer insights into the overall magnitude of the social learning rate, confidence threshold, and group pressure in the real world. The latter entails 3 * |V| parameters, enabling a closer alignment with the underlying reality and serving as a reliable predictor of opinion trends. The subsequent table provides the estimated values for the models, along with an assessment of the discrepancy between the predicted and actual data resulting from this parameter estimation.
From the analysis of Table 2 and Figure 11, we obtain a remarkable finding. Even in the case of a homogeneous model encompassing only three parameters, it exhibits superior performance in fitting the real data. The accuracy of political stance prediction almost reaches an impressive 0.9, with virtually no predicted values deviating from the actual values by more than 0.2. This observation, supported by Bayesian factors derived from Table 2 and parameters of the homogeneous model, highlights a key insight regarding the dataset under examination in this study: The social learning rate (u) appears to be approximately twice the group pressure coefficient (k), indicating the fundamental role played by the “bounded confidence mechanism” in opinion evolution. Furthermore, the confidence threshold for individual interactions hovers around 0.2/0.1, suggesting that, on average, individuals primarily engage with others who share a similar political stance. In conclusion, these results collectively endorse the integration of the bounded confidence mechanism, the group pressure mechanism, and cohesion within the model as a robust framework for generating existing data, thereby empirically affirming the effectiveness of previous theoretical analyses.

5.4.2. Distribution Test

Although the congruity between the simulation model and actual data has been validated in the preceding section, given that both data are subject to stochastic errors and unobservable attributes, it becomes imperative to ascertain that the simulation sequence {x * (t)}, generated by function F, conforms to the same distribution as the real-world opinion sequence {x (t)}, in order to further substantiate the validity of our theory. Initially, utilizing the acquired parameters, we conduct 20 simulations, wherein the following analysis is performed between these 20 “simulation samples” and the real samples. Consequently, two types of visually descriptive representations are constructed: (1) a scatter/density chart in Figure 12 depicting the relationship between real opinions and simulation opinions; (2) density plots and histograms in Figure 12 portraying the disparity between “real opinions” and “simulation opinions”. In relation to (1), the greater their proximity to the y = x line, the more akin their empirical distributions become; in regard to (2), deductions can be directly inferred through a comparative assessment of the deviations in density curves. The aforementioned figures unequivocally demonstrate that both (1) and (2) exhibit concurrence between the simulation and real samples, thereby offering preliminary validation of our model/theory and parameter estimation.
Concurrently, in accordance with the test method outlined in Appendix C, we generate a sampling frame for F and T, employing random sampling techniques to extract 50 samples. This process yielded two high-dimensional samples, respectively, derived from the population of stochastic operators: F(w) and T(w) [49], which were applied for the test to determine whether F and T are equally distributed. The results of our test are meticulously documented in Table 3 (T1 and T2 are “the rule from x(0) to x(1) “and “the rule from x(1) to x(2)”, respectively). It is discernible from the results that both F and T emanate from the same distribution because of the large p value (which cannot refute the null hypothesis of the same distribution between F and T), thereby attesting to the veracity of the model rules expounded in our paper. Additionally, leveraging Proposition 4 in Appendix C, we can further deduce the congruity between the simulation model and the real rule: the test results in Table 3 can also ensure that our model can obtain data identically distributed with real data because the simulation rule F* has the same distribution as the real rule.

6. Conclusions and Prospects

6.1. Conclusions

In this paper, we present some theorems and simulation results related to global consensus/local consensus/chaos for answering questions 1/2/3, which are integrated into the “ideal synchronization theory”. It includes the following key conclusions: (1) The opinion formation consists of several fundamental mechanisms, namely assimilation/exclusion, social/confidence reachability, and the “cocoon room” effect, representing “a mutual approach of opinions after an interaction” (social learning rates and exclusion rates), “possibility of contact/interaction” (confidence thresholds and average network degree), and “effect of shielding group pressure” (inversely correlated with the pressure coefficient k); (2) Assimilation and high reachability lead to global consensus, assimilation and low reachability result in local consensus, and exclusion and high reachability lead to chaos; (3) A higher “cocoon room” effect can maintain the local consensus. Among them, the laws related to local consensus/chaos in (2) and (3) are the core conclusions discovered in a novel way in our paper, and more detailed contents are presented in the section of Results and Discussions, such as the impact of social reachability/the network average degree on consensus. Additionally, we have made some new discoveries that require further exploration, such as the positive correlation between social learning rate u and convergence rate, the bifurcation caused by confidence thresholds d and network average degree d*, the polarization of opinions caused by strong social exclusion (e.g., u = −1.2), and the disruptive effect of a small number of repulsors on consensus. These conclusions above are the main sociological and physical contributions of our paper.
Moreover, to address questions 1/2/3 and solve problems A/B/C, we have developed new formal methods, including the “General Model of Opinion Evolution” (a stochastic dynamical system), the proof methods of “energy decrease” and “cross-d search” (applicable to a large number of averaging dynamics), and high-dimensional statistical tests on the evolution rules of the models (to verify the consistency between the ABM models and the real world). The three theorems in this paper also serve as proofs of synchronization and chaos in models like D-W and H-K. These contents further develop and confirm the aforementioned ideal synchronization theory but belong to the mathematical and statistical contributions of our paper, mainly presented in Appendix A, Appendix B and Appendix C.

6.2. Prospect

Based on the aforementioned conclusions, a comprehensive framework can be devised to elucidate the evolution of large-scale, ordered opinions. Nevertheless, within the framework, there remain several internal concerns (which do not require us to modify our model) and external problems (which require us to modify the model), which necessitate future consideration. We will briefly illustrate them below.
For internal concerns, three distinct avenues merit exploration: (1) establishing theorems about synchronization (global/local consensus) under weaker conditions like connected graphs and asymmetric interactions, thereby constituting the refinement and generalization of theorems 1/2/3 in our paper; (2) conducting a reliable analysis of the bifurcation in our model, as evidenced by numerous simulation results, such as researching bifurcation points of the threshold ‘d’ when given values of ‘u’ and ‘d*’, thereby further enriching the ideal synchronization theory; (3) studying the opinion convergence rate within the model, serving to elucidating the speed of real-world opinion formation.
For external problems, while our model possesses considerable validity, there is room for enhancing its capacity for explanation. For this issue, engaging in a dialogue with pertinent social theories becomes imperative. Firstly, at the individual level, it is worthwhile to emphasize the differentiation between implicit cognition and explicit behavior. To address this, future investigations may incorporate variables that represent “private opinions/expressed opinions” discretely within the model, thereby elucidating the disparity between “attitude learning” (ideas change when influenced by others) and the “spiral of silence” (submission to external pressures). Secondly, at the system level, the framework fails to encompass more intricate external variables such as socioeconomic status, culture, and semantic networks. Although the effects of such variables can be amalgamated through the internal evolutionary attributes of opinions, bolstering a more imaginative explanation of opinion evolution, it remains important to explicate them effectively. Therefore, establishing the relationship between the opinion system and other systems emerges as a pivotal endeavor to be explored in subsequent research. Overall, addressing the external problems of our framework necessitates a comprehensive integration of existing knowledge and tools from cognitive science, social theory, and nonlinear mathematics, thereby facilitating the promotion of rigorous theoretical construction.

Author Contributions

F.D.: Conducted literature review, mechanism exploration, axiomatized modeling, theorem proving, simulation, and empirical testing. Y.L.: Conducted literature review, simulation experiments, and participated in multiple revisions and discussions on the paper’s ideas. K.D.: Provided guidance on writing and editing the article. All authors have read and agreed to the published version of the manuscript.

Funding

This research and the APC was funded by National Undergraduate Training Programs for Innovation and Entrepreneurship. The funder is East China University of Science and Technology and the funding number is 10000 RMB.

Institutional Review Board Statement

The study was conducted in accordance with the Declaration of Helsinki, and approved by the Institutional Review Board (or Ethics Committee) of East China University of Science and Technology (protocol code 200030 and date 6 August 2023).

Data Availability Statement

Our data can be obtained from the link https://dataverse.harvard.edu/dataset.xhtml?persistentId=doi:10.7910/DVN/H3ZBHR, (accessed on 15 June 2023).

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A. Strict Definitions and Theorems

Appendix A.1. Axiomatic Framework

The axiomatic framework of our model encompasses four fundamental constituents: opinion space X, social network G, an interaction event is set Ω, and the evolution rule F. Among these, X denotes the domain of admissible values for an agent’s opinion, xi. G quantifies the “influence sphere of agent i”, encompassing all agents j with whom i has the capacity to contact. Ω serves as an indicator of whether an interaction between i and j will occur subsequent to contact. F delineates the rules governing the evolution of group opinions following an interaction event w. This framework can be applied to stochastic dynamics on various social networks, providing a comprehensive methodology for modeling opinion evolution. Based on this framework, we can establish our opinion dynamics model as a quadruple (X, G, Ω, F).

Appendix A.2. Notations

This article employs the following symbols, each serving a distinct purpose: capital letters V, E, Ω, and X, among others, are employed to denote sets; lowercase letters vi, ei, w, and xi are utilized to represent elements within a set; distinguished characters like F, G, f, and g are used to signify mappings, encompassing functions and stochastic operators. The latter notion is elaborated upon in reference [49]. Furthermore, P/m/u are employed as notational symbols denoting set functions, specifically probability measure/Lebesgue measure/abstract measure. Meanwhile, we adhere to the customary conventions, including: (1) The employment of the conjunction: “≜” or the symbol “≜” itself to denote definitions. (2) Standard operations, such as “~denotes the relation on a set, × signifies the product entity of a set/topological space/probability space within the realm of category theory, ∑ represents the summation operation, / signifies the division of real numbers or the quotient operation of a set, | • | denotes the absolute value or the cardinality of a set with respect to the given context, || • || signifies the L2 norm of a space”. (3) Exceptional operations: for instance, limsup/liminf denote the supremum and infimum limits of a set”, IIA(x) is the characteristic of the set A, and h(f) represents the topological entropy of the mapping f. (4) The domain concepts can be defined as follows: Kn signifies a complete graph comprising n nodes, while Ω (x0) signifies the positive limit set of x0. In this context, we solely present the symbols and their corresponding meanings that may entail ambiguity (symbols with self-evident meanings, such as multiplication • or composite °, are omitted). These symbols adhere to the established conventions in mathematical literature. The novel symbols introduced in this paper will be elucidated and expounded upon in subsequent definitions.

Appendix A.3. Definitions

Definition A1.
Let the actor set be  V = v 1 , . , v n , the binary relationship set be   E ( V × V ) / ~ , and the actor-network be G = ( V , E ) . (Inside, ~ is defined as  ( x , y ) ~ ( y , x ) ; let the element of E be written as eij,  e i j = [ v i , v j ] = v i , v j , which is the equivalence class under the relationship ~, briefly written as {i, j}/[i, j]).
Remark A1.
G denotes the “social network” among individuals, such as a “friendship network” or a “mutual following network”; V represents all individuals, where “vi represents individual i”; E represents a certain form of mutual connection or friendship between individuals, such as “eij represents the mutual attention between i and j”.
Definition A2.
Let the interaction event set be  Ω t = [ i , j ] V × V / ~ ( R \ { 0 } ) , thus  Ω t , B Ω t , P  constitutes a probability space. Inside,  B Ω t  represents the Borel algebra of  Ω t . The topology of  Ω t  is the sub-topology of  R n ( n + 1 ) 2 , and  P  is a probability measure on  Ω t . Let  Ω = t = 0 Ω t , ( Ω , B ( Ω ) , P )  be the product probability space induced by  { Ω t } t I  (w    Ω ), wt    Ω t , and the component of wt is abbreviated as  w t ( i , j ) .
Remark A2.
In Ωt, wt signifies the “interactions that occur at time t”, specifically wt = {wij: i and j are any two individuals in the social network}—where wij represents the interaction strength between individual i and individual j at time t. If wij is greater than 0, it indicates an interaction between i and j at time t, while if wij is less than 0, it implies no interaction between them at time t. Additionally, wt is a random event, meaning that “whether i/j interact or not” at time t is subject to randomness.
Definition A3.
Let    Inter ij   w t = 1 , w t ( i , j ) > 0 0 , w t ( i , j ) 0 , which is a random variable (obviously a measurable mapping).
Remark A3.
Interij(wt) denotes “the interaction between individuals i and j under the random event wt”. It takes a value of 1 if i and j interact, and 0 otherwise.
Definition A4 (Framework and Model).
 
Part A: General Framework
I. Stochastic Dynamics
(X, G, H, T) is a stochastic dynamic, if ①  X  is a topological space, ② G is a graph, ③  H  is a probability space, ④  T  is a  H  measurable (or  H × X measurable ) stochastic operator, and ⑤  ω H  (or   ω H × X ) and  T ( ω )  is continuous on  X .
Remark A4.
This definition extends the definition of topological dynamical systems. According to the definition in this paper, X represents the range of opinions, and a state (x1…xn) is taken from X, representing the initial opinions of all individuals. This state continually evolves under the influence of the rule T(w), where w denotes randomly occurring interaction events, thereby capturing the evolution process of the collective opinions.
II. Evolution Model
(1) Rules
Let F : Ω B [ 0 , 1 ] n , [ 0 , 1 ] n is a stochastic operator [49], x [ 0 , 1 ] n ,   u ij [ 1 , 1 ] , and [ F ( ω ) ( x ) ] ( i ) : 0 , F ˜ ( ω ) x < 0 F ˜ ( ω ) x , 0 F ˜ ( ω ) x 1 1 ,   F ˜ ( ω ) x 1
The original rule
F ˜ ω k x ( i ) : II [ 1 , + ] j N ( i , t , ω ) Inter ij ω k [ f ( ω ) x ] i + II ( , 1 ) j Inter ij ω k x j f ( ω ) x i : 1 j u i j / N ( i , t , ω ) x i + 1 N ( i , t , ω ) ( i , j ) E ( t ) u i j x j Inter ij ( ω ) II E v i , v j + noi ( i , j , t + 1 ) j
The alternative rule
F ˜ ω t x ( i ) : II [ 1 , + ] j N ( i , t , ω ) Inter ij ω t N i , t , ω , x 0 f ω t x i + II ( , 1 ) j Inter ij ( ω t ) N i , t , ω , x 0 x ( i )
f ( ω t ) ( x ) i : 1 j u i j / N ( i , t , ω ) x i + 1 N ( i , t , ω ) ( i , j ) E ( t ) u i j x j Inter ij ( ω t ) II ( 0 , d i ) x i x j II E v i , v j + n o i ( i , j , t + 1 )
Given graph G, let S [ 0 , 1 ] n , Ω , F . It is easy to verify that S is a stochastic dynamic, namely the ‘opinion dynamic’.
Remark A5.
(1)
Let the opinion space X be a bounded set [0, 1]n. The image set of the rule F is also [0, 1]n, in order to meet the measurement requirements of ordered perspectives (most datasets map them to real values within 0–1). The mathematical definition of noi(i, j, t + 1) can be found in the following text.
(2)
The framework includes three important parameters: d represents the confidence threshold, and i and j can interact only if the difference in their opinions is below the threshold; uij represents the social learning rate of i from j, that is, the influence of j’s opinion on i’s opinion; and ki represents the compression coefficient of i, indicating the degree to which individual i perceives group pressure. There is also an important variable: N(i, t, x0, w) represents “all individuals j interacting with individual i at time t given the initial opinions x0 and the sequence of interaction events w”.
(3)
The fundamental meaning of the above framework is that at any given time t, there exist two categories of individuals: non-participants (referred to as NP) and participants (referred to as P). The criterion for determining whether an individual j belongs to NP or P is based on whether there exists an i in the random event wk who interacts with j, that is, whether the value of Interij(wk) is zero. Based on this criterion, the opinions of individuals in NP remain unchanged, while the opinions of individuals in P are influenced by three levels: (1) their existing perspective xi, (2) the weighted average of the opinions xj of all individuals interacting with them, and (3) the average opinion of the system (noise/group pressure). Among them, the parameter uij reflects the social influence effect, and the parameter di represents the influence of bounded confidence.
(4)
The difference between the alternative rule and the original rule lies in the fact that when the difference in opinions between individuals i and j is greater than d, under the original rule, the probability of an interaction between i and j is 0, while under the alternative rule, i and j will not interact.
(2) Symbols
Given S , x 0 [ 0 , 1 ] n , ω i = 1 Ω t , let
x t + 1 , x 0 , ω : F ω t x t , x 0 , ω
x i t , x 0 , ω : x t , x 0 , ω [ i ]
noi :   [ 0 , 1 ] n × [ 0 , 1 ] n × N [ 0 , 1 ] is measurable
( Given   x 0 X , w H , stochastic   operator   T ) ,
Inside, t N and given x ( 0 ) and ω , x t , x 0 , ω , x i t , X 0 , ω can be written as x ( t ) , x i ( t ) .
III. Probability measure
Given x 0 [ 0 , 1 ] n , for ( Ω , B ( Ω ) , P ) , P P x 0 should satisfy
The original rule
P x 0 w : w t i j > 0 and x i ( t ) x j ( t ) max ( d i ( t ) , d j ( t ) ) = 0 P x 0 w : if   x i ( t ) x j ( t ) < max ( d i ( t ) , d j ( t ) ) , then   w t i j > 0 > 0
d i ( t ) : N [ 0 , 1 ] l 2 , it can be represented as d i ( 0 ) d i ( n )
The alternative rule
P x 0 w : w t i j > 0 and x i ( t ) x j ( t ) max ( d i ( t ) , d j ( t ) ) = 0 P x 0 w : if   x i ( t ) x j ( t ) < max ( d i ( t ) , d j ( t ) ) , then   w t i j > 0 > 0
which is the same as the original rule.
Part B: Usual Model
M 1 (The symmetric/multiple-interaction/heterogeneous model)
P j Inter ij ( w t ) 1 = 1 and Inter ij ( w t ) = Inter ji ( w t ) ;
i   ,   degree   v i = n 1 , d i max x i ( 0 ) min x i ( 0 ) ;
d i ( t ) = d i [ 0 , 1 ] ;
i , [ 0 , 1 ] u i j = u j i > 0 ;
n o i ( i , j , t ) = Pr e s s ( i , j , t )
L e t   Pr e s s ( i , j , 0 ) = 0 , Pr e s s ( i , j , t + 1 ) = k | x i ( t ) x j ( t ) | 1 n x i ( t ) x i ( t ) + x j ( t ) 2 .
M 2 (The symmetric/multiple-interaction/homogeneous model)
①’
same with M 1 ;
②’
G = K n ;
③’
d i ( t ) = d [ 0 , 1 ] ;
④’
i , u i = u [ 0 , 1 ] ;
⑤’
i , k i = 0 .
M 3 (asymmetric/multiple-interaction)
①”
G is a connected graph;
②”
i, di d = 1;
③”
i , k i = 0
Remark A6.
(1)
M1 implies that there exists an agent vi in the system who frequently interacts with any other agent, and these individuals are influenced by external group pressure and internal cohesion during interactions.
(2)
M2 implies that the system is entirely determined by the “bounded confidence mechanism”, and agents are not influenced by the external group during interactions. This is a generalization of many existing bounded confidence models (including the D-W model).
(3)
M3 implies that the system’s rules, once fixed, can combine social influence with the French-Degroot model.
Definition A5.
E ( t ) = E t , w , x 0 = ( v i , v j ) : | x i ( t ) x j ( t ) | < d , V ( t ) = V t , w , x 0 = v i V : v j , v i , v j E ( t ) , G ( t ) = ( V ( t ) , E ( t ) ) .
Remark A7.
V(t) represents the individuals at time t who are capable of potential interactions; E(t) represents the relationships formed by pairs (i, j) of individuals who are capable of potential interactions at time t; and G(t) represents the network composed of V(t) and E(t), which is a subnetwork of G (since the “set of individuals/relationships capable of an interaction at time t” is necessarily a subset of the “set of individuals V/relationship set E” in the original social network).
Definition A6.
Given measure space  V , 2 V , u , u is the count measure on V,  x i t   is   measurable   on   V , the average opinion of the time t is written as  x t ¯  or  E i x i ( t ) V x i ( t ) d u | V | = i x i ( t ) | V | .
Remark A8.
Eixi(t) denotes the arithmetic mean of the individual opinions at time t, representing the average state of the opinion evolution system at time t.
Definition A7.
Let  ε : Ω [ 0 , 1 ] n  is a mapping:
ε 
is a generalized fixed point of F  F ( ω t ) ε ( ω t ) = ε ( ω t )  a.s.
ε 
is a stochastic fixed point of F  ε  is a generalized fixed point of F, and  ε  is  Ω -  measurable.
ε 
is a stochastic global attractor of  F   ,  ε     i s   a   s t o c h a s t i c   f i x e d   p o i n t   o f   F , and given  x 0 [ 0 , 1 ] n ,  P { w : t , F ( w t ) F ( w 1 ) ( x 0 ) ε } = 1 .
ε 
is a stable stochastic fixed point of  F   ε  is a stochastic fixed point of  F , and  P  {  ω : ε > 0 ,  δ ( ε ) > 0 , if  ε 0 ε   < δ ( ε ) ,  w = ω i i = 1 ,  || F ω t F ω 1 ε F ω t F ω 1 ε 0 || < ε } = 1.
Remark A9.
(1)
“The stochastic fixed point x0” implies that “after random occurrences of any opinion interaction wt, the viewpoint state x0 remains unchanged, i.e., F(wt)x0 = x0”.
(2)
“The stochastic global attractor x0” implies that “x0 is a stochastic fixed point, and for any opinion state x*, after undergoing numerous evolutions according to almost any opinion rule F(wt), it will approach/be attracted to the vicinity of state x0”.
(3)
“The stochastic stable fixed point x0” implies that “x0 is a stochastic fixed point, and for opinion states x* around x0 at time t, even after infinite evolutions according to the opinion rule F(wt), they will still be in the vicinity of x0”.
Definition A8.
Let  d v ( t ) d v t , x 0 , ω = m a x v i , v j V x i ( t ) x j ( t ) ,   d v = lim t sup d v ( t )
P { W : | d v | < ε } = 1 Given w and x 0 ,   x ( t ) has ε c o n s e n s u s .
P W : ε > 0 , d v < ε = 1 Given   w   and   x 0 ,   x ( t )   has   quasi - consensus .
K [ 0 , 1 ] n , A Ω , m ( K ) = 1 and P ( A ) = 1 , x 0 K , w Ω , P W : ε > 0 , d v < ε = 1 ( [ 0 , 1 ] n , Ω , F ) has   quasi - consensus . K [ 0 , 1 ] n , A Ω , m ( K ) = 1 and P ( A ) = 1 , x 0 K , w Ω ,
x ( t )   has   quasi - consensus   and   F   has   stable   stochastic   fixed   points ( [ 0 , 1 ] n , Ω , F ) has   stable   quasi - consensus .
Remark A10.
Quasi-consensus represents the probability of the system achieving global consensus as 1, and stable quasi-consensus indicates that it is less affected by initial disturbances.
Definition A9.
Given  [ 0 , 1 ] n , Ω ,   F , define the following concepts:
R ω , x 0 : ( i , j ) V × V :   x i ( t ) x j ( t )  is convergent and  lim t x i ( t ) x j ( t ) = 0 , it can be verified as an equivalent relationship;
Cluster ω , x 0 : ( V × V ) / R ω , x 0 ;
Nconsensus w , x 0 : Cluster w , x 0 ;
K 0 , 1 n , A Ω  and  P ( A ) = 1 ,  ω A ,  x K ,  Nconsensus   ( ω , x ) =   Const   N ,
Nconsensus ( A , K ) :   consensus ( w , x ) , N ( con sensus ) : N A ,   [ 0 , 1 ] n
Remark A11.
The cluster (w, x0) represents the consensus clustering of the system’s opinions that eventually form, given all the interactive events w that will occur and the initial opinion state x0. Nconsensus represents the number of consensuses reached after infinite evolutions of the system.
Definition A10.
 uncountable set  K [ 0 , 1 ] n , 
x , y K , lim n sup d ( F n x , F n y ) > 0 , lim n inf d ( F n x , F n y ) = 0 ( [ 0 , 1 ] n , Ω , F ) is L Y chaos
Remark A12.
The term “LY chaos” in the above definitions refers to “the state of disorderly fluctuations in opinions where a significant number of individuals are trapped in them”.

Appendix A.4. Main Theorems

Drawing upon the established model and axiomatic definition expounded earlier, we hereby posit the subsequent tripartite theorems to address questions 1/2/3, correspondingly. The remarks illustrate the methods and strategies of our proof for these three theorems.
Theorem A1.
Under M1, ([0, 1]n, Ω, F) has stable quasi-consensus.
Remark A13.
(1)
The theorem provides a significant conclusion to address Question 1. Referring to the definition of M1, it can be inferred that the magnitudes of the social learning rate (u) and group pressure (k) are almost unrelated to global synchronization. However, the sequence of network degrees and the threshold of confidence have a considerable impact on it. Furthermore, Theorem 1 explains a phenomenon known as the “active agent effect”, wherein “in a system of opinions, if there exist active agents capable of interacting with any other individual, and there is an assimilation effect among individuals, then the system can evolve towards global consensus”. This inference from the theorem can also serve as a synchronicity conclusion for models such as Deffuant et al.
(2)
The proof strategy for the theorem can be illustrated as shown in the following figure, known as the “energy decrease method” (by stochastic functional analysis and differential dynamical systems theory). It implies that the synchronicity of the model (as seen in the upper-left diagram) can be understood as a specific type of dynamical system attractor (as seen in the upper-right diagram). In other words, asynchronous system states will evolve towards synchronous states under rule F. As depicted in the upper-right diagram, the opinion values of x1 and x2 gradually converge around x1 = x2. Based on this, the specific approach involves constructing an energy function V that represents the degree of deviation of the system state relative to the synchronization point. It is then demonstrated that the infimum of V remains nearly constant and is unaffected by w (as seen in the lower-left diagram), leading to the inclusion of the system’s positive limit set within the points x0 that keep V invariant (the points where V equals 0). It is further explained that x0 possesses global attractiveness and stability, thus resulting in synchronicity.
Figure A1. (a) Shows that the value of V_function is decreasing over time. (b) Reflects that the opinion2 of the actor0 and actor1 is gradually attracted to the plane of x1 = x2, i.e., entering a synchronous state. (c) The three colored lines, respectively, represent the evolution of the opinions of three individuals, and this type of chart is referred to as the O-T chart (Opinion-Time) in the following text.
Figure A1. (a) Shows that the value of V_function is decreasing over time. (b) Reflects that the opinion2 of the actor0 and actor1 is gradually attracted to the plane of x1 = x2, i.e., entering a synchronous state. (c) The three colored lines, respectively, represent the evolution of the opinions of three individuals, and this type of chart is referred to as the O-T chart (Opinion-Time) in the following text.
Entropy 25 01219 g0a1
Theorem A2.
Under   M 2 ,   if   u 1 / 2 , n = [ 1 / d ] + 1 , x 0 [ 0 , 1 ] n , P w : N consensus   w , x 0 n = 1 .
Remark A15.
(1)
The theorem provides a direction to address Question 2. It provides an upper bound on the number of consensuses when a confidence threshold is determined and illustrates that the threshold’s magnitude is inversely related to the quantity of consensus. The sociological interpretation states that “when the individual tolerance level is high, the system exhibits fewer types of consensus” (i.e., “local consistency in opinion formation”).
(2)
The proof strategy for the theorem also needs to be referred to in the following figure, named the “cross-d search” method. The approach can be explained by considering the following figure: A. Proving the convergence of the opinion state x(t) requires first determining the minimum value min1(t) and then proving that “for all xj(t) that differ from min1(t) by less than d, they can converge to a small neighborhood B = B(min1(t), δ) of min1(t)”. It is further demonstrated that “there exists a moment T at which a minimum value min2(t) outside of B, with a distance greater than d from B, exists”. Finally, it is shown that min2(t) satisfies the same relation with min3(t)…mini(t) satisfies with mini + 1(t), thus deducing that the opinions x(t) can converge to (x1…xn) for any w; B. The upper bound on the number of consensuses is derived by utilizing the convergence of the opinion states and the probability conditions of interactions among individuals.
Figure A2. Both figures reflect the proof ideas stated in the remarks above.
Figure A2. Both figures reflect the proof ideas stated in the remarks above.
Entropy 25 01219 g0a2
Theorem A3.
Under M3, if  F ˜  is an expanding map, thus  P { w : x ( t )   h a s   L Y   c h a o s } = 1 , and it will not reach quasi-consensus.
Remark A16.
(1)
Theorem 3 addresses Question 3 under the condition of an autonomous system. Its sociological interpretation states that “when there is a certain level of social exclusion among individuals and interactions between actors continue, the opinion system will exhibit chaotic phenomena”.
(2)
The intuitive representation of chaotic phenomena can be observed in the below diagram.
Figure A3. The following is an Opinion-Time chart reflecting chaos.
Figure A3. The following is an Opinion-Time chart reflecting chaos.
Entropy 25 01219 g0a3

Appendix B. The Proof of Theorems

Appendix B.1. The Proof of Theorem 1

Theorem A4 (stochastic Lyapunov’s theorem).
Given a stochastic dynamics  X , Ω , F , Ω  is a neighborhood of zero point O; if for all  x Ω , we have V-functions that satisfy the following requirements of (1) and (2) in Theorem 0-2, and  ε = 0  is a stochastic fixed point of F, then  O  is a stable stochastic fixed point of F.
Proof. 
 
From (1), w = w t t = 0 A and P ( A ) = 1
I.
For every ε > 0 and Ω ε = { x : || x || < ε } Ω , let c = min x Ω ε V ( x ) > 0 . According to the intermediate value theorem, we know that δ > 0 , when x Ω δ = { x : || x || < δ } , 0 V ( x ) < C holds.
II.
Δ V x , w t 0 implies that x 0 Ω δ , 0 V x t , x 0 , ω V x 0 < c = min x Ω ε V ( x ) , thus x t , x 0 , w Ω ε .
Namely, when x Ω δ , ω Ω , x t , x 0 , w = F ω t 1 F ω 0 x 0 < ε .
In summary, P w : zero   point   is   stable = 1 , thus the zero point O is the stable stochastic fixed point. □
Theorem A5 (stochastic Lasalle’s theorem).
Given the stochastic dynamics  ( X , Ω , F ) , x 0 X , Ω x 0 = y X : w A , t , F W 0 W t 1 x 0 y , F  is continuous, and there is a function  V : X R  satisfying:
(1)
A Ω , P ( A ) = 1 , w = w 1 w n A ,   Δ V X , w t V F w t x V ( x ) 0 .
(2)
V  is a positive definite function and is bounded.
(3)
c R , P w : inf t V ( x ( t , x 0 , w ) ) = c = 1 .
Then,  c ,   P ( w : lim t x t , x 0 , w = x *  and  x * B ,   B  is a invariant subset of  V 1 ( c ) { x : w A , Δ V ( w , x ) = 0 } ) = 1 .
Proof. 
 
w Ω , x 0 = x ( 0 ) [ 0 , 1 ] n , we have the iteration sequence x ( t + 1 ) = F w t x ( t ) ,
Since x ( t ) = x t , x 0 , w [ 0 , 1 ] n is a compact sequence, and x t t = 0 is bounded, then x t t = 0 must have a convergent subsequence, written as x t k y Ω x 0 , thus Ω ( x 0 ) ϕ .
y Ω x 0 , w A , because V x t , x 0 , w has a lower bound and it is non-increasing, then c = c ( w ) ,   lim t V x t , x 0 , w ) = c (c is related to w). Furthermore, from the continuity of V , we know that w Ω , lim t k V x t k , x 0 , w = V ( y ) = c (this is because { V x t k } is a subsequence of { V x t } , and the limit of a subsequence is equal to the limit of the sequence). w A , since c ( w ) = c o n s t , we obtain the conclusion that
V Ω x 0 = V y : y Ω x 0 = V lim x t k = c ,   then   P Ω x 0 V 1 ( c ) = 1
y Ω x 0 , w A , t N ,
Δ V ( y ) = Δ V w t , y = V F w t y V ( y ) = V F w t ° lim t k x t k , x 0 , w V ( y )
If F w x is continuous for x, then
Δ V ( y ) = lim t k V F W t k x t k lim t k V x t k lim t k V 2 t k lim t k V 1 t k = V 2 V 1
The former/the latter can be, respectively, denoted by V t 1 + 1 V t k + 1 , V t 1 V t k , and let V 1 = inf V ( x ( t k ) ) : t k N k N = Inf t V ( x ( t , x 0 , w ) ) = c , we know the below inequality:
t k N k , V 2 t k = V F ω t k + 1 + 1 ° x t k , x 0 , w V x t k , x 0 , w V 1 t k ,
so inf t V ( x ( t ) ) V 2 V 1 inf t V ( x ( t ) ) , V 2 = V 1 , then Δ V ( y ) = 0 .
Therefore Ω x 0 { x : ( w ) A , w ( ω ) , Δ V ( w , x ) = 0 } .
From ②③, P Ω x 0 V 1 ( c ) { x : Δ V ( x ) = 0 } = P ( A ) = 1 holds. □
Proposition A1 (measurability).
x 0 [ 0 , 1 ] n ,  for  x ( t ) = F new   ˜ ( w , t ) x ( 0 ) , the mapping  F new   ˜ , x 0 w , t : F new   ˜ w , t ° X 0 F w t 1 ° ° F w 0 ( x ( 0 ) )  is a measurable mapping relative to  Ω = t = 0 Ω t . Namely, if A is measurable, then  { w : x ( t ) A }  is measurable.
Proof. 
 
Let P i : Ω = t Ω t Ω i is a projective mapping, x ( 0 ) [ 0 , 1 ] n , w i = 1 Ω , we know by conditions that x ( t , w ) = F new   ˜ x 0 ( w , t ) = F P t 1 ( w ) F P 1 ( w ) F P 0 ( w ) x 0 .
Therefore, F P 0 x 0 : Ω [ 0 , 1 ] n is apparently a mapping, F P 1 x 1 : Ω 0 , 1 n is the same, so we use the induction method below:
(1)
When t = 1 we have F P 1 ( w ) F P 0 ( w ) x 0 , measurability clearly holds true.
(2)
If the conclusion holds true when t = n 1 , we know that
Given x 0 [ 0 , 1 ] n , define x * * ( T ) T ( x ) , thus:
When t = n , x ( t , w ) = F ˜ n e w , x 0 ( w , t ) = F P n 1 w x n 1 ( w ) = F P n 1 w F ˜ new   , x 0 w , t 1 , in the formula represents function composite and matrix multiplication. To illustrate the measurability of F ˜ n e w , x 0 when t = n , we need to verify the measurability of P n 1 , F relative to w and w n 1 . Because P n 1 is continuous (projective mapping), it is also measurable, so we will verify the measurability of F .
For F , given w , if can be represented by a matrix below:
F ˜ new , x 0   ( ω , t ) ( i ) = ( x 1 x i x n ) ( 1 / N ( i , t ) ) u i 1 int e r i 1 ( w t ) …………… ( 1 u i i ) …………… ( 1 / N ( i , t ) ) u i n int e r i n ( w t ) + j k ( x i x j ) V m V x m x i + x j 2 I n t e r i j w t
Among this, N i t = j inter i j ( w t ) is measurable by the definition. Other algebraic operations are also measurable; thus, F is measurable (inside, B R n , R n has a strong topology induced by the operator 2-norm, and R n has the topology induced by a Euclidian metric).
To sum up, x 0 [ 0 , 1 ] n R n , t ,   F x 0 ˜ is measurable, then x t , x 0 , w = F x 0 ˜ w , w t is measurable relative to w = w , w t . Furthermore, we know that x 0 [ 0 , 1 ] n R n ,
P w Ω : x t , x 2 , w ( a ) < ε = P w = i = 1 n x i t , x 0 , w a 2 < ε 2 = P w : Σ P i x t , x 0 , w a 2 < ε 2
Namely, the probability of ε consensus makes sense. □
Lemma A1.
For  M 1 / M 2 , w Ω , t N , E i x i ( t ) = E i x i ( 0 ) .
Proof .
when t = 1 , E i x i ( 1 ) = 1 n x i ( 1 ) = 1 n k V ( 1 ) x k ( 0 ) + ( i , j ) E ( 1 ) u ij x i ( 0 ) + ( 1 u i j ) x j ( 0 ) +   ( 1 u ij ) x j ( 0 ) + u ij x i ( 0 ) = 1 n k V ( 1 ) x i ( 0 ) ( i , j ) E 1 x i ( 0 ) + x j ( 0 ) = 1 n x i ( 0 ) = E i x i ( 0 )
if the conclusion holds when t = n , then when t = n + 1 , thus we have E i x i ( n + 1 ) = 1 n k V 1 x k ( n ) + ( i . j ) E 1 u ij x i ( n ) + 1 u ij x j ( n ) + ( 1 u ij ) x j ( n ) + u i j x i ( n )   = E i x i ( n ) = E i x i ( 0 ) , so it also holds.
From ①②, t N , E i X i ( t ) = E i X i ( 0 ) . □
Lemma A2 (stochastic system).
w Ω , P { F w t  can constitute a dynamical system on  [ 0 , 1 ] n } P w : F ( w t ) [ 0 , 1 ] n = [ 0 , 1 ] n = 1 .
Proof. 
 
P ( F ( w t )   i s   a   s u r j e c t i o n ) = 1
F * w t is a surjection and P F w t = F * w t = 1
F * w t is nonsingular
F * w t 0
Lemma A3.
For  M 1 , if  u 1 + k 2 , then  w , F ( w )  has a generalized fixed point on  [ 0 , 1 ] n .
Proof. 
 
w Ω , From the linearity of F , we know that || F ( w ) || = sup x y || F w x F w y || || x y || = sup || x || = 1 || F ( w ) ( x ) ||   Written   n o i i , j , t as   noi , based on the definitions,
F ( w ) x 2 = x k k v ( t ) 2 + ( 1 u i j ) x i + j u i j x j int e r i j ( w t ) + n o i i V ( t ) 2 k [ t ) x k 2 + ( i , j ) E t ( 1 u i j ) x i + u i j x j 2 + ( 1 u i j ) x j + u i x i 2 + 2 n o i 2 + 2 ( 1 u i j ) x i + u i j x j ( 1 u i j ) x j + u i j x i   noi || x || 2 = i x i 2 ,
then we need
( 1 u i j ) 2 x i 2 + x j 2 + 4 u i j ( 1 u i j ) x i x j + u i j 2 x i 2 + x j 2 + 2 n o i 2 + 2 ( 1 2 u i j ) x i x j   noi   = 2 u i j 2 2 x + 1 x i 2 + x j 2 + 4 u i j ( 1 u i j ) x i x j + 2 n o i 2 + ( 2 4 u i j ) x i x j n o i x i 2 + x j 2 ( i , j L ) .
Namely,
u > 1 2 ,   2 u i j 2 2 u i j x i 2 + x j 2 + 4 u i j ( 1 u i j ) x i x j + 2 n o i 2 + ( 2 4 u i j ) x i x j n o i = 2 u i j 2 2 u i j x i 2 2 x i x j + x j 2 + 2 n o i 2 + ( 2 4 u i j ) x i x j   noi   = 2 u i j 2 2 u i j x i x j 2 + ( 2 4 u i j ) n o i x i x j + 2 n o i 2 0 ,
Let d i j = x i x j [ 1 , 1 ] , then 2 u i j 2 2 u i j d i j + ( 2 4 u i j ) n o i d i j + 2 n o i 2 0 holds for all d i j [ 1 , 1 ] , thus g d i j = u i j 2 u i j d i j 2 + n o i ( 1 2 u i j ) d i j + | n o i | 2 0 holds for all d i j [ 1 , 1 ] . since u i j 2 u i j d i j 2 0 , we have noi   ( i , j ) [ noi   ( i , j ) + ( 1 2 u i j ) d j ] 0 .
From the same positive and negative of d i j and noi   ( i , j )
d i j > 0 and n o i ( i , j ) > 0 , n o i ( i , j ) ( 2 u i j 1 ) d i j
d i j < 0 and noi ( i , j ) < 0 , noi ( i , j ) ( 2 x 1 ) d i j
Thus, 2 u i j 1 n o i ( i , j ) d i j = | noi ( i , j ) / x i x j | holds, we just need to compute its upper bound:
n o i i , j / x i x j = | k | | x i x j | | maxmin i j | / | x i x j | = | k | | x i + x j 2 1 n i x i | | k |
So when u 1 + | k | 2 ,   F ( w ) has a fixed point ε w . Define ε : Ω X as ε ( w ) = ε w .
Therefore, F has a generalized fixed point ε .
Lemma A4.
Under  M 1 / M 2 , for  ( [ 0 , 1 ] n , Ω , F ) ,   ε x 0 = ( E i x i ( 0 ) ) i = 1 n  is a stochastic fixed point of F.
Proof .
(1)
Generalized fixed point
From Lemma A2, [0, 1]n is invariant relative to F(wt), so the phase space of our system is invariant. Then, based on Lemma A3, F w t has a generalized fixed point, which can be obtained by using the following methods:
Given w t Ω t , we can find all ( i , j ) that make I n t e r i j   ( w t ) = 1 . Arbitrarily chosen a pair of ( i , j ) , then we know
1 u i j x i + u i j x j + n o i ( i , j ) = x i ;   namely ,   u i j x j x i = n o i ( i , j ) 1 u i j x j + u i j x i n o i ( i , j ) = x j ;   namely ,   u i j x i x j = n o i ( i , j )
Namely, x i x j = n o i ( i , j ) u i j . Let ε ( w ) = x i x j , x i = x j + n o i i , j u i j .
Then, if x i = x j ,   noi ( i , j ) u i j = 0 .
Denote ε ( x ( t , x 0 , w ) ) = ( E i X i ( t ) E i X i ( t ) E i X i ( t ) ) . From Lemma A1, it can be written as ε ( x 0 ) = ( E i X i ( 0 ) E i X i ( 0 ) E i X i ( 0 ) ) and is a fixed point of F ( w ) apparently.
Since w Ω is arbitrarily chosen, it is a generalized fixed point of F .
(2)
Measurability
ε x 0 = ( E x ( 0 ) ) i 1 n is a constant mapping, so it is continuous, and then it is measurable.
From (1) (2), ε x 0 is a Ω —measurable generalized fixed point of F , so ε x 0 is a stochastic fixed point of F . □
Lemma A5.
Under M1, if  y ( t ) = x ( t ) ε x 0 , then  y ( t + 1 ) = F ( w t ) y ( t ) . Namely, the evolutionary rule of  y ( t )  is same with  x t .
Proof. 
 
Given x 0 [ 0 , 1 ] n , w Ω arbitrarily, let ε x 0 = ( E i x i ( 0 ) ) i I .
From y ( t ) = x ( t ) ε x 0 , we have x ( t ) = y ( t ) + ε x 0 , thus the below conclusion holds:
if j , Inter ij w t = 0 , then y i ( t + 1 ) = y i ( t )
if j ,   Inter ij   w t = 1 , then
x i ( t + 1 ) = y ( t + 1 ) + ε x 0 i = ( 1 u i j ) y i ( t ) + ε i x 0 + u i j ( y j ( t ) + ε j x 0 ) + n o i ( i , j , t )
Namely,
  y i ( t + 1 ) = ( 1 u i j ) y i ( t ) + u i j ε j x 0 ε i x 0 + n o i ( i , j , t ) = ( 1 u i j ) y i ( t ) + u i j y j ( t ) + n o i ( i , j , t )
Lemma A6.
Under  M 1 , x ( 0 ) [ 0 , 1 ] n , ε x 0  is a stable stochastic fixed point of  [ 0 , 1 ] n , Ω , F .
Proof
 
For stochastic fixed point 0, given w Ω arbitrarily and considering V ( y ) = i y i , t N , we know that
(1)
If i , j , I n t e r i j w t = 0 , then Δ V ( y ( t ) ) = 0
(2)
If i , j , I n t e r i j ( w t ) 0 , from Lemma A5, we know
Δ V y ( t ) , w t = V ( y ( t + 1 ) ) V ( y ( t ) ) = ( i , j ) E ( t ) ( 1 u i j ) y i ( t ) + u i j y j ( t ) + u i j ε j x 0 ε i x 0 + n o i ( i , j ) y j ( t ) + ( i , j ) E ( t ) ( 1 u i j ) y j ( t ) + u i j y i ( t ) + u i j ε i x 0 ε j x 0 n o i ( i , j ) y j ( t ) ( i , j ) E ( t ) ( 1 u i j ) y i ( t ) + u i j y j ( t ) + u i j ε j x 0 ε i x 0 + n o i i , j | | y i ( t ) | + ( i , j ) E ( t ) ( 1 u i j ) y j ( t ) + u i j y i ( t ) + u i j ε i x 0 ε j x 0 n o i ( i , j ) y i ( t ) = u i j y i ( t ) + u i j y j ( t ) + ε j x 0 ε i x 0 + n o i i , j u i j + u i j y j ( t ) + u i j y i ( t ) + ε i x 0 ε j x 0 n o i ( i , j ) u i j = u i j y j ( t ) y i ( t ) + u i j y i ( t ) y j ( t ) = 0
This shows Δ V is negative constant. Arising from the stochastic Lyapunov’s theorem, y t is stable at O, thus x t is stable at ε x 0 . □
Lemma A7.
For  M 1 , x ( 0 ) [ 0 , 1 ] n , If  | k | < u < 1 | k | ,   ε x 0  is a stochastic global attractor of    [ 0 , 1 ] n , Ω , F .
Proof. 
 
Part A: Simplification
Arbitrarily given w Ω , t N , let maxmin i j = E i x i ( t ) x i ( t ) + x j ( t ) 2 , and given x 0 0 , 1 n
(1)
if E ( t ) = ϕ , Δ V y , w t = 0
(2)
if E ( t ) ϕ , Δ V y , w t
= i u ( t ) ( 1 u i j ) y i ( t ) + u i j y j ( t ) + u i j ε j x 0 ε i x 0 + n o i ( i , j ) + j v ( t ) ( 1 u i j ) y j ( t ) + u i j y i ( t ) + u i j ε i x 0 ε j x 0 n o i ( i , j ) V ( t ) y k ( t ) = ( 1 u i j ) y i ( t ) + u i j y j ( t ) + n o i ( i , j ) y i ( t ) + ( 1 u i j ) y j ( t ) + u i j y i ( t ) n o i ( i , j ) y j ( t ) = ( 1 u i j ) y i ( t ) + u i j y j ( t ) + k y i ( t ) y j ( t ) max min ij y i ( t ) + ( 1 u i j ) y j ( t ) + u i j y i ( t ) + k y j ( t ) y i ( t ) max minij y j ( t ) = ( 1 u i j + k maxminij ) y i ( t ) + ( u i j k max min i j ) y j ( t ) y i ( t ) + ( 1 u i j + k maxmin i j ) y j ( t ) + ( u i j k maxmin i j ) y i ( t ) y j ( t )   (or the same with above) = y i ( t ) + ( u i j k max min i j ) y j ( t ) y i ( t ) y i ( t ) + y j ( t ) + ( u i j k maxminij ) y i ( t ) y j ( t ) y j ( t )
Denote l i j = u i j k max min i j and l i j * = u i j + k max min i j , From | k | < u i j < 1 | k | ,
1 u i j > | k | > k max min i j u i j > | k | > k kaxminij 1 u i j > | k | > k max min i j u i j > | k | > k max min i j
Then, we have l i j > 0 and l i j * > 0 , thus
Δ ( y ( t ) , w ) = ( i j ) E ( t ) 1 l i j y i ( t ) + l i j y j ( t ) + | 1 l i j y j t + l i j y i t | y i ( t ) + y j ( t )
Part B: Scaling
Given w , t satisfy (2), if 0 < l i j < 1 , we know: when i , j , y i t y j t 0 , Δ V ( y , w ) = 0 when i , j , y i t y j ( t ) < 0 , Δ V ( y , w ) < 0 .
Part C: Lower bound
Given w Ω arbitrarily, given j satisfying d j = 1 and degree   v j = V 1
(1)
V ( t ) 0 , obviously, 0 is the lower bound of V(t), thus P { inf V ( t ) 0 } = 1
(2)
If P { inf t V t = 0 } < 1 , namely K , P 0 < K = inf t V ( t ) > 0 , then A Ω , P ( A ) > 0 , w A , we have V ( t ) K and ε > 0 , t * , V t * < K + ε . From the non-descending feature of   V ( t ) , we know t > t * , V ( t ) < K + ε . Given the N enough large, given ε = 1 n K enough small, when t = t * , V t * , W 0 , there are two conditions:
Let Q = w : y j t * = 0 , M w : i I , Interij   t * = 1 , i   i s   n o t   i n   s y n c h r o n i z a t i o n   s t a t e , N w : i I , Interij   t * = 1 , i   i s   i n   s y n c h r o n i z a t i o n   s t a t e   , P ( M N ) c = 0 , we can, respectively, discuss by A and B below.
A. To consider M , P Q w : k > 0 , Inf t V ( t ) < k M = P ( Q M ) , which is because: for w t satisfying Inter ij   w t = 1 , if i is not in synchronization state, y j t * + 1 will be not in synchronization state, and t > t * , k ,   Interij w t = 1 and x k ( t ) x j ( t ) 0 , so x j ( t + 1 ) E i x i ( 0 ) , namely, y j ( t + 1 ) 0 .
Therefore,
P ( Q M ) = P Q M { w : t > t * , Inter mj w t = 1   and x m ( t ) x j ( t ) < 0 P ( Q M { V ( t + k ) < V ( t + k ) δ } ) P ( Q M { k > 0 , In f t V ( t ) < k } ) P ( Q M )
Thus, we can take appropriate N and ε , which can satisfy the below conclusion:
P Q M w : Inf t V ( t ) = K > 0 = P ( Q M ) P ( Q M ) = 0
B. To consider N , further define the set that is not in synchronization state N S ( t ) = k : y k ( t ) 0 t > t * .
B1. Obviously, P ( Q N { K > 0 } { t > t * , N s ( t ) = ϕ ) } = 0 .
B2. P ( Q N { k > 0 } ) = 0 + P Q N { k > 0 } t > t * , N S ( t ) ϕ
P Q { k > 0 } N t > t * , k N S t , I n t e r k j t = 1 , y k t y j t < 0 } }
P Q { k > 0 } Int t V ( t ) < K = 0
Therefore, from A and B, we know that
{ P ( Q { K > 0 } ) = P ( Q N { K > 0 } ) + P ( Q M { K > 0 } ) + 0 = 0
For w Q C , namely, for j , y j t * 0 , which is similar to A in ①, then P Q C { K > 0 } = 0 .
To synthesize ①②, P ( { K > 0 } ) = 0 , which is a contradiction, thus P inf t V ( t ) = 0 = 1 .
Part D: QED
Therefore, to synthesize Parts A/B/C, based on the stochastic Lasalle’s theorem, O is the stochastic global attractor of y t . Then from the arbitrary features of x(0) and w , ε x 0 is the stochastic global attractor of [ 0 , 1 ] n , Ω , F . □
Lemma A8.
If  [ 0 , 1 ] n , Ω , F  has a stochastic global attractor  ε x 0 , x t  will have quasi-consensus.
Proof. 
 
Because ε x 0 is a stochastic global attractor, we can obtain A satisfying P(A) = 1, and given w A arbitrarily, since ε x 0 = x ¯ 0 , x ¯ 0 , we have ε > 0 , N , t > N   x ( t ) ε x 0 < ε . From the convergent feature of norm , i , x i ( t ) E ( i ) x 0 = x ¯ 0 holds. Therefore, l , k I , from x l ( t ) x ¯ 0 and x k ( t ) x ¯ 0 , we obtain ε > 0 , l , k , for ε 2 , T l , T k , t > T l k = max T l , T k , x l ( t ) x ¯ 0 < ε 2 and x ¯ 0 x l ( t ) < ε 2 , so we know that | x l ( t ) x k ( t ) | < ε 2 + ε 2 = ε , then ε > 0 , N , t > N , d v ( t ) = sup k , l x k ( t ) x l ( t ) < ε , and then d v = lim t sup d v ( t ) = 0 , x t will have quasi-consensus arising from the arbitrary choice of w. □
Theorem A6.
For  M 1 , [ 0 , 1 ] n , Ω , F  has a stable quasi-consensus.
Proof. 
From Lemmas A6 and A7, the translation system y t has a stable stochastic fixed point and stochastic global attractor o . Therefore, P ( A ) = 1 , w A , t , x ( t ) x ( 0 ) ¯ 0 , x ( t ) x ( 0 ) ¯ , so x ( 0 ) ¯ is a stable stochastic fixed point and stochastic global attractor of x t .
From Lemma A8, we know that stochastic global attraction can lead to a quasi-consensus. Further, based on the stability of x ( 0 ) ¯ , [ 0 , 1 ] n , Ω , F has a stable quasi-consensus. □

Appendix B.2. The Proof of Theorem 2

Proposition A2.
x 0 [ 0 , 1 ] n , under the alternative rule in the definition,  A 2 = w : Inter ij ( w t ) II ( 0 , d ) x i ( t ) x j ( t ) = 1 ( P 1 ) , and under the original rule in the definition,  A 1 = { w   :   Inter ij   w t = 1 ( P 2 ) } , then  A 2 = A 1 .
Proof. 
 
Namely, we need to prove “ P 1 P 2
” If P 1 holds, we have   Inter ij   w t = 1 , Y 2 holds.
” If P 2 holds and P 1 does not hold, namely   inter ij   w t = 1 and x i ( t ) x j ( t ) > d , from the ② of rule 2, we know: when i , sign i w = sign i ( w ) , P w x i ( t ) x j ( t ) < d   = P { w } x i ( t ) x j ( t ) < d , then
0 P w : w i j > 0 x i ( t ) x j ( t ) > d = P { w } x i ( t ) x j ( t ) < d
Thus, w * , P w * x i ( t ) x j ( t ) < d 0 , so P { w } x i ( t ) x j ( t ) < d 0 , which is a contradiction, so P 1 holds. □
Remark A17.
The equivalence of the original rule and the alternative rule is known from the proposition. Therefore, Theorem 2 can be proved below under the alternative rule.
Proposition A3.
P A 1 = 1 , P A 2 = 1 , then  P A 1 A 2 = 1 .
Proof. 
It obviously holds on the basis of basic probability theory. □
Lemma A9.
For  M 2 , when  u 1 2 , P { w : i f min i V t x i ( t ) interact   at   the   time t , then   min i V t + 1 x i ( t + 1 ) min i V t x i ( t ) u ( x σ t 2 t x σ t 1 t ) } = 1 .
Proof. 
I.
Given x 0 [ 0 , 1 ] n arbitrarily, Let σ t : { 1 n } { 1 n } be a permutation of V(t), which sorts i in V(t) from small to large by the value of x i t , and can be denoted as σ t ( x ( t ) ) = x σ ( i ) t t = 1 n . Given t N and i , j V ( t ) , we obtain: A Ω ,   P A = 1 , w A , for i that interacts with the other agent at the time t; the equation reflecting its dynamics can be briefly written as x i ( t + 1 ) = ( 1 u ) x i ( t ) + u 1 N i ( t ) k N i ( t ) x k ( t ) . Thus, we know x σ t 1 ( t + 1 ) x σ t ( 1 ) ( t ) ( 1 u ) x σ t ( 1 ) ( t ) + u x σ t ( 2 ) ( t ) x σ t ( 1 ) ( t ) = u x σ t ( 2 ) ( t ) x σ t ( 1 ) ( t ) and x σ t + 1 ( 1 ) ( t + 1 ) min x σ t ( 1 ) ( t + 1 ) , 1 2 x σ t ( 1 ) ( t ) + x σ t ( 2 ) ( t ) , so the inequality holds below:
min i V ( t ) x i ( t + 1 ) min i V ( t ) x i ( t ) = x σ t + 1 1 t + 1 x σ t 1 t min u x σ t ( 2 ) ( t ) x σ t ( 1 ) ( t ) , 1 2 x σ t ( 2 ) ( t ) x σ t ( 1 ) ( t )   = u x σ t ( 2 ) ( t ) x σ t ( 1 ) ( t ) , written as I n q 1 in the following part.
II.
Given the set A same as above, w A , we consider V t + 1 and know:
(1)
When V c ( t ) = { k V : B x k ( t ) , d ) = ϕ and let B ( t ) = { k : x k ( t ) min i V ( t ) x i ( t )   or   x k ( t )
max i V ( t ) x i ( t ) P 2 ( t ) } , we obtain x k ( t ) V c ( t ) B ( t ) , x k ( t + 1 ) = x k ( t ) and min x i ( t ) / max x i ( t ) is non-decreasing/non-increasing, then x k ( t + 1 ) V c ( t + 1 ) B c ( t + 1 ) and we know that V c ( t ) B ( t ) V c ( t + 1 )
(2)
k V c ( t ) B C ( t ) , namely B x k ( t ) , d = ϕ and min i V ( t ) x i ( t ) < x k ( t ) < max i V ( t ) x i ( t ) ,   suppose only one k that satisfies this condition (which can be generalized to n), from the non-existence of x l ( t ) B x k ( t ) , d , we know: there is a partitioning of V t , namely V 1 ( t ) V 2 ( t ) = ϕ and V 1 ( t ) V 2 ( t ) = V ( t ) , which can satisfy x k ( t ) max i V 1 ( t ) x i ( t ) > d and min j V 2 ( t ) x j ( t ) x k ( t ) > d . Thus, m V 1 ( t ) , n V 2 ( t ) ,   II   ( , d ) x m ( t ) x n ( t ) = 0 and x k ( t + 1 ) = x k ( t ) , we have
(fixed agents) p V 1 ( t ) V 2 ( t ) , p k , x p ( t + 1 ) = x p ( t ) B x k ( t + 1 ) , d ;
(Activable agents) from d V 1 ( t ) , V 2 ( t ) > d , we know max m V 1 ( t ) x m ( t + 1 ) max m V 1 ( t ) x m ( t ) and min n V 1 ( t ) x n ( t + 1 ) min n V 1 ( t ) x n ( t ) holds, and p V 1 ( t ) V 2 ( t ) , x p ( t + 1 ) B x k ( t + 1 ) , d , so k V ( t + 1 ) . Therefore, k V c ( t + 1 ) , namely V c ( t ) B c ( t ) V c ( t + 1 ) .
From (1) and (2) of II, given A, we obtain the below conclusion:
w A , V c ( t ) = V c ( t ) B ( t )   V c ( t ) B c ( t ) V c ( t + 1 ) , namely V ( t + 1 ) V ( t ) , thus 1 P { w : V ( t + 1 ) V ( t ) } P ( A ) = 1 , so the probability is equal to 1.
Then, from I and II, we know x 0 [ 0 , 1 ] n , w A , since min i V ( t + 1 ) x i ( t + 1 ) min i V ( t ) x i ( t + 1 ) , for the condition which min xi(t) participates the interaction, we have
P w : i f min i V t x i ( t ) i n t e r a c t   a t   t h e   t i m e   t , min i V t + 1 x i ( t + 1 ) min i V t x i ( t ) u ( x σ t 2 t x σ t 1 t ) = 1
. □
Lemma A10.
When  u 1 / 2 , P ( x 0 [ 0 , 1 ] n , t , x ( t ) x 0 ) = 1 .
Proof
 
Given x 0 [ 0 , 1 ] n , w Ω arbitrarily, let E * ( t ) = x i ( t ) : x j ( t ) , 0 < x i ( t ) x j ( t ) < d .
Obviously, E * ( t ) = ϕ or E * ( t ) 2 .
  • xi(t) Under E * ( t ) (or above E*(t)) will be convergent.
    x l ( t ) < min E * ( t ) , x k ( t ) > max E * ( t ) , we have x l ( t ) min E * ( t ) < d ,   x k ( t ) max E * ( t ) > d .
    From Lemma A9, we deduce that min E * ( t + 1 ) min E * ( t ) and max E * ( t + 1 ) max E * ( t ) .
    Thus, x l ( t + 1 ) min E * ( t + 1 ) < d and x k ( t + 1 ) max E * ( t + 1 ) > d , so x l ( t + 1 ) E * ( t + 1 ) and x k ( t + 1 ) E * ( t + 1 ) . Then, it is known by induction that x l ( t + k ) , x k ( t + k ) E * ( t + k ) . Therefore, T , t > T and t > T , x k ( T ) min E * ( T ) or x k ( T ) max E * ( T ) , x k t = x k ( t ) . Namely, x k ( t ) x k , and we can obtain the equation:
    P t , x k ( t ) min E * ( t ) , max E * ( t ) x n ( t ) x k = P t , x k ( t ) min E * A , max E * ( t )
  • xi(t) in E*(t) will be convergent n a m e l y , x k ( t ) min E * ( t ) , max E * ( t ) , given ω Ω arbitrarily.
    (1)
    If t , E * ( t ) = ϕ , then i / j , x i ( t ) x j ( t ) d , so x i t + 1 = x i t keep the feature, E * t + 1 = ϕ . By induction, we know t > t , E * ( t ) = ϕ , thus x t x 0 holds, and
    P t , x k ( t ) min E * t , max E * t t : E * ( t ) = { x ( t ) x ( 0 ) } = P ( t , x k ( t ) min E * ( t ) , max E * ( t ) t : E * ( t ) = ϕ
    (2)
    if t , E * ( t ) ϕ , given t , let min 1 ( t ) = min i V ( t ) x i ( t ) (also equal to min E * ( t ) ). From Lemma A9 and ω A ( A is the set given in Lemma A9), we know { min 1 ( t ) : t N } is bounded and non-decreasing, thus t , min 1 ( t ) x 1 .
To consider the limit of min 1 ( t ) , written as x 1 ,
By the convergence of min1(t), δ > 0 , T , t > T ,   x 1 min 1 ( t ) < δ . From min ( t ) E * ( t ) , we know B ( min 1 ( t ) , d ) ϕ .
I. Suppose A 1 A and P A 1 > 0 , P w A 1 : δ > 0 , T > 0 , t > T (written as T 1 T n ), x j ( t ) B ( min 1 ( t ) , d ) and x j ( t ) min ( t ) > δ > 0 .
For the condition that “ x j ( t B ( min 1 ( t ) d ) and x j ( t ) min 1 ( t ) > δ ”, we know: given w , given T = T 0 , firstly, there is a t = T 1 > T 0 satisfying the condition; then let T = T 1 , there is a t = T 2 > T 1 satisfying the condition… Based on this procedure, for w in A, there are countable T i i N satisfying the condition.
II. Based on the conclusion of I, let u p ( t ) = x i ( t ) E * ( t ) : min ( t ) x i ( t ) x 1 , which is obviously not equal to ϕ . Given the apagogical hypothesis is P ( M ) P δ > 0 , T i , t = T i + 1 > T i , x j ( t ) B ( min 1 ( t ) , d ) , then x j t min 1 ( t ) | > δ , we know the below conclusion:
P u p ( t ) x i ( t ) | u p ( t ) | x 1 + d P ( w : I N ,   I = N , δ > 0 , t i I Inter min 1 t i , x ( j ) , t i w t i = 1
and ( j ) , x ( j ) t i min 1 t i > δ p ( M ) > 0 .
For the proof of the first equal sign, we take t > T 0 and fix the u p t , given min 1 ( t ) = x k t ( t ) u p ( t ) , if x i ( t ) u p ( t ) , Inter x k t ( t ) , x i ( t ) = 1 , u p ( t ) x i ( t ) will not change; if x j t u p t ,   Inter   x k t ( t ) , x j ( t ) = 1 , x i ( t ) will increase more than l (from Lemma A9). For the proof of the second inequality, from I, the cardinality of T i i = 1 is same with N and P inter i j T i x 1 T i x j T i < d > 0 , thus t , | I | = N , inter   min 1 ( ti ) ,   x ( j ) t i w t i = 1 and x j ( t ) min t i > δ , the inequality holds. From this, P k , E ( u p ( t + k ) ) E ( u p ( t ) ) + k u δ n x 1 + d > 0 , and E   represents   the   sum   of   elements   in   up ( t ) , which is a contradiction. Therefore, A 1 A and P A 1 > 0 , P w A 1 : δ > 0 , T > 0 , t > T , x j ( t ) B ( min 1 ( t ) , d x j ( t ) B ( min 1 ( t ) , δ ) ) = P A 1 . Furthermore, Let A 1 = A , P { w : δ > 0 , T > 0 , t > T , x j ( t ) B ( min 1 ( t ) , d ) x j t B min 1 ( t ) , δ } = 1
III, From II, the probability of “ δ > 0 , T 1 = T ( δ ) , t > T 1 , x j ( t ) B min 1 T 1 , d , x j ( t ) min 1 ( T 1 ) < δ ” is equal to 1. Furthermore, given w , we define min 2 ( t ) = min x i ( t ) \ B ( min 1 ( t ) , d ) x i ( t ) , and use the apagogical arguments. For w in measure P in II, m > 0 , P K 2 P ( w : t , x i ( t ) B ( min 1 ( t ) , d ) , min 2 ( t ) B x i ( t ) , d > m , we take δ = d 2 , and find T d 2 based on II satisfying P { w : t > T d 2 , x j ( t ) B min 1 ( t ) , d ,   then   x j ( t ) B ( min 1 ( t ) , d / 2 ) } , then we take t > T δ and consider the apagogical arguments hypothesis, knowing some points below:
A. P w K 2 : t , t i i = 1 , x t B min 1 ( t ) , d t 1 t n Inter x k ( t ) , min 2 ( t ) w t i = 1 = P K 2
B. Given w , if Inter x k ( t ) , min 2 ( t ) = 1 , i B min 1 ( t ) , d x i ( t + 1 ) x i ( t ) + u d 2 . Thus, P w : t , x i ( t ) m > 0 , which is a contradiction, so P ( t , min 2 ( t ) does not exist, or T , min 2 ( t ) max B ( min 1 ( t ) , d ) x i ( t ) + d = 1 , and then we obtain P T , t > T , x k ( t ) B ( min 1 ( t ) , d ) , Inter min 2 ( t ) , x k ( t ) = 0 = 1 .
To consider min i ( t ) , 1 < i w .
When i > 1 , we define min i t like min2(t) in ①, and view min i t as min 1 ( t ) , min i + 1 ( t ) as min 2 t . After discussing like above process, we know: i { 2 w } , T i , t > T i , B min i t , d B mini   + 1 ( t ) , d = ϕ , then P ( { T , t > T , Interij ( w t ) = 1 } ) = 0 ( x i ( t ) B ( mini ( t ) , d ) , x j ( t ) B min i + 1 ( t ) , d ) . Furthermore, we have P ( max T 1 T n ,   t > max T 1 T n , Inter i j ( w t ) = 1 ) = 0 , which satisfies
x i t B min l + 1 , d , x j t B min k t , d and k l . Because V < ,   i (just finite numbers of i, which written as m) x p ( t ) [ mini ( t ) , min i ( t ) + d ] , x p ( t ) x i . After ordering, we prove that x ( t ) x 1 x 1 x m x m .
In conclusion, when x(0) belongs to [0, 1]n and w belongs to A, t , x 0 , x ( t ) x 0 , we have P ( x 0 [ 0 , 1 ] n , t , x ( t ) x 0 ) = P ( A ) = 1 . □
Theorem A7.
For M2, when  u 1 2 , n = [ 1 / d ] + 1 , arbitrarily   given   a   starting   point     x * [ 0 , 1 ] n , P w : N consensus   w , x 0 n = 1 .
Proof. 
 
Given x 0 arbitrarily, when d > 1 n , P N   consensus   w , x 0 > n > 0 , so   A and P(A) > 0, w A , there are x i ( t ) x n + 1 ( t ) satisfying x 1 ( t ) x 1 , , x n + 1 ( t ) x n + 1 and x i x j . From Lemma A10, we know P x ( t ) x 0 = 1 , and based on d > 1 n obtain P ( A w : x ( t ) x 0 ) > 0 . Arbitrarily given w , if x i x j < d , let ε 0 = d x i x j , x i ( t ) x j ( t ) x i ( t ) x i + x i x j   + x i x j ( t ) = x j ( t ) x i + x j ( t ) x j + d ε 0 . From x i ( t ) x i , x j ( t ) x j , T 1 , T 2   t > T = max T 1 , T 2 , x i ( t ) x i < ε 0 2 and x j ( t ) x j < ε 0 2 , so x i t x j t < d . Therefore, t > T , x i ( t ) , x j ( t ) E * ( t ) , namely “ ! T , t > T , E * t = ϕ or x i t x j t > d ” (written as M ), and based on the Lemma A10, P T , t > T ,   E * ( t ) = ϕ o r x i ( t ) x j ( t ) > d = 1 , so P ( M ) = 0 is contradicted with P ( M ) P A w : x ( t ) x 0 , so P N   consensus   w , x 0 > n = 0 , and x 0 , P N   consensus   w , x 0 n = 1 . □

Appendix B.3. The Proof of Theorem 3

Lemma A11.
For  M 3 , F ˜ M n ( R ) , P w : T , t > T , F w t = F ˜ = 1 .
Proof. 
From the remarks in definitions, the conclusion is obvious. □
Lemma A12.
If F ~ is a e x p a n d i n g   m a p p i n g ( α > 1 , d ( F ~ x , F ~ y ) > α d ( x , y ) ) ,  then  F ˜  is an expansive mapping.
Proof. 
 
If F ˜ is expanding, then, given x 1 , x 2 [ 0 , 1 ] n arbitrarily, let e = 1   α > 1 , d F ˜ x 1 , F ˜ x 2 α d x 1 , x 2 .
From induction, we know that when n > N = log α 1 d x , x 2 + 1 , d F ˜ n x 1 ,   F ˜ n x 2 α n d x 1 , x 2 > 1 = e , so F ˜ is a expansive mapping. □
Lemma A13.
If ([0, 1]n, Ω,  F ˜ ) has  L Y  chaos, it will not have quasi-consensus.
Proof. 
For ([0, 1]n, Ω, F ˜ ) has L Y chaos, A [ 0 , 1 ] n , x , y A , we obtain that lim n sup d F ˜ x n , F ˜ y n lim inf n d F ˜ n x , F ˜ n y , n k i , n k j , lim n k i d F ˜ n x , F ˜ n y   lim n k j d F ˜ n x , F ˜ n y , so lim d F ˜ n x , F ˜ n y does not exist.
Suppose ([0, 1]n, Ω, F ˜ ) has quasi-consensus, and it also has L-Y chaos, when n , Let F ˜ n x ( a a ) , F ˜ n y ( b b ) , From the continuity of the norm, we know that lim n d F ˜ n x , F ˜ n y = lim n F ˜ n ( x y ) = lim n F ˜ n ( x y )   = lim n F ˜ n x lim n F ˜ n y = || ( a b , , a b ) || exists, which is contradicted with ①, so the hypothesis does not hold.
Therefore, if ([0, 1]n, Ω, F ˜ ) has L Y chaos, it will not have quasi-consensus. □
Lemma A14.
k > 0 , F k ˜  has 2-order shift invariant set. Namely,  [ 0 , 1 ] n , F ˜ k  is topological conjugate with one-sided symbolic system  S Z + , b .
Proof. 
I.
(1) compact set A 1 , A 2 , F k ˜ A 1 A 1 A 2 and F k ˜ A 2 A 1 A 2
Let A 1 = B a 1 , ε ¯ [ 0 , 1 ] n , A 2 = B a 2 , ε ¯ [ 0 , 1 ] n , a 1 = x 1 x 1 , a 2 = x 2 x 2 , thus a 1 , a 2 are the fixed points of F ˜ . Then we can take a obviously enough small ε , making A 1 A 2 = ϕ and A 1 , A 2 compact (bounded closed set).
Let d max   ( 1 ) = sup b A 2 d ( a , b ) < 1 , because F ˜ is a homeomorphism, F ˜ A 1 = F ˜ A 1 . After induction, we know that m 1 , F m ˜ A 1 = F m ˜ A 1 . Therefore, given arbitrarily y F ˜ A 1 , d ( y , a ) = d ( F ˜ x , a ) l d ( x , a ) ,   x A (namely x is on the sphere). Similarly, after induction, we can obtain d F m ˜ x , a l m d ( x , a ) .
Let m 1 = log l d max 1   d ( x , a ) + 1 , d F ˜ m 1 x , a l log l d max ( 1 ) d ( x , a ) + 1 , d ( x , a ) d max   ( 1 ) d ( x , a ) d ( x , a ) = d max   ( 1 ) , then   y F t ˜ A 1 , t m 1 , d F ˜ t x , a > d F ˜ m 1 x , a d max   ( 1 ) , namely, the distance between the boundary of F t 1 ˜ A 1 and a 1 is more than d max ( 1 ) . Meanwhile, because the homeomorphism F ˜ keeps the simply connected feature (homeomorphism homotopy same Fundamental group simply connected), F t ˜ A 1 is still a closed manifold, and all points inside F t ˜ A 1 still belong to F t ˜ A 1 , thus A 2 B   a 1 , d max   ( 1 ) F t ˜ A 1 and A 1 B a 1 , d max   1 F t ˜ A 1 , namely, A 1 A 2 F t ˜ A 1 . Therefore, the first conclusion is proved.
Same with ①, we can find m 2 = log l d max ( 1 ) d ( x , b ) + 1 , wherein d max 2 = sup a A 1 d a , a 2 , so t m 2 , A 1 A 2 F t ˜ A 2
To synthesize ①②, let k = max m 1 , m 2 , then A 1 A 2 F k ˜ A 1 ,   A 1 A 2   F k ˜ A 2 .
II.
A 1 , A 2 can ‘shrink to less than or equal to a point’.
Because 1 = || I || = F 1 ˜ F = F 1 ˜ F ˜ , F 1 ˜ = 1 F ˜ < 1 , we know x , y d F 1 x ˜ ,   F 1 y ˜ < d ( x , y ) , then F k ˜ x F k ˜ A 1 , F k ˜ y F k ˜ A 2 , d F k ˜ x , ( α ) < d x , a i I and d F k ˜ y , ( b ) < d ( y , ( b ) ) , so F k ˜ A 1 F k ˜ A 2 = ϕ , N F k ˜ A 1 F k ˜ A 2 1 is satisfied. From the theorem in [51], the conclusion holds. □
Theorem A8.
For  M 3 , if  F ˜   is   a   expanding   mapping , P{([0, 1]n, Ω,  F ˜ ) has  L Y  chaos} = 1, and ([0, 1]n, Ω,  F ˜ ) does not have quasi-consensus.
Proof. 
 
From Lemma A12, for M 3 , P w : F ˜ T , t > T , F w t = F ˜ = 1 . Then, given w in this set, F ˜ is fixed. Let x ( 0 ) ˜ = x ( T + 1 ) , we know the limit feature of x ˜ ( t ) is same with x ( t ) .
The following deduction is derived and based on the given w , F ˜ , x ( 0 ) ;
Let the Lebesgue measure of 0 , 1 n written as m : B [ 0 , 1 ] n [ 0 , 1 ] , for the measurable mapping F ˜ , we construct a invariant measure u ( A ) = lim n 1 n i = 1 n m F ˜ 1 A . Topological entropy in the following part are based on the F ˜ -invariant measure u .
[ 0 , 1 ] n , d is compact and F ˜ is continuous.
For [ 0 , 1 ] n , because [ 0 , 1 ] n B ( 0 , n ) .   and [ 0 , 1 ] n is a closed set (under the metric topology), [ 0 , 1 ] n can be a metric subspace of R n based on the sub-topology/sub-metric. Thus, [ 0 , 1 ] n , d is compact;
For F ˜ , we know ( F ˜ ) i = L ( F ) i . F i is the component of linear mapping, and is obviously continuous. L = x , x ( 0 , 1 ) 0 , x 0 1 , x 1 is also continuous, so i , ( F ˜ ) i is continuous. Therefore F ˜ is continuous.
F ˜ is   expanding , then F ˜ is expansive and h ( F ˜ ) > 0 .
From Lemma A12, if F ˜ is expanding, then F ˜ is expansive. Then, from Lemma A14, we know h ( F ˜ ) = 1 k h F k ˜ = 1 k h ( σ ) = 1 k lg 2 > 0
( [ 0 , 1 ] n , F ˜ ) has L Y chaos and does not have quasi-consensus.
From h F ˜ > 0 and the theorem in [52], ( [ 0 , 1 ] n , F ˜ ) has L Y chaos. Then, from Lemma A13, it does not have quasi-consensus.
In conclusion, from Lemma A11, we know P{([0, 1]n, Ω, F ˜ ) has L Y chaos} = 1, and ([0, 1]n, Ω, F ˜ ) does not have quasi-consensus. □

Appendix C. The Methods for Estimation and Test

Appendix C.1. The Method for Estimation

The estimation method for our model consists of three steps: (1) employing approximate Bayesian computation (ABC), we obtain a posterior distribution sample of parameters (ui/di/ki) by leveraging both real data and model simulation outcomes; (2) utilizing kernel density estimation, we smooth the empirical distribution of parameters into a posterior density function; (3) employing Markov Chain Monte Carlo (MCMC), we compute various integrals of the density function to obtain posterior estimates. The detailed procedure is discussed below.
Regarding (1), we can adopt the conventional approach of approximate Bayesian computing, which necessitates the initial random selection of multiple values for ui/di/ki, followed by the computation of simulation results under these parameter values. If the discrepancy between the results and the actual data falls below a critical value, denoted as e, the parameter value is deemed acceptable; otherwise, it is rejected. Multiple approaches exist for determining the critical value of e. Our proposed solution involves the implementation of a “sensitivity reduction” strategy: (1) Initially, we select a decreasing sequence of e values and substitute them into the model to obtain the posterior distribution of the parameters. (2) Once the impact of decreasing the value of e on the posterior distribution becomes negligible, we halt the calculation process and employ the final value as the selected e value.
For (2), given the constrained parameter information (ui∈[−1, 1] and di ∈[0, 1]), we can opt for the standard Gaussian distribution as the kernel function and employ classical techniques to formulate the kernel density. Concurrently, leveraging the computed deviation term of the kernel function, we will utilize the equation h o p t = κ 2 2 / 5 κ 1 / 5 f ( 2 ) x 2 d x 1 / 5 n 1 / 5 , where κ = k ( v ) v 2 d v and κ = k 2 ( v ) d v [53], to ascertain the most suitable bandwidth. This approach enables us to obtain a posterior density, pi (u), which effectively addresses the challenges of both undersmoothing and oversmoothing.
In reference to (3), based on the principles of Markov Chain Monte Carlo (MCMC), we utilize the esteemed Metropolis–Hastings algorithm to facilitate integral computation. Our primary focus revolves around acquiring two essential metrics: the posterior expectation of parameters and Bayesian factors. Specifically, the estimation of the posterior expectation of variable “u” entails evaluating 1 1 u · p i u d u . Furthermore, the Bayesian factor encapsulates the probability of “u” assuming values within a predetermined range.
For the purpose of posterior expectation estimation, let us illustrate our approach within the framework of MCMC. Initially, we adopt the uniform distribution U(a, b) as our proposed distribution. After selecting the initial value “xt”, we generate prospective values “x’” drawn from U(a, b). Subsequently, we compute the acceptance probability and, based on this likelihood, assign “x’” as “xt + 1”. Analogously, we can obtain a sequence of numerical values {x0……xn} that form Markov chains, characterized by their stationary distribution aligning with the posterior distribution. By virtue of the central limit theorem, the arithmetic mean of this sequence can be regarded as the posterior expectation estimate. Moreover, this method extends its utility to calculate integral results for the Bayesian factor as well.

Appendix C.2. The Algorithm for Testing

Step1 
Obtain the sampling frame of F by simulation, namely F w i : ω i W Ω ,   N = 10000
Step2 
Obtain the sampling frame of T 1 and T 2 , namely { T 1 ω i : || T ( ω i ) x 0 x 1 || < ε , T 2 ω i : T ω i x 1 x 2 < ε , N = 10000
Step3 
Obtain samples from the sampling frame of F , T 1 , T 2 , n = 50.
Step4 
Test F D T 1 and F D T 2 , if they all holds, T T 1 T 2 . Thus, F T .

Appendix C.3. Equivalence of Rules(F/T) and Distributions(x^(t)/x(t))

Proposition A4.
If  F D T , then  ( x ( 0 ) , x ( 1 ) , x ( 2 ) )  and  x ^ 0 , x ^ 1 , x ^ 2  have the same distribution.
Proof. 
 
P { w : ( x ( 0 ) , x ^ ( 1 ) , x ^ ( 2 ) ) ( a , b , c ) } , (“≤” represents the vector order)
= P w : x ( 0 ) , F ( ω ) x ( 0 ) , F 2 ( w ) x ( 0 ) a , b , c
= P w : x ( 0 ) a , F ( ω ) x ( 0 ) b , F 2 ( w ) x ( 0 ) c
= P w : x ( 0 ) a , T ( ω ) x ( 0 ) b , T 2 ( w ) x ( 0 ) c T ( ω ) = F ( ω )
= P ω : x ( 0 ) a , T ( ω ) x ( 0 ) b , T 2 ( w ) x ( 0 ) c
= P { w : ( x ( 0 ) , x 1 , x ( 2 ) ) ( a , b , c ) }
The last holds but with only one equality because B B ( Ω ) , we have that
P A = 1 , P ( B ) P ( B A ) = 1 P ( B c A c 1 P B c + P A c = 1 P B c = P ( B ) , so P ( B ) = P ( B A ) . Let B = ω : x ( 0 ) a , T ( ω ) x ( 0 ) b , T 2 ( w ) x ( 0 ) c , A = { T ( ω ) = F ( ω ) } , then the conclusion holds. □

References

  1. Noorazar, H. Recent Advances in Opinion Propagation Dynamics: A 2020 Survey. Eur. Phys. J. Plus 2020, 135, 20. [Google Scholar] [CrossRef]
  2. Friedkin, N.E. Social Influence Network Theory: A Sociological Examination of Small Group Dynamics; Cambridge University Press: Cambridge, UK, 2011. [Google Scholar]
  3. Friedkin, N.E. Theoretical Foundations for Centrality Measures. Am. J. Sociol. 1991, 96, 1478–1504. [Google Scholar] [CrossRef]
  4. Melamed, D.; Savage, S.V. Status, Faction Sizes, and Social Influence: Testing the Theoretical Mechanism. Am. J. Sociol. 2016, 122, 201–232. [Google Scholar] [CrossRef] [PubMed]
  5. Peng, L.Ü. Life Cycle Model of Online Group Behavior. J. Soc. Sci. Hunan Norm. Univ. 2021, 50, 1–14. [Google Scholar]
  6. Hegselmann, R.; Krause, U. Truth and Cognitive Division of Labour First Steps towards a Computer Aided Social Epistemology. JASSS-J. Artif. Soc. Soc. Simul. 2006, 9, 28. [Google Scholar]
  7. Acemoglu, D.; Ozdaglar, A. Opinion Dynamics and Learning in Social Networks. Dyn. Games Appl. 2011, 1, 3–49. [Google Scholar] [CrossRef]
  8. Stauffer, D.; Meyer-Ortmanns, H. Simulation of Consensus Model of Deftuant Et Al. On a Barabasi-Albert Network. Int. J. Mod. Phys. C 2004, 15, 241–246. [Google Scholar] [CrossRef]
  9. Bruns, A. Echo Chamber? What Echo Chamber? Reviewing the Evidence. In Proceedings of the 6th Biennial Future of Journalism Conference, Cardiff, UK, 14–15 September 2017. [Google Scholar]
  10. Terren, L.; Borge-Bravo, R. Echo Chambers on Social Media: A Systematic Review of the Literature. Rev. Commun. Res. 2021, 9, 99–118. [Google Scholar] [CrossRef]
  11. Das, A.; Gollapudi, S.; Munagala, K. Modeling Opinion Dynamics in Social Networks. In Proceedings of the ACM International Conference on Web Search & Data Mining, New York, NY, USA, 24–28 February 2014. [Google Scholar]
  12. Ferraioli, D.; Ventre, C. Social Pressure in Opinion Dynamics. Theor. Comput. Sci. 2019, 795, 345–361. [Google Scholar] [CrossRef]
  13. Cheng, C.; Yu, C.B. Opinion Dynamics with Bounded Confidence and Group Pressure. Phys. A-Stat. Mech. Its Appl. 2019, 532, 9. [Google Scholar] [CrossRef]
  14. Mudrack, P.E. Group Cohesiveness and Productivity: A Closer Look. Hum. Relat. 1989, 42, 771–785. [Google Scholar] [CrossRef]
  15. Janis, I.L. Groupthink. IEEE Eng. Manag. Rev. 2008, 36, 36. [Google Scholar] [CrossRef]
  16. Chitra, U.; Musco, C. Analyzing the Impact of Filter Bubbles on Social Network Polarization. In Proceedings of the 13th International Conference on Web Search and Data Mining, Online, 10–13 July 2020. [Google Scholar]
  17. Pariser, E. The Filter Bubble: What the Internet Is Hiding from You; Penguin: London, UK, 2011. [Google Scholar]
  18. Liu, S.; Guan, X.; Luo, S.; Luo, S. Consensus, Bi-Polarization and Multiformity in Opinion Dynamics with Bidirectional Thresholds; Dalian University of Technology & Dalian Maritime University: Dalian, China, 2020. [Google Scholar]
  19. Castellano, C.; Fortunato, S.; Loreto, V. Statistical Physics of Social Dynamics. Rev. Mod. Phys. 2009, 81, 591–646. [Google Scholar] [CrossRef]
  20. Han, W.; Huang, C.; Yang, J. Opinion Clusters in a Modified Hegselmann-Krause Model with Heterogeneous Bounded Confidences and Stubbornness. Phys. A-Stat. Mech. Its Appl. 2019, 531, 9. [Google Scholar] [CrossRef]
  21. Zhang, J.B. Convergence Analysis for Asymmetric Deffuant-Weisbuch Model. Kybernetika 2014, 50, 32–45. [Google Scholar] [CrossRef]
  22. Zhao, Y.; Zhang, L.; Tang, M.; Kou, G. Bounded Confidence Opinion Dynamics with Opinion Leaders and Environmental Noises. Comput. Oper. Res. 2016, 74, 205–213. [Google Scholar] [CrossRef]
  23. Jadbabaie, A.; Makur, A.; Mossel, E.; Salhab, R. Inference in Opinion Dynamics under Social Pressure. IEEE Trans. Autom. Control. 2023, 68, 3377–3392. [Google Scholar] [CrossRef]
  24. Wang, L.; Bernardo, C.; Hong, Y.; Vasca, F.; Shi, G.; Altafini, C. Consensus in Concatenated Opinion Dynamics with Stubborn Agents. IEEE Trans. Autom. Control 2022, 68, 4008–4023. [Google Scholar] [CrossRef]
  25. Tarra, S.; Mukherjee, D.; Menon, P.P. Opinion Dynamics with Stubborn Agents over a Cycle. In Proceedings of the 2023 European Control Conference (ECC), Bucharest, Romania, 13–16 June 2023. [Google Scholar]
  26. Zhou, Q.; Wu, Z.; Altalhi, A.H.; Herrera, F. A Two-Step Communication Opinion Dynamics Model with Self-Persistence and Influence Index for Social Networks Based on the Degroot Model. Inf. Sci. 2020, 519, 363–381. [Google Scholar] [CrossRef]
  27. Liu, L.; Wang, X.; Chen, X.; Tang, S.; Zheng, Z. Modeling Confirmation Bias and Peer Pressure in Opinion Dynamics. Front. Phys. 2021, 9, 649852. [Google Scholar] [CrossRef]
  28. Hou, J.; Li, W.; Jiang, M. Proceedings of the Opinion Dynamics in Modified Expressed and Private Model with Bounded Confidence. Phys. A Stat. Mech. Jiang Its Appl. 2021, 574, 125968. [Google Scholar] [CrossRef]
  29. Lorenz, J. Continuous Opinion Dynamics under Bounded Confidence: A Survey. Int. J. Mod. Phys. C 2007, 18, 1819–1838. [Google Scholar] [CrossRef]
  30. Wang, C.Q. Opinion Dynamics with Higher-Order Bounded Confidence. Entropy 2022, 24, 1300. [Google Scholar] [CrossRef]
  31. Blondel, V.D.; Hendrickx, J.M.; Tsitsiklis, J.N. On Krause’s Multi-Agent Consensus Model with State-Dependent Connectivity. Ieee Trans. Autom. Control. 2009, 54, 2586–2597. [Google Scholar] [CrossRef]
  32. Touri, B. Product of Random Stochastic Matrices and Distributed Averaging; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2012. [Google Scholar]
  33. Wei, S.; Chen, G. Stochastic Opinion Dynamics; Metallurgical Industry Press: Beijing, China, 2021. [Google Scholar]
  34. Chen, G.; Su, W.; Mei, W.J.; Bullo, F. Convergence Properties of the Heterogeneous Deffuant-Weisbuch Model. Automatica 2020, 114, 9. [Google Scholar] [CrossRef]
  35. Zhang, J.; Chen, G.; Hong, Y. Convergence Analysis of Asymmetric Homogeneous Deffuant-Weisbuch Model. In Proceedings of the 2012 24th Chinese Control and Decision Conference (CCDC), Taiyuan, China, 23–25 May 2012. [Google Scholar]
  36. Zhang, J.; Hong, Y. Convergence Analysis of Heterogeneous Deffuant-Weisbuch Model. In Proceedings of the 31st Chinese Control Conference, Hefei, China, 25–27 July 2012. [Google Scholar]
  37. Bianchi, C.; Cirillo, P.; Gallegati, M.; Vagliasindi, P.A. Validating and Calibrating Agent-Based Models: A Case Study. Comput. Econ. 2007, 30, 245–264. [Google Scholar] [CrossRef]
  38. Carpentras, D.; Maher, P.J.; O’Reilly, C.; Quayle, M. Deriving an Opinion Dynamics Model from Experimental Data. J. Artif. Soc. Quayle Soc. Simul. 2022, 25, 4. [Google Scholar] [CrossRef]
  39. Zhao, J.H.; Wan, K.W. Research on the Communication Dynamics Model of Social Network Public Opinion Based on the Sis Model. Inf. Sci. 2017, 32, 5. [Google Scholar]
  40. Li, G. Research of a Public Opinion Evolution Model Based on Opinion Leaders through Game and Memory. Master’s Thesis, Huazhong University of Science and Technology, Wuhan, China, 2018. [Google Scholar]
  41. Zhu, J.; Yao, Y.; Tang, W.; Zhang, H. Dynamic Parameter Calibration Framework for Opinion Dynamics Models. Entropy 2022, 24, 1112. [Google Scholar] [CrossRef]
  42. Okawa, M.; Iwata, T. Predicting Opinion Dynamics via Sociologically-Informed Neural Networks. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, 14–18 August 2022. [Google Scholar]
  43. Kukacka, J.; Barunik, J. Estimation of Financial Agent-Based Models with Simulated Maximum Likelihood. J. Econ. Dyn. Control 2017, 85, 21–45. [Google Scholar] [CrossRef]
  44. Grazzini, J.; Richiardi, M.G.; Tsionas, M. Bayesian Estimation of Agent-Based Models. J. Econ. Dyn. Control 2017, 77, 26–47. [Google Scholar] [CrossRef]
  45. Hoff, P.D. A First Course in Bayesian Statistical Methods; Springer: Berlin/Heidelberg, Germany, 2009; Volume 580. [Google Scholar]
  46. Barabási, A.L. Philosophical Transactions of the Royal Society A: Mathematical, Physical, and Engineering Sciences. Netw. Sci. 2013, 371, 20120375. [Google Scholar]
  47. Kozitsin, I.V. Opinion Dynamics of Online Social Network Users: A Micro-Level Analysis. arXiv 2020, arXiv:2011.00864. [Google Scholar] [CrossRef]
  48. Rey, S.I.; Reyes, P.; Silva, A. Evolution of Social Power for Opinion Dynamics Networks. 2017. Available online: https://hal.science/hal-01636648/file/evolution.pdf (accessed on 18 January 2018).
  49. Lu, T. Stochastic Generalized Function Analysis and Application; China Ocean University Press: Qingdao, China, 1990. [Google Scholar]
  50. Xu, K.; Zhu, L. Nonparametric Two-Sample Tests for Equality of Distributions Using Projections. Sci. Sin. (Math.) 2022, 52, 1183–1202. [Google Scholar]
  51. Zhou, Z. Symbolic Dynamical Systems; Shanghai Science and Technology Education Press: Shanghai, China, 1997. [Google Scholar]
  52. Blanchard, F.; Glasner, E.; Kolyada, S.; Maass, A. On Li-Yorke Pairs. J. Reine Angew. Math. 2002, 547, 51–68. [Google Scholar] [CrossRef]
  53. Silverman, B.W. Density Estimation for Statistics and Data Analysis; CRC Press: Boca Raton, FL, USA, 1986. [Google Scholar]
Figure 1. The framework of our model.
Figure 1. The framework of our model.
Entropy 25 01219 g001
Figure 2. (ac) Opinion-Time Chart, social learning rate ui = u = 0.5; pressure coefficient ki = k = 0.1; (ac) are simulated on the complete graph/complete graph/connected graph, respectively. Note: The opinion time chart refers to the horizontal axis reflecting time/the vertical axis reflecting opinion values.
Figure 2. (ac) Opinion-Time Chart, social learning rate ui = u = 0.5; pressure coefficient ki = k = 0.1; (ac) are simulated on the complete graph/complete graph/connected graph, respectively. Note: The opinion time chart refers to the horizontal axis reflecting time/the vertical axis reflecting opinion values.
Entropy 25 01219 g002
Figure 3. Opinion-Time Chart (ai) (social learning rate ui = u = 0.5/pressure coefficient ki = k = 0.1).
Figure 3. Opinion-Time Chart (ai) (social learning rate ui = u = 0.5/pressure coefficient ki = k = 0.1).
Entropy 25 01219 g003aEntropy 25 01219 g003b
Figure 4. (af) Opinion-Time Chart (d = 0.4/d* = 5).
Figure 4. (af) Opinion-Time Chart (d = 0.4/d* = 5).
Entropy 25 01219 g004
Figure 5. (ad) Frequency of global consensus (or “synchronization”) reached by the model under different d*/d.
Figure 5. (ad) Frequency of global consensus (or “synchronization”) reached by the model under different d*/d.
Entropy 25 01219 g005
Figure 6. (al) Distribution of Consensus Numbers for Given d/d*, d*/d.
Figure 6. (al) Distribution of Consensus Numbers for Given d/d*, d*/d.
Entropy 25 01219 g006
Figure 7. (a,b) Opinion-Time Chart (u = 0.5, d* = 5, D = 0.4).
Figure 7. (a,b) Opinion-Time Chart (u = 0.5, d* = 5, D = 0.4).
Entropy 25 01219 g007
Figure 8. (af) Opinion-Time chart (d* = 5/k = 0.1).
Figure 8. (af) Opinion-Time chart (d* = 5/k = 0.1).
Entropy 25 01219 g008
Figure 9. (a,b) Opinion-Time Graph (d = 0.6 d* = 8 k = 0.1).
Figure 9. (a,b) Opinion-Time Graph (d = 0.6 d* = 8 k = 0.1).
Entropy 25 01219 g009
Figure 10. (al) Opinion-Time chart (probability of ui being a positive number is p, d* = 5, k = 0.1).
Figure 10. (al) Opinion-Time chart (probability of ui being a positive number is p, d* = 5, k = 0.1).
Entropy 25 01219 g010
Figure 11. The following image reflects the accuracy of the model in predicting five political positions as well as specific numerical deviations.
Figure 11. The following image reflects the accuracy of the model in predicting five political positions as well as specific numerical deviations.
Entropy 25 01219 g011
Figure 12. (1) (a,b) represent the scatter plots drawn by the data points of (real_openion, simulation_opinion). (2) (c,d) show the frequency distribution histograms of the real opinions (yellow) and the simulated opinions (green) at different times, respectively.
Figure 12. (1) (a,b) represent the scatter plots drawn by the data points of (real_openion, simulation_opinion). (2) (c,d) show the frequency distribution histograms of the real opinions (yellow) and the simulated opinions (green) at different times, respectively.
Entropy 25 01219 g012
Table 1. Ideal Synchronization Theory.
Table 1. Ideal Synchronization Theory.
Ideal Synchronization TheoryHigh Reachability (H)Cocoon House Effect (C)Low Reachability (L)
Assimilation (A)Global consensusHigh: <—/—Local consensus
Low: <—/—
Exclusion (E)Chaos-------------------------Other phenomena
Table 2. Estimation Results.
Table 2. Estimation Results.
u/Bayesian Factor
(0.1–0.5)
d/Bayesian Factor
(0.1–0.5)
k/Bayesian Factor
(0–0.1)
0.2114; 6.720.178; 8.310.102; 5.44
ui meandi meanki mean
0.0940.1020.037
Table 3. Test Results.
Table 3. Test Results.
Values of Statistics for the Same Distribution Test F(w) Distribution
T1(w) distributionp value: 0.46
T2(w) distributionp value: 0.37
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Ding, F.; Li, Y.; Ding, K. Bounded Confidence and Cohesion-Moderated Pressure: A General Model for the Large-Scale Dynamics of Ordered Opinion. Entropy 2023, 25, 1219. https://doi.org/10.3390/e25081219

AMA Style

Ding F, Li Y, Ding K. Bounded Confidence and Cohesion-Moderated Pressure: A General Model for the Large-Scale Dynamics of Ordered Opinion. Entropy. 2023; 25(8):1219. https://doi.org/10.3390/e25081219

Chicago/Turabian Style

Ding, Fangyikuang, Yang Li, and Kejian Ding. 2023. "Bounded Confidence and Cohesion-Moderated Pressure: A General Model for the Large-Scale Dynamics of Ordered Opinion" Entropy 25, no. 8: 1219. https://doi.org/10.3390/e25081219

APA Style

Ding, F., Li, Y., & Ding, K. (2023). Bounded Confidence and Cohesion-Moderated Pressure: A General Model for the Large-Scale Dynamics of Ordered Opinion. Entropy, 25(8), 1219. https://doi.org/10.3390/e25081219

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop