Macroscopic Noisy Bounded Confidence Models with Distributed Radical Opinions
M. A. S. Kolarijani, A. V. Proskurnikov, P. Mohajerin Esfahani

TL;DR
This paper analyzes a nonlinear Fokker-Planck equation modeling opinion dynamics with environmental noise and radical opinions, establishing mathematical properties, stability conditions, and numerical methods to understand opinion clustering and transitions.
Contribution
It provides the first rigorous analysis of the well-posedness, stability, and clustering behavior of macroscopic opinion models influenced by radicals and noise, with validated numerical schemes.
Findings
Proved well-posedness and existence of stationary solutions.
Derived explicit noise bounds for exponential convergence.
Developed numerical schemes for clustering analysis.
Abstract
In this article, we study the nonlinear Fokker-Planck (FP) equation that arises as a mean-field (macroscopic) approximation of bounded confidence opinion dynamics, where opinions are influenced by environmental noises and opinions of radicals (stubborn individuals). The distribution of radical opinions serves as an infinite-dimensional exogenous input to the FP equation, visibly influencing the steady opinion profile. We establish mathematical properties of the FP equation. In particular, we (i) show the well-posedness of the dynamic equation, (ii) provide existence result accompanied by a quantitative global estimate for the corresponding stationary solution, and (iii) establish an explicit lower bound on the noise level that guarantees exponential convergence of the dynamics to stationary state. Combining the results in (ii) and (iii) readily yields the input-output stability of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Macroscopic Noisy Bounded Confidence Models
with Distributed Radical Opinions
M. A. S. Kolarijani, A. V. Proskurnikov, and P. Mohajerin Esfahani
Abstract.
In this article, we study the nonlinear Fokker-Planck (FP) equation that arises as a mean-field (macroscopic) approximation of bounded confidence opinion dynamics, where opinions are influenced by environmental noises and opinions of radicals (stubborn individuals). The distribution of radical opinions serves as an infinite-dimensional exogenous input to the FP equation, visibly influencing the steady opinion profile. We establish mathematical properties of the FP equation. In particular, we (i) show the well-posedness of the dynamic equation, (ii) provide existence result accompanied by a quantitative global estimate for the corresponding stationary solution, and (iii) establish an explicit lower bound on the noise level that guarantees exponential convergence of the dynamics to stationary state. Combining the results in (ii) and (iii) readily yields the input-output stability of the system for sufficiently large noises.
Next, using Fourier analysis, the structure of opinion clusters under the uniform initial distribution is examined. Specifically, two numerical schemes for identification of order-disorder transition and characterization of initial clustering behavior are provided. The results of analysis are validated through several numerical simulations of the continuum-agent model (partial differential equation) and the corresponding discrete-agent model (interacting stochastic differential equations) for a particular distribution of radicals.
M.A.S. Kolarijani and P. Mohajerin Esfahani are with Delft Center for Systems and Control, Delft University of Technology, Delft, The Netherlands. Email: {M.A.SharifiKolarijani, P.MohajerinEsfahani}@tudelft.nl.
A.V. Proskurnikov is with Department of Electronics and Telecommunications, Politecnico di Torino, Turin, Italy and also with the Institute for Problems of Mechanical Engineering, Russian Academy of Sciences (IPME RAS). Email: [email protected].
1. Introduction
Recent decades have witnessed enormous progress in study of complex systems and their system-theoretic properties [1, 2]. The main effort has been invested into study of “self-organization” and “spontaneous order” phenomena [3] that have inspired the development of synchronization and consensus theory [4, 5]. Paradoxically, these regular behaviors arising from local interactions between subsystems (agents, nodes) of a complex system are studied much better than various “irregular” dynamic effects such as persistent disagreement and clustering, exhibited by many real-world systems. Although some culprits of this asynchrony and dissent (e.g. symmetries and other special structures in the coupling mechanisms, exogenous forces acting on some nodes, heterogeneous dynamics of nodes, etc.) have been revealed in the literature [6, 7, 8, 9, 10], only a few mathematical models have been proposed that are sufficiently “rich” to capture the diversity of clustering behaviors in real-world networks and, at the same time, admit rigorous analysis. Long before the recent “boom” in complex systems, the lack of such models was realized in mathematical sociology. The problem of disclosing mechanisms preventing consensus and maintaining enduring disagreement between individuals [11] is nowadays referred to as the community cleavage problem or Abelson’s diversity puzzle [12, 13]. The interdisciplinary area of sociodynamical modeling [14, 15, 16, 13, 17, 18, 19, 20] has attracted enormous attention of the research community and is primarily concerned with mechanisms of opinion formation under social influence.
Only few models, proposed in the literature to describe opinion formation processes, have been secured by experimental evidence. Such models, however, play an important role and contribute, in various aspects, in comprehending complex systems’ behaviors such as birth, death and evolution of clusters in systems of interacting particles, and in developing algorithms for control of these behaviors. This explains explosion of interest in models of “opinion formation” in systems and control literature. From the control-theoretic prospect, most of these models are simply networks of interacting agents, obeying the first-order integrator model. However, the term “opinion” is now widespread and used to denote the scalar or multi-dimensional state of an agent, even if this state does not have a clear sociological interpretation111From the sociological viewpoint, opinions are cognitive orientations of individuals towards some objects or topics [13]. (belonging, e.g., to an abstract manifold [21]). The opinion is thus some value of interest, held by an agent and updated, based on displayed opinions of the other agents.
Nowadays, linear models of opinion dynamics, extending the classical French-DeGroot system in various directions (allowing, e.g., stubborn agents, asynchronous interactions and repulsion of opinions [22, 13, 17, 23]) have been thoroughly studied. These models are sufficient to explain consensus and disagreement in social groups, as well as formation of special opinion profiles (e.g., bimodal distributions, standing for opinion polarization), however, general mechanisms leading to emergence and destruction of unequal clusters are still far from being well understood. To explain them, more complicated nonlinear models have been proposed, mimicking some important features of social influence. One feature observed in social and biological systems is the homophily [24], or tendency of individuals to bond with similar ones. Homophily is related to biased assimilation [25] effects: individuals readily accept opinions consistent with their views and tend to dismiss and discount opinions contradicting to their own views. Mathematically, coupling between close opinions is stronger than that of distant opinions, which is modeled by introducing opinion-dependent influence weights. Although the possibility of such nonlinearities in opinion dynamics models was mentioned in the pioneering work [11], substantial progress has been primarily achieved in analysis of bounded confidence models proposed several decades later as extensions of the deterministic [26] and randomized gossip-based [27] consensus algorithms for multi-agent networks. Bounded confidence models stipulate that a social actor is insensitive to opinions beyond its bounded confidence set (usually, this set is an open or closed ball, centered at the actor’s own opinion), which makes the graph of interactions among the agents distance-dependent. A detailed survey of bounded confidence models and relevant mathematical results can be found in [18]. Bounded confidence models exhibit convergence of the opinions to some steady values, which can reach consensus or split into several disjoint clusters. If the state-dependent interaction graph of the system is symmetric, this follows from general properties of iterative averaging procedures, and can alternatively be proved by exploring a special Lyapunov function (“kinetic energy”) [28, 18, 29]. In the general case of asymmetric interaction graphs, such a convergence has been proved only in special situations [30, 29], but seems to be a generic behavior [31, 32, 30].
Opinions in real social groups, however, usually do not terminate at steady values yet oscillate, which is usually explained by two factors. The first reason explaining opinion fluctuation is exogenous influence, which can be interpreted as some “truth” available to some individuals [33] or a position shared by a group of close-minded opinion leaders or stubborn individulas (“radicals”) [34, 35, 36]. Important results on stability of the HK model with radicals and more general “inertial” bounded confidence models were obtained in [30]. Typically, the exogenous signal is supposed to change slowly compared to the opinion evolution and is thus replaced by a constant; the main concern is the dependence between the constant input and the resulting opinion profile. Numerical results, reported in [34, 35] demonstrate high sensitivity of the opinion clusters to the radical’s opinion and reveal some counter-intuitive effects, e.g., an increase in the number of radicals sometimes decreases the number of their followers. The second culprit of persistent opinion fluctuation is uncertainty in the opinion dynamics, usually modeled as a random drift of each opinion. The presence of a random excitation can be interpreted as “free will” and unpredictability of a human’s decision [37]; besides this, randomized opinion dynamics models are broadly adopted in statistical physics [38, 39, 40, 41] to study phase transitions in systems of interacting particles.
Even for the classical models from [26, 27], disclosing the relation between the initial and the terminal opinion profiles remains a challenging problem (including, e.g., the -conjecture [42, 43]). In presence of noise, the analysis becomes even more difficult; some progress in the study of the interplay between confidence range and noise level has been achieved in recent works [44, 45]. One of the important directions in analysis of bounded confidence models is examination of their asymptotic properties as the number of social actors becomes very large and their individual opinions are replaced by infinitesimal “elements”. The arising macroscopic approximations of agent-based models describe the evolution of the distribution of opinion (usually supposed to have a density) and are referred to as density-based [46], continuum-agent [47, 48], Eulerian [49, 50], kinetic [51], hydrodynamical [28] or mean-field [43, 52] models of opinion formation. In the continuous-time situation, the density obeys a nonlinear Fokker-Planck (FP) equation. To study clustering behavior of the macroscopic bounded confidence models, efficient numerical methods have been proposed that are based on Fourier analysis [40, 53, 43].
From practical viewpoint, it is convenient to consider opinions staying in a predefined interval, e.g., . The HK and Deffuant-Weisbuch (DW) models, as well as their continuous-time counterparts [18], imply that starting within the interval, opinions never escape from it. This property, however, is destroyed by arbitrarily small noises. To keep the opinions bounded, some “boundary conditions” are usually introduced. The absorbing boundary condition assumes that the opinions are saturated at the extreme values [math] and [40, 45]; an important result from [45] demonstrates that arbitrarily small noises in this situation destroy clusters and lead to approximate consensus (the maximal deviation of opinions is proportional to the noise level). More interesting are opinion dynamics with the periodic boundary condition, wrapping the interval into a circle. The opinion density on the circle corresponds to a -periodic solution of the FP equation on the real line [53, 54, 43]. A disadvantage of the simple periodic boundary condition is the merging of two extreme opinion values [math] and . To distinguish between these extreme opinions, we incorporate an “almost reflective” (precisely, an even -periodic) boundary condition. Dealing with the macroscopic FP equation, the opinion density is then conveniently represented by an even -periodic solution on the real line. This paper is primarily concerned with mathematical properties of such solutions.
Main Contributions. In this paper, we advance the theory of macroscopic modeling of bounded confidence dynamics. We consider a bounded confidence model with environmental noise which also includes radical opinions, which are not concentrated at a single point (as in [49, 34, 33]) but rather distributed over the interval . The FP equation acquires an (infinite-dimensional) exogenous input, describing the density and total mass of the radical opinions. This setup allows us to consider the interplay between the noise and the distributed radicals concerning the behavior of the system. In particular, for the macroscopic FP equation,
- (i)
the criteria for the existence, uniqueness, and regularity of an even periodic solution are establish (Theorem 2.1);
- (ii)
the existence of stationary solution is studied and a global estimate is provided that bounds the deviation of the stationary state from the uniform distribution (Theorem 2.2);
- (iii)
a sufficient condition is presented for exponential convergence of the dynamics to stationary state (Theorem 2.3). Combining this result with the global estimate of item (ii) renders input-output stability of the system (Corollary 2.4).
Developing ideas from [40, 53, 43], we then use Fourier analysis to characterize the clustering behavior of the system under the uniform initial distribution. Specifically, two numerical schemes are presented to analyze
- (iv)
the interplay between the relative number (mass) of radical agents (with respect to normal agents) and the critical noise level for order-disorder transition (Section 5.2), and
- (v)
the impact of the noise and the radical opinions density on the number and timing of the initial clustering behavior (Section 5.3).
These schemes are then validated through several numerical simulations of the large-scale agent-based and macroscopic density-based models for a particular distributions of radical opinions.
The paper in organized as follows. Section 2 introduces the macroscopic opinion dynamics model in question. Here, we also present our main theoretical results regarding well-posedness and stability of the model. The next two sections are concerned with technical proofs of these results. Section 3 is devoted to the proofs of well-posedness of the dynamics. In Section 4, we examine the properties of the corresponding stationary equation and provide the technical proofs for theoretical results on stability of stationary state. In Section 5, two numerical schemes are presented for characterization of the clustering behavior of the model. These general schemes are then tested in Section 6 for a particular distribution of the radical opinions. These results are accompanied by numerical simulations of both the agent-based and the macroscopic models. Section 7 concludes the paper.
Notations. The convolution of two functions and is denoted by . We note that in our case one of the functions has a compact support, so the integral always exists. For a function we use (respectively, ) to denote the derivatives with respect to (w.r.t.) (respectively, ), so that is the second partial derivative w.r.t. . We also use the notation for the -th order derivative w.r.t. . Let and . We use to denote the the space of probability densities on . That is, if and for all . We also use to denote the space of probability densities on , extended evenly to . That is, is the space of all functions such that and for all . denotes the Banach space of all measurable functions for which . for is used to denote the Sobolev space . We use the subscripts per (respectively, ep) to denote the closed subspace of periodic (respectively, even periodic) functions in the corresponding function space. We denote the dual space of by and we use to denote the corresponding paring of and . We use and to denote strong and weak convergences, respectively, in an appropriate Banach space. A brief overview of function spaces relevant to this study is provided in Appendix A.
2. Model Description and Main Theoretical Results
2.1. Macroscopic Model of Opinion Formation
The conventional bounded confidence model describes opinion formation process in a network of agents. All agents have the same confidence range . Agent ’s opinion at time , denoted by , is (directly) influenced only by the opinions of agents , such that . One of the simplest continuous-time bounded confidence models is as follows [28]
[TABLE]
It can be shown [18] that the opinions obeying the model (1) always converge as , with for all . This corresponds to either consensus ( for all ) of the terminal opinions or their splitting into clusters, comprising one or several coincident opinions. In the latter situation, the distance between each two clusters is greater than .
Dynamics of real opinions (as well as physical processes, portrayed by “opinion dynamics” models) often do not exhibit convergence to steady values, and the fluctuation of opinions persists. In order to capture this effect, random uncertainties can be introduced into the model mimicking “free will” and unpredictability of a human’s decision [37]. The simplest of these uncertainties is an additive random noise. The model (1) is then replaced by the system of nonlinear SDE
[TABLE]
where are independent standard Wiener processes and characterizes the noise level.
Since the dynamics of a stochastic system (2) becomes quite complicated as the number of agents grows, the standard approach to examine it is the mean-field (or macroscopic) approximation, considering the opinion profile as a random sampling drawn from some (time-varying) probability distribution of the opinion. Precisely, it can be shown [55, 56, 57] that empirical distributions converge (in the weak sense) as to a distribution, whose density obeys the FP equation
[TABLE]
A natural extension of the bounded confidence dynamics allows the presence of radicals (stubborn agents, zealots) that do not assimilate others’ opinions, however, influence them directly or indirectly. Typically, the radicals’ opinions are supposed to be constant (or changing very slowly compared to the opinion formation of “normal” agents). Indexing the “normal” individuals through and the radicals through , the opinion dynamics becomes as follows
[TABLE]
Often it is supposed that the radicals share a common opinion for , which may also be considered as some “truth” perceived by some individuals [33] or, more generally, an exogenous signal [34]. The ratio can be treated as the relative “weight” or “strength” of this external opinion. More generally, one can assume that the radicals’ opinions are spread over . Supposing that , the relative mass of the radicals remains constant, and their empirical distribution converges (in the weak sense) to a distribution with sufficiently smooth density , the density of the “normal” opinions obeys the modified FP equation as follows
[TABLE]
Note that the classical bounded confidence dynamics (1), being a special case of continuous-time consensus protocol, has an important property: the minimal and maximal opinions and are, respectively, non-decreasing and non-increasing. In particular, if the initial opinions are confined to some predefined interval, e.g., , then one has for all . The additive noise leads to random drift of the opinion profile, thus destroying the latter important property. Since in practice bounded ranges of opinions are usually considered, the dynamics (2), (5) are usually complemented by boundary conditions [40], preventing the opinions from escaping from the predefined range.
A typical boundary condition is the periodic condition, where the opinion domain is wrapped on a circle of circumference (formally, replacing a real opinion value by its fractional part ). A disadvantage of the periodic boundary condition is that there is no distinction between the extreme opinions [math] and . In this paper, we address this issue by considering another type of boundary condition, which we call even -periodic. Precisely, a real opinion is replaced by , where is an even -periodic function, such that on (and hence for , for and so on). In other words, we first evenly extend the opinion domain into the interval and then wrap it on a circle of circumference so that the extreme opinions [math] and correspond to the antipodes of this circle. We note that with this even -periodic extension, the “effective” boundary condition experienced by the agents is an almost reflective one, that is, when an agent leaves the opinion domain from one end, it is reflected back into the domain from the same end. This is different from the behavior under simple periodic boundary condition where the agents leaving the domain form one end, enter the domain from the other end. However, the introduced boundary condition is “almost” reflective since the even extension causes some boundary effects: the influence of more extreme neighbors of opinion values in the -neighborhood of extreme opinions [math] and is reinforced. This is due to the even extension which introduces more extreme “artificial” neighbors; see Fig. 1.
As discussed in [53, 54, 43], the FP equation (4) under the periodic conditions retains its validity, however, is not a probability density on but a -periodic function , such that (that is, serves as a density on the interval ). Similarly, for the even -periodic boundary condition, the equation (4) retains its validity when we replace the probability density with an even -periodic function, that is, and . On the interval , the function again serves as a probability density: . We also assume that the initial density and the density of radical opinions , defined on , are extended (in the unique possible way) to even -periodic functions on .
In this study, without loss of generality, we take and to be the bounded opinion domain and its even extension, respectively. To summarize the discussion above, the macroscopic model for opinion dynamics considered in this study is fully described by the following PDE
[TABLE]
where
[TABLE]
Note that in (11), we are considering the dynamics over a finite time horizon for the sake of analysis, however, can be chosen arbitrarily large. We again emphasize that the initial density and the radical density are the unique even -periodic extensions of the corresponding densities from to . In essence, we are considering the same dynamics as in [54] with the extra requirement for (and the newly introduced density ) to be even. Finally, we note that [58] also provides a detailed treatment of this dynamics (without radicals) for a class of interaction potentials on a torus in higher dimensions.
2.2. Main Theoretical Results
To recapitulate, we are interested in even -periodic solutions of PDE (11), where and are even -periodic. A natural question arises whether the model is well-posed in the sense that every (sufficiently smooth) initial condition and input correspond to a unique solution. The affirmative answer is given in the following theorem.
Theorem 2.1** (Well-posedness of dynamics).**
Let the initial density of normal opinions and the radical opinions density satisfy and , respectively. Then, PDE (11) has a unique, even, strictly positive, classical solution such that for all .
This result implies that is a (strictly positive) probability density on for all , as required. For the autonomous systems (without radicals), [54, 58] provide a sufficient condition for exponential convergence of the dynamics towards uniform distribution as an equilibrium of the system. Unlike those studies, the uniform distribution is not an equilibrium of the model considered in this study. However, it is possible to extend this stability result to our model including the exogenous input, i.e., the radicals. To this end, we first consider the stationary equation corresponding to PDE (11) given by
[TABLE]
We are particularly interested in even stationary solutions of (13). Our next result characterizes the stationary state of the system.
Theorem 2.2** (Stationary behavior).**
Let be the radical opinions density.
- •
Existence*: the stationary equation (13) has an even, strictly positive, classical solution .*
- •
Estimate*: for any , if , then , where*
[TABLE]
Notice how the global estimate in Theorem 2.2 bounds the difference between the stationary solution and the uniform distribution. This result shows that, even in presence of radical opinions, the stationary solution can be made arbitrarily close to the uniform distribution by increasing the noise level beyond a minimum level . We note that the minimum noise level is directly related to the confidence range and the relative mass . Also, as the “energy” of the radicals increases, in order to counteract their effect and keep the stationary profile in a somewhat uniform state, one must increase the noise level further beyond .
With this result in hand, we can now consider the asymptotic stability of stationary state. The next result provides a sufficient condition for exponential convergence of the dynamics to stationary state for arbitrary (and sufficiently smooth) initial density and radical density .
Theorem 2.3** (Stability).**
Let be the initial density of normal opinions and be the radical opinions density. Also, let with be the solution to the dynamic equation (11). Then, converges to a stationary state exponentially in as if , where uniquely solves
[TABLE]
An immediate result of Theorems 2.2 and 2.3 is that for sufficiently large noises, the dynamics will converge to a stationary state that can be made arbitrarily close to uniform distribution by increasing the noise level.
Corollary 2.4** (Input-output stability).**
For any , if where and are defined in (14) and uniquely solves (15), then it holds that
[TABLE]
where the constant depends on and and the convergence rate depends on , , and .
Remark 2.5** (Connection to existing works).**
The stability result of Corollary 2.4 corresponds to the result reported in [54, Theorem 2.3] on global stability of uniform distribution for sufficiently large noises in the autonomous system without radicals. In particular, by setting in the estimate given in Theorem 2.2, one has , hence is the unique stationary state of the system for . We note that is the same minimum noise level given in [54, Theorem 2.3], taking into account a multiplicative factor of two due to the even extension considered in this study. However, direct application of Theorem 2.3 for stability of leads to a sufficient minimum noise level . This is due to the fact that this result is based on conservative estimates for . Indeed, if one incorporates the fact that and modifies some of the arguments provided in the proof of Theorem 2.3 in Section 4.3, then one can show that, in the absence of radical agents, the uniform distribution is also globally exponentially stable for , reproducing the result of [54, Theorem 2.3].
Finaly, we note that, based on the results provided in [58], the input-output stability result of Corollary 2.4 can be generalized to multi-dimensional first-order stochastic interacting particle systems for a particular class of interaction potentials.
The next two sections are mainly concerned with the technical proofs of the theoretical results listed above.
3. Well-posedness of Dynamics
This section is devoted to the proof of Theorem 2.1 concerning the well-posedness of the dynamics (11). Throughout this section, all the norms are w.r.t. (as opposed to ), unless indicated otherwise. We use to represent a generic constant (depending on the model parameters) which actual values may change from line to line. In case these constants depend on a particular object of interest, say , this dependence is explicitly indicated by .
Let us first note that because of periodicity, the mass is preserved in (11), that is,
[TABLE]
for all . In particular, we have
[TABLE]
We will be using this property in the sequel.
We start by presenting some useful estimates for the object defined in (12) that make it possible to extend the results provided by [54] to our model.
Lemma 3.1** (Estimates for ).**
Let be the function defined in (12) with . If , then
[TABLE]
If, moreover, , then
[TABLE]
Proof.
Notice
[TABLE]
from which we can conclude the inequality (17). The first inequality in (18) then immediately follows from (17) and the assumption . For the second inequality in (18) notice that since is of finite measure , for any measurable function we have
[TABLE]
where . ∎
Using the estimate (18) in Lemma 3.1, one can follow similar arguments as in [54, Lemma 2.1] to show and for all ; see also [54, Corollary 2.2]. Specifically, assuming PDE (11) has a solution , one can derive a priori estimate which in turn implies that the solution is non-negative so that is a probability distribution on for all .
Lemma 3.2** (Estimates for ).**
Let be the function defined in (12) with .
- (i)
For , if with , then
[TABLE]
- (ii)
For , if with , then
[TABLE]
Proof.
We have
[TABLE]
which leads to the first inequality in (20). Using the fact that (see (19)), we have the second inequality in (20). Computing the higher order derivatives w.r.t. , we obtain for
[TABLE]
Hence,
[TABLE]
where for the last inequality we used the fact that . ∎
Lemma 3.3** (More estimates for ).**
Let , , and with . Then for
[TABLE]
Proof.
Notice
[TABLE]
For the first term on the right hand side (r.h.s.) of (24), we have
[TABLE]
where for the second inequality we used (18). Also, using Leibniz rule, for the second term on the r.h.s. of (24) we can write
[TABLE]
where for the last inequality we used Morrey’s inequality which implies
[TABLE]
Now, from (20) we have for
[TABLE]
and from (21) we have for
[TABLE]
Putting all these estimates together while keeping only the highest Sobolev norms, we obtain
[TABLE]
∎
Remark 3.4** (Connection to existing works).**
Lemma 3.3 is an extension of [54, Proposition 4.1].
With these estimates in hand, we can follow the same arguments as in [54] to show well-posedness of the dynamics described by PDE (11).
Sketch of proof of Theorem 2.1.
Consider the following sequence of PDEs
[TABLE]
with smooth initial and radical distributions for now. By standard results on linear parabolic PDEs [59, Chapter 7], there exists a sequence in that satisfies (28). Furthermore, using the estimate (18) in Lemma 3.1, one can follow the same procedure provided in [54, Proposition 3.1] to show , and hence, for all and ; see also [54, Corollary 3.2].
Remark 3.5** (Evenness of ).**
One can use the evenness of and to show that the unique solutions to PDEs (28) are also even in for all . However, since this property will not be used for existence, uniqueness and regularity results provided below, we will postpone this argument to later when we deal with the evenness of the unique solution to PDE (11).
Existence with smooth data. Using Lemmas 3.1 and 3.2 and following a similar idea as in [54, Lemmas 3.5 and 3.7], we can obtain the following convergence results for a limiting object
[TABLE]
where denotes a subsequence. Moreover, we have the following estimate for and
[TABLE]
We claim that is the unique weak solution to (11). That is, solves the weak formulation of (11) defined as
[TABLE]
for any . To show this, we multiply (28) by with and integrate to obtain
[TABLE]
For the first two terms in (34), using convergence results (31) and (30), we have as
[TABLE]
and
[TABLE]
Also, the last term in (34) can be written as
[TABLE]
The limit of the first integral in (35) is zero as . Indeed, we know is bounded by the inequality (17) in Lemma 3.1, hence, . Also, (30) implies in . The limit of the second integral in (35) is also zero as . For this integral, we have
[TABLE]
where for the second inequality we used (32) and the fact that by Lemma 12 (set in (17)). Now, notice . Hence,
[TABLE]
as by the strong convergence (29). Putting all these results together, we see that indeed satisfies the weak formulation (33).
To complete the existence result, we have to show . This condition makes sense since by [54, Theorem 3.8] and the convergence results (30) and (31). Pick some with and rewrite the weak formulation (33) as
[TABLE]
Similarly, since , we have
[TABLE]
Let in (37), so for arbitrary we obtain from (37) and (36) that
[TABLE]
which implies .
Relaxed regularity on data. In order to relax regularity assumption on data to , we can use the mollified version of the distributions and with the standard positive mollifier , follow the same procedure and take the limit at the end. See also [54, Theorem 3.12] for the details of this process.
Uniquness. Let where and are two weak solutions to (11) with . Then, for every we have
[TABLE]
We can rewrite the last integrand as
[TABLE]
to obtain
[TABLE]
Now, for the first integral on the r.h.s. of (38), we have
[TABLE]
where for the first inequality we used (17) in Lemma 3.1 and Cauchy-Schwarz inequality, and for the second inequality we used Young’s inequality. Similarly, for the the second integral on the r.h.s. of (38), we have
[TABLE]
where for the second inequality we used (32) and Lemma 3.1 (see (18) and (19)). Using (3) and (3) for (38) and setting , we obtain
[TABLE]
By [54, Theorem 3.8], we know
[TABLE]
Thus, for all , we have
[TABLE]
This implies, for a.e.
[TABLE]
Hence, by Grönwall’s inequality,
[TABLE]
This implies since . Then, from continuity of and in time (by [54, Theorem 3.8]), we obtain uniqueness. That is, for all .
Regularity. Here, we first mollify the problem data and with the standard positive mollifier so that the solutions to (28) are all smooth. This allows us to take derivatives of (28) to any order. We then take the limit at the end. For simplicity, we omit the arguments for this last step and drop the subscript .
Employing Lemma 3.3, we can extend the improved regularity results in space in [54] (Theorem 4.2). That is, for and , we have
[TABLE]
Moreover, since is constant in time, we can also employ the results on improved regularity in time provided by [54, Theorem 4.3] for our model. This means, for and , we have for
[TABLE]
and
[TABLE]
With these regularity results in space and time, we can derive the required regularity on the solution as stated in Theorem 2.1. Let and and be the unique weak solution to PDE (11). By (41), we have . Hence, by Sobolev embedding theorem [60, Section 4.12], we have (after possibly being redefined on a set of measure zero). This gives the required regularity in space. Also, (42) and (43) imply that and . Hence, by [54, Theorem 3.8], we have (after possibly being redefined on a set of measure zero). This gives the required regularity in time. Putting these results together, we have .
Evenness. The evenness imposed on and implies that if is a solution of (11), then is also a solution. Indeed, from (11) we obtain
[TABLE]
where for that last equality we used the fact that is an odd function. Then, assuming and (notice that ), the uniqueness of the solution to PDE (11) implies that the solution is even, that is, .
Positivity. Using the same approach as in [58], we consider the following version of (11) in the unknown function with being the non-negative weak solution
[TABLE]
This is a linear parabolic PDE with smooth and bounded coefficients (by Lemmas 3.1 and 3.2) for which is a classic non-negative solution. Thus, by parabolic Harnack inequality [59, Section 7.1.4, Theorem 10], we have
[TABLE]
for and some positive constant . Non-negativity of implies that and hence is strictly positive for all . ∎
4. Stationary Behavior and Stability
4.1. Existence of Stationary Solution
This section mainly concerns the proof of existence result in Theorem 2.2 for stationary equation (13). All the norms in this section are w.r.t. (as opposed to ), unless indicated otherwise. We note that norms on the even -periodic spaces computed w.r.t. to and differ by a multiplicative constant, e.g., . We again use to represent a generic constant (depending on the model parameters) which actual values may change from line to line. In case these constants depend on a particular object of interest, say , this dependence is explicitly indicated by .
Let us begin with providing a fixed point characterization of the solution to stationary equation (13). We note that, corresponding to the solution to dynamic equation (11), we are particularly interested in even solutions of stationary equation (13).
Lemma 4.1** (Fixed point characterization).**
* is a solution of stationary equation (13) if and only if is a fixed point of the operator defined by*
[TABLE]
where the constant is determined by the normalizing condition
[TABLE]
Proof.
The “if” part is clear since any fixed point satisfies the stationary equation (13). For the “only if” part, note that integrating (13) once, we have
[TABLE]
Now notice that we can set since we are interested in even solutions to (45). Indeed, from (45) we have
[TABLE]
Hence, for an even solution, we obtain
[TABLE]
where we used the fact that is an odd function. This implies . Rearranging and integrating (45) once again, we have
[TABLE]
where the normalizing condition gives the constant as
[TABLE]
This completes the proof. ∎
This characterization allows us to use tools from operator theory, in particular, Schauder fixed point theorem to derive existence result for the stationary solution. Before that, we present some preliminary results for the operator .
Lemma 4.2** (Estimates for ).**
Let be the operator on defined by (44).
- •
If , then
[TABLE]
and
[TABLE]
- •
If , then
[TABLE]
- •
If , then for
[TABLE]
Proof.
From the definition (44) and inequality (17) in Lemma 3.1 we obtain
[TABLE]
which gives the estimate (47).
Now, observe
[TABLE]
Using (17) in Lemma 3.1 and (47), we obtain the inequality (48).
For the inequality (49), first notice
[TABLE]
where for the second inequality we used the fact that is bounded by (47). Also, we have
[TABLE]
where for the second inequality we used (20) in Lemma 3.2 and the last inequality follows from the fact that (see (19)). Inserting this result in (51), we obtain inequality (49).
Similarly, for , we have (see (51))
[TABLE]
Now, notice
[TABLE]
where for the last inequality we used Lemma 3.3. Combining this result with (52), we derive a recursive inequality. Performing the recursive computations while keeping the highest Sobolev norms, we obtain
[TABLE]
Then, since , we can remove the constant and consider its effect in constants . This gives the desired inequality (50). ∎
Proposition 4.3** (Lipschitz continuity of ).**
Let be the operator on defined by (44) with . Then is Lipschitz continuous in for with Lipschitz constant
[TABLE]
Proof.
We use a similar argument to the one provided by [52]. Let . Using the estimate (47) in Lemma 4.2, we have for
[TABLE]
where for the last inequality we used . Now, define
[TABLE]
and observe
[TABLE]
Similarly, we can write the normalizing constant as
[TABLE]
From (4.1), it follows
[TABLE]
and
[TABLE]
Hence,
[TABLE]
Using (4.1) and (56), we can rewrite (4.1) as
[TABLE]
Hence,
[TABLE]
Now, notice that
[TABLE]
(recall that norms are defined over ) and for
[TABLE]
Thus, we have
[TABLE]
Combining (57) and (58), we obtain
[TABLE]
Finally, using (47) in Lemma 4.2 and the inequality (19) which relates norms over domains of finite measure, we have
[TABLE]
where the constant is given by (53). ∎
With this preliminary results in hand, we next move on to the proof of existence result in Theorem 2.2.
Proof of Theorem 2.2 (Existence).
Following essentially the same argument as in [58, Theorem 2.3] and using Lemma 4.1, we can present the existence result for the stationary solution as the fixed point of the operator . First note that using the estimate (47) in Lemma 4.2, we have for some positive constant . Thus, for the purpose of finding the fixed points of , we can restrict to act on the closed and convex set . Now, notice that, using inequalities (47) and (48) in Lemma 4.2, we have for any
[TABLE]
for some constant . That is, is uniformly bounded in . Thus, by the Rellich-Kondrachov compactness theorem [59, Section 5.7, Theorem 1], is precompact in . Since is closed, this implies is also precompact in . Also, is Lipschitz continuous by Proposition 4.3. Hence, by Schauder fixed point theorem [59, Section 9.2.2, Theorem 3], it has a fixed point which by (59) belongs to .
Regularity. The estimate (50) in Lemma (4.2) implies that if , then the fixed point . In particular, if , then . Hence, by Sobolev embedding theorem [60, Section 4.12], (after possibly being redefined on a set of measure zero).
Positivity. The positivity of the fixed point directly follows from the representation (44). ∎
Remark 4.4** (Uniqueness).**
By Proposition 4.3, is Lipschitz continuous in with Lipschitz constant given by (53), and thus, is a contraction for . Hence, by Banach fixed-point theorem [59, Section 9.2.1, Theorem 1], has a unique fixed point for . Setting in (53) gives the sufficient condition for uniqueness of stationary solution. This result corresponds to the sufficient condition provided in [52, Theorem 2].
Remark 4.5** (Semi-Gaussian clusters).**
For a highly concentrated radical opinion distribution with average opinion , we can provide an approximate solution to the stationary equation (13) as follows
[TABLE]
where is the normalizing constant (see Appendix B for the details). This result is an extension of the approximate solution provided by [43, Section 5.2]. In particular, one can reproduce the same result by setting and . Equation (60) shows that for highly concentrated radicals the possible accumulation of normals around the average radical opinion in the stationary state is semi-Gaussian with variance . Note that, as argued in [43], other clusters centered at opinion values other than may also exist. As long as these clusters are well-separated so that inter-cluster influences can be ignored, one can use the same approximation to derive a semi-Gaussian profile for the shape of these clusters (set and in (60) where denotes the center of the corresponding cluster). This analysis shows that affects the shape of the possible cluster formed at the average radical opinion in stationary state.
4.2. Global Estimate for Stationary Solution
This section is devoted to the proof of the estimate given in Theorem 2.2. In this section, all the norms are w.r.t. the domain , unless indicated otherwise.
Proof of Theorem 2.2 (Estimate).
Let so that . From the stationary equation (13) we obtain
[TABLE]
where we used the fact that . Next, we multiply this last equation by and integrate by part over to derive
[TABLE]
The extra terms are zero due to periodicity. Thus,
[TABLE]
Now, using inequality (17) in Lemma 3.1, we obtain
[TABLE]
Also, we have
[TABLE]
Hence,
[TABLE]
Using estimates (4.2) and (4.2), we can obtain form (61) (recall that uniform distribution is not an equilibrium of the system and hence )
[TABLE]
Now, since , we can employ Poincaré inequality [59, Section 5.8.1, Theorem 1] to obtain . The optimal value for the Poincaré constant for is . Combining this result with inequality (4.2), we have
[TABLE]
Defining and as in (14) gives the desired inequality , where . ∎
4.3. Stability of Stationary State
This section is devoted to the proof of Theorem 2.3 concerning stability of stationary state. All the norms in this subsection are w.r.t. the domain (as opposed to ), unless indicated otherwise.
Proof of Theorem 2.3.
We follow similar arguments as the ones in [54], except we consider a general stationary state (instead of the uniform distribution considered in [54]). Let so that . From the dynamic equation (11), we obtain
[TABLE]
where for the last equality we used the fact that is a solution to the stationary equation (13), that is,
[TABLE]
Multiplying (4.3) by and integrating by part over we obtain (the extra terms are zero due to periodicity)
[TABLE]
Now, from inequality (17) in Lemma 3.1, we have
[TABLE]
and
[TABLE]
Also, following a similar procedure as in (4.2) and (4.2) with , we obtain . Finally, from (47) in Lemma 4.2, we have . Using these estimates and the Young’s inequality we can rewrite (4.3) as
[TABLE]
Hence,
[TABLE]
Once again, since , we can employ the Poincaré inequality [59] (Section 5.8.1, Theorem 1) with optimal Poincaré constant to obtain
[TABLE]
Then, by Grönwall’s inequality, we have
[TABLE]
Now, notice that is finite. Thus, if the constant factor in the exponential is negative, then exponentially fast as . Negativity of the this constant factor corresponds to the condition , where solves (15). ∎
5. Characterization of Solution: Fourier Analysis
In this section, we exploit the periodic nature of the system and use Fourier analysis to study the behavior of the solution to the PDE (11) with uniform initial condition . To this end, we derive a system of ordinary differential equations (ODEs) describing the evolution of Fourier coefficients of the normal opinion density . Then, these ODEs are used for identification of the so-called order-disorder transition. In particular, a numerical scheme is presented for approximating the critical noise level at which this transition occurs. Moreover, we use these ODEs to provide another approximation scheme for characterizing the initial clustering behavior of the system including the number and the timing of possible clusters. These numerical schemes are in essence similar to the linear stability analysis previously employed by [37, 61, 40, 53, 43] for analysis of noisy bounded confidence models without radicals.
5.1. Fourier ODEs for Macroscopic Model
Notice that the set is an orthogonal basis for the space containing even -periodic functions on . Then, the even -periodic extension of the probability densities in the model allows us to consider the Fourier expansions of and in the form of
[TABLE]
By inserting the expansions (69) into (11) and setting the inner product of the residual with elements of the basis to zero (in other words, taking inverse Fourier transform), we can obtain a system of quadratic ODEs describing the evolution of Fourier coefficients . Considering the first frequency components , these ODEs are expressed as
[TABLE]
where . Note that for , i.e., the constant term in the Fourier expansion, we obtain . This is due to the periodic nature of the system that preserves the zeroth moment. The coefficients in (70) are given by
[TABLE]
where
[TABLE]
with . Also, recall that are the Fourier coefficients of .
Interestingly, one notices that the interaction between different frequency components in the quadratic terms is limited to those that are in a sense complements of each other. That is, each frequency of is affected by the frequency pairs such that either or . This, in turn, leads to a particular structure for the matrix in the quadratic terms. As expected, a similar behavior is seen in the linear terms: the effect of each frequency of on a given frequency of is modulated by the frequency components and of .
5.2. Order-disorder Transition
A common behavior in noisy interactive particle systems is the order-disorder transition. For large values of , the effect of diffusion process can overcome the attracting forces among agents preventing the system from forming any cluster. This behavior has been analyzed and observed in several noisy bounded confidence models for opinion dynamics. Pineda et. al. used linear stability analysis in [37, 61] to compute the critical noise level above which the clustering behavior diappears for a modified version of Defuant model [27]. The same behavior was also reported in [39] for Defuant model. The same technique of linear stability analysis was used in [43, 53] to compute the critical noise level for noisy HK system similar to our model, except without radicals.
Here, we provide a method for approximating the critical noise level at which the transition occurs. To this end, we linearize the systems at to obtain a system of linear ODEs expressed as
[TABLE]
The vector and the matrix are defined accordingly using the objects and in (81). We emphasize that the linearization (83) is for a uniform initial condition, i.e., for .
Looking at coefficients and in (81), we notice that the noise level only appears in the diagonal entries of such that by increasing , these diagonal entries decrease. That is, for a large enough , all eigenvalues of are negative and the linearized system (83) is stable. This will be our first criterion for determining the critical noise level : the noise level above which all eigenvalues of are negative.
In order to consider the effect of the constant linear growth rates in (83), we further require the stationary values of the linearized system (83) (i.e., the solution to the equation ) to be relatively small. In other words, taking the equilibrium of the linearized system as an approximation of the stationary state , we require to be close to uniform distribution (representing disorder). Similar to the theoretical estimate of Theorem 2.2, we quantify this criterion by using Parseval’s identity and setting
[TABLE]
where the constant determines the level of similarity between and uniform distribution. To sum up, we solve numerically for the minimum level of noise for which is Hurwitz and the inequality (84) holds.
5.3. Initial Clustering Behavior
For noises smaller than the critical noise level , we expect to see a clustering bahvior. In order to characterize the initial clustering behavior, we make use of the exponential growth rate and linear growth rate given in (81). The proposed numerical method is as follows. We ignore the interactions between different frequencies in (70), that is, for each frequency , we consider the equation with (corresponding to uniform initial distribution) for initial evolution of the Fourier coefficient . Then, for a given set of model parameters and radical opinions density , we numerically compute the dominant wave-number with , that is, the unstable mode with the largest exponential growth rate. We speculate that the corresponding trigonometric term is the dominant component of the initial clustering behavior. The sign of depends on the linear growth rate : if , and otherwise.
Considering the even -periodic extension of the model, the dominant wave-form must be interpreted on the interval . Then, the number of initial clusters in the interval resulting from the wave-form is given by
[TABLE]
We also expect that the timing of this initial clustering behavior to be inversely related to the corresponding exponential growth rate . Indeed, by solving for the time for which the solution to the equation is equal to , we can approximate the time to initial clustering as
[TABLE]
A similar approximation has been used in [53] in order to derive the time to the initial clustering using fluctuation theory.
6. Numerical Study
In this section, we provide a numerical study of the model at hand for a particular distribution of radical agents/opinions through simulations of the corresponding discrete- and continuum-agent models. Furthermore, we validate the result of Fourier analysis for identification of order-disorder transition (Section 5.2) and characterization of initial clustering behavior (Section 5.3).
The particular radical distribution considered in this section is a triangular distribution with average and width
[TABLE]
Although this choice may seem specific, it is rich enough for our purposes. In particular, with this choice, the zeroth, first and second moments of the radical opinions density are simply captured by the parameters , and , respectively. Moreover, we assume that the radicals are concentrated around their average opinion, that is, we consider small values of (w.r.t. the confidence range ).
For the discrete-agent model, the SDEs (5) are solved numerically using the Euler-Maruyama method for normal agents with time step . In particular, for the radical agents, we produce a random sample of size from the triangular distribution (91). The initial distribution of normal agents is taken to be uniform, that is, the initial opinions are randomly sampled from a uniform distribution on the interval . For complete correspondence between the discrete- and continuum- agent models, we also consider the effect of even -periodic extension in the simulations of the discrete-agent model. See Appendix C for the details of the numerical scheme. The details of numerical scheme for simulation of the continuum-agent model will be discussed in Section 6.1.
In the sequel, we make use of the order parameter
[TABLE]
introduced by [43] and its continuum counterpart
[TABLE]
to quantify orderedness in the clustering behavior of the model. In words, the order parameter is the (normalized) number/mass of agents that are in -neighborhood of and hence interacting with each other. In particular, in the continuum case, for a uniform distribution of opinions (absolute disorder), while for a single-cluster distribution with all agents residing in an interval of width or less (complete order). In case of a clustered behavior, roughly speaking, the inverse of the order parameter is equal to the number of clusters. We also use the evolution of order parameter to characterize the timing of the clustering behavior.
In all the simulation results reported in this section the width of radicals distribution and the confidence range are fixed at and , respectively.
6.1. Simulation of the Continuum-agent Model
In order to solve the continumm-agent model described by PDF (11) numerically, we use Fourier ODEs (70) to compute the coefficients of Fourier expansion of normal opinion density using the first terms of the expansion. However, regarding the radical opinion density, one notices that the considered triangular distribution does not satisfy the conditions of Theorem 2.1 for well-posedness of PDE (11), that is, . This will not be an issue since we will be working with the projection of the proposed in the Hilbert space . That is, we use the Fourier coefficients of in (70) which for the triangular distribution (91) are given by
[TABLE]
To be precise, we need the Fourier coefficients of for , that is, twice the length of Fourier expansion of ; see the linear terms of (70). For the initial condition, we again consider uniform distribution , which corresponds to and for the Fourier coefficients.
It is also possible to employ a semi-explicit pseudo-spectral method, similar to the one provided by [43], for numerically solving (11); see Appendix D for details of this method for our model. The main difference is that the pseudo-spectral method solves the PDE for a set of discrete points in the space () while solving the Fourier ODEs gives an approximation of the solution in terms of a finite basis for the corresponding Hilbert space.
These two methods (if both converge) result in the same solution. Fig. 2 compares the result of numerical simulations of the model using these two methods for a particular combination of system data. Note that, in these simulations, the number of points for the spacial discretization in pseudo-spectral method is twice the for Fourier ODEs so that the methods are compatible, i.e., both include the same set of frequency components. The left panel of Fig. 2 shows a similar result using these two methods for frequencies. However, as the number of frequencies considered in the simulations are decreased, we see that that the pseudo-spectral method starts to diverge while Fourier ODEs are still stable.
In the remainder of this section, we use the Fourier ODEs (70) with for numerical simulation of the continuum-agent model since they are computationally more efficient.
6.2. Order-disorder Transition
In this section, we numerically study the order-disorder transition in the model. In particular, we consider the effect of the relative mass of radicals on the critical noise level at which this transition occurs. Furthermore, we use our simulation results to examine the approximation scheme presented in Section 5.2. In this regard, we note that the interplay between the confidence range and the critical noise level have been studied in [43]. There, the authors showed that as increases, the critical noise level also increases in such way that for small values of , we observe a first-order transition.
6.2.1. An Illustrative Example
Our model exhibits the same order-disorder transition previously reported for similar noisy HK systems [40, 53, 43]. Fig. 3 shows this effect for a particular combination of system data in the discrete- and continuum-agent models. Notice that for larger than a critical level the clustering behavior almost disappears (see the lower panel corresponding to in Fig. 3(a)). To be more precise, a higher level of noise decreases the life-time of clustering behaviors with larger number of clusters.
This effect can be particularly seen in the evolution of order parameter in Fig. 3(b). In this regard, notice that for noises smaller than the critical noise level (here ) the flat areas in the order parameter in Fig. 3(b) correspond to a clustered behavior, where the number of clusters is equal to the inverse of the order parameter. To illustrate, observe that for and , the system reaches a single-cluster profile around the average radical opinion . Notice, however, for the system first goes through a 2-cluster profile corresponding to the flat area in the blue solid line at height in Fig. 3(b). On the other hand, for , we observe a 2-cluster profile at in Fig. 3(a). Notice, however, how the system goes through 4-cluster and 3-cluster profiles as depicted in Fig. 3(b) (the flat areas in the order parameter). Finally, for , we observe a very fast emergence of a 4-cluster profile (Fig. 3(b)) that has survived until as shown in Fig. 3(a). Here, we also notice that exact position of clusters in the discrete- and continuum-agent models differ. This particular difference between mean-field and agent-based models has been also mentioned by [37, 61]. Indeed, our numerical simulations show that even the number of clusters resulting from mean-field and agent-based models may differ; this also has been reported and explained previously in [43]. Finally, we note that for , the approximation scheme explained in Section 5.2 results in for and for (see (84) for influence of ).
6.2.2. Effect of on
Fig. 4 shows the order parameter derived numerically by simulating the continuum- and discrete-agent models. Notice how for each , as noise increases, the system experiences a transition form order (clustered phase with in the yellow strip) to disorder (with in the dark blue area in the upper part of the plots). Also, we note that the blue strip in the lower part of plots in Fig. 4 represents clustering behaviors with larger number of clusters (similar to the behavior seen for in Fig. 3).
This result shows that as the relative mass of radicals increases, the corresponding critical noise level , above which the system is in disordered state, also increases. The dependence of on is in the form of a concave function. Furthermore, for small values of , the transition seems to be discrete, signaling a first-order transition. However, for large values of the transition becomes blurry. This phenomenon was also reported in [43] for the dependence of the critical noise level on the confidence range . Notice that as increases, the required noise level for disordered behavior also increases. This increase in the noise level leads to wider clusters, which, in turn, makes it difficult to differentiate order from disorder; see, e.g., the panels corresponding to in Fig. 3.
Also shown in Fig. 4 (red lines) is the result of scheme provided in Section 5.2 for approximating the critical noise level. As can be seen, the scheme indeed provides a good approximation of the critical noise level. In particular, the dashed red line (for ) almost perfectly separates the two phases of order and disorder.
6.3. Initial Clustering Behavior
For noises smaller than the critical noise level, agents start to form clusters; see Fig. 3. In particular, we observe a cluster of normal agents around the average radical opinion due to the force field generated by the radicals. Generally, three types of clusters may form: (1) the cluster at the average radical opinion , (2) the cluster(s) at the extreme opinions and/or , and (3) the cluster(s) around opinion values other than . The third type of clusters are expected to perform a random walk with their center of mass moving like a Brownian motion (assuming clusters do not interact). The effective diffusivity of these Brownian motions is inversely related to the size of the cluster, i.e., the number of agents in the cluster. This will result in a process of consecutive merging between these clusters until complete disappearance of them. Detailed descriptions of this process are provided in [53, 43]. Notice however that this description does not apply to cluster(s) formed at and . These clusters are affected by forces other than the normal attractions among the agents within the cluster. The cluster formed at is under influence of radicals and the possible clusters at the extreme opinions are reinforced due to the even -periodic extension considered in our model. The behavior of these clusters (survival or dissolution) depends on their size, the exogenous force acting on them, and the effect of other clusters in their neighborhood.
In this section, we use the analysis scheme provided in Section 5.3 to investigate the effect of the zeroth and first moment of radicals ( and , respectively) on the initial clustering behavior of the model for noises smaller than the critical level. In particular, we investigate the effect of and on the number, position and timing of initial clusters for different values of . We again emphasize that we are considering a concentrated triangular distribution for radical agents and a uniform initial distribution for normal agents. Let us begin with illustrating how the objects introduced in Section 5.3, namely, exponential and linear growth rates and the dominant wave-number, can be used to characterize the initial clustering behavior.
6.3.1. An Illustrative Example
Consider the system data . Fig. 5 depicts the values of the exponential growth rate and the linear growth rate for different frequencies. In Fig. 5(a) we observe that the unstable mode with the maximum exponential growth rate is with . Fig. 5(b) shows that the linear coefficient corresponding to this frequency is . Then, (87) implies that the initial clustering behavior is expected to have clusters. Also, using (88), we obtain for the time to initial clustering.
Fig. 6 shows the time evolution of distribution of normal opinions/agents for the system data corresponding to Fig. 5. For the continuum-agent model, we can see a 5-cluster profile corresponding to the speculated waveform as depicted in Fig. 6(a). A similar clustering behavior is observed in the Monte Carlo simulation of the discrete-agent model in Fig. 6(b). Here, we observe three clear clusters: the cluster at average radical opinion and the two clusters at extreme opinions . However, we observe an almost uniform distribution of normal agents in the opinion range . This is due to the fact that the exact position of the corresponding clusters formed in the discrete-agent model varies within this range. Individual realizations of the discrete model show one, two or three clusters in this range with two clusters being the most frequent behavior as expected. This effect has been also reported by [37] in Monte Carlo simulations of a noisy Defuant model. Furthermore, we notice that the timing object also gives a good approximation for the onset of the corresponding clustering behavior for both continuum- and discrete-agent systems.
6.3.2. Effect of and on Initial Clustering
Performing a similar analysis to the one provided in the example above, we can compute the dominant wave-number (), number of initial clusters () and time to initial clustering () for a general combination of system data. Fig. 7 shows the result of this analysis for different values of and at three different noise levels . Here, we only considered the values since for the boundary effect due to even -periodic extension comes into play.
Comparing the left, middle and right panels of Fig. 7 corresponding to different levels of noise, we observe that as the level of noise increases, the number of clusters in the possible clustering behavior of the system decreases (see Fig. 7(b)), while the timing experiences a general increase (see Fig. 7(c)). This effect has been already shown in Fig. 3. In particular, with respect to the timing, we notice that as the level of noise decreases, the initial clustered profile emerges faster; see Fig. 3(b).
For low levels of noise, e.g., (see the left panels in Fig. 7), the dominant wave-number does not depend on the or . In this case, the most important effect of the first moment of radical opinions density is on the position of clusters. That is, the clustered profile emerges in a way that we observe a particular cluster formed at the average radical opinion . The parameter also affects the timing of the clustering behavior in a periodic fashion. On the other hand, the zeroth moment of radical opinions density only affects the timing of the clustering behavior: as increases, decreases. Fig. 8 shows the simulation results for and compares the evolution of opinions for different values of and . For the continuum model in the the top panels of Fig. 8 we observe that indeed a 4-cluster profile has emerged in all systems. Comparing Figs. 8(a) and 8(b) shows that only affects the timing of clustering behavior. This effect is better seen in Fig. 8(g) where we observe a faster convergence of order parameter for with larger . On the other hand, comparing Figs. 8(b) and 8(c) corresponding to and , respectively, we observe a change in the positioning of the clusters. Monte Carlo simulations of the discrete-agent model reveals that the same general description also holds for this system. This is particularly seen in the time evolution of the order parameter in the discrete-agent model as depicted in Fig. 8(h). However, we once again note that there are differences between the behavior of the continuum- and discrete-agent models. In particular, the evolution of order parameter in Fig. 8(g) shows that the continuum-agent model has seemingly converged to steady-state with four clusters, while this is clearly not the case for the discrete-agent model as can be seen in Fig. 8(h). Indeed, in the discrete-agent model, as described in the beginning of this section, all the possible clusters formed around opinion values other than will necessarily disappear in the steady state profile, where the time required for their disappearance depends on the noise level and particularly the size of these clusters. Hence, unlike the discrete-agent model, for the continuum-agent model (in the limit ), the system may require infinite time for this merging of the clusters to occure. This, in turn, can lead to differet behaviors in the discrete- and continuum-agent models over exponentially large times scales [43]; see also the evolution of order parameter in Fig. 3(b).
As shown in Fig. 7, for higher levels of noise, e.g., , we observe nonlinear effects. That is, and start to affect the dominant wave-number (see the middle and right panels of Fig. 7(a)). Nevertheless, these effects are limited as the number of clusters is still 3 or 4 for , and 2 or 3 for . Besides, we still observe a general increase in the timing of the clustering behavior as decreases. Fig. 9 shows the evolution of normal opinions/agents distribution and the corresponding order parameter for three different combinations of and at the noise level . Once again, in the continuum-agent model we observe a 2-cluster profile for all combinations as shown in the top panels of Fig. 9. For the discrete-agent model, we observe a 3-cluster behavior in which the cluster formed between the two clusters at and has already disappeared for in Fig. 9(f) at . Indeed, our simulations for reveals a single-cluster profile around the average radical opinion after a large enough time; see Fig. 3.
To summarize the discussions above, for concentrated distribution of radicals, the main effect of the zeroth and first moments of radical distribution is on the timing and positioning of the possible clustering behavior, respectively. The number of clusters (to be precise, the life-time of possible transient clustered profiles) is mainly determined by the noise level of the system. This is particularly the case for lower levels of noise.
7. Final Remarks
In this paper, we considered a macroscopic model for bounded confidence opinion dynamics with environmental noise. In particular, we studied the effect of exogenous influence by adding a mass of radical (continuum) agents to the original population of the normal agents. The well-posedness of the continuum dynamics expressed as a nonlinear Fokker-Planck equation was established under some assumptions on the initial density of the normal opinions and the density of radical opinions. The long-term behavior of the model was also discussed by considering the corresponding stationary equation. In this regard, we provided a sufficient condition based on the noise level that guarantees exponential convergence of the dynamics towards the stationary state that can be made arbitrarily close to uniform distribution. In the context of opinion dynamics, we derived a theoretical bound on the minimum noise level required to counteract the effect of radical agents and keep the system in a somewhat uniform state.
Exploiting the periodicity of the considered continuum-agent model, we used Fourier analysis to provide a general framework for characterization of the clustering behavior of the system with uniform initial distribution. We then applied this framework for a particular distribution of radical opinions, namely, a relatively concentrated triangular distribution. In particular, we studied the effect of the relative mass of the radicals on the critical noise level for order-disorder transition. As expected, the analysis showed that for a larger number of radical agents, the critical noise level increases. We note that this result corresponds to the theoretical result on the global estimate for stationary state. However, comparing the theoretical lower bound on the noise level for the global estimate with its counterpart derived numerically, we find that the theoretical bound is quite conservative, which was expected considering its theoretical nature. We also considered the effect of relative mass and average opinion of radicals on the number, timing and positioning of the clusters for noises smaller than the critical noise level. Here, the noise level was shown to be the main factor in determining the number of clusters. Meanwhile, the relative mass of the radicals mainly affects the timing of the clustering behavior, that is, for larger masses of radicals, the clustering behavior is expected to emerge faster. On the other hand, the main effect of the average opinion of the radicals is on the positioning of the clusters; the clusters are positioned in a way that we see a cluster formed around the average opinions of radicals. The numerical simulations of the continuum-agent model and the corresponding discrete-agent model were in agreement with these results.
Appendix A Preliminaries on Function Spaces
The definitions provided here are mostly borrowed from [59]. Let be a sequence in a Banach space with norm . The strong convergence implies , while the weak convergence implies for all bounded linear functionals .
Let be a measurable function on . The -norm of is defined as follows
[TABLE]
Then, denotes the Banach space of all measurable functions for which .
Let be locally summable functions (i.e., have a finite integral over every compact subset of ). We say that is the -th weak (partial) derivative of , if
[TABLE]
for all test functions (infinitely differentiable functions with compact support in ).
for is used to denote the Sobolev space consisting of functions whose weak derivatives up to order exist and belong to . Note that is a Hilbert space.
We use the subscript per to denote the closed subspace of periodic functions in the corresponding function space, e.g.,
[TABLE]
Similarly, we use the subscript ep to denote the closed subspace of even periodic functions in the corresponding function space, e.g.,
[TABLE]
We denote the dual space of by , that is, the space of bounded linear functionals on . Moreover, we use to denote the corresponding paring of and . That is, for and , we use to denote the real number . Since periodic boundary condition allows for integration by parts without extra terms, has most of the properties of the space , the dual space of ; see [59, Section 5.9.1] for a detailed description of the space . In particular, one can extend the result in [59, Section 5.9, Theorem 3] to derive [54, Theorem 3.8]. For reader’s convenience, the corresponding theorem is presented below.
Theorem**.**
[54, Theorem 3.8]** Let the function be such that
[TABLE]
Then, after possibly being redefined on a set of measure zero. Moreover, the mapping is absolutely continuous, with
[TABLE]
for almost every .
Appendix B Approximate Solution to Stationary Equation
In order to provide an approximate solution to the stationary equation (13), we assume radicals are highly concentrated around a particular opinion value . To be precise, we assume that the average opinion of radicals is and the variance of radicals is much smaller than the confidence range . It helps to think of the limit being a point mass of radicals located at opinion value . We further assume that the noise level is also much smaller than so that the inter-cluster influences (from other possible clusters) can be ignored. Using these assumptions, we can expect this particular cluster of normal agents to be concentrated around . This implies that in order to evaluate the integral in (46), we only need to consider values of near . Under these assumptions, for , we can write
[TABLE]
Inserting this result in (46), we have
[TABLE]
which can also be expressed as (by modefyying the normalizing constant )
[TABLE]
In Fig. 3(a), this approximate solution is shown for and , where the system has converged to a single cluster profile in both continuum- and discrete-agent models corresponding to the assumptions for derivation of the approximate solution. This result shows that the approximate solution is indeed a good approximation as it almost perfectly matches the numerical solution of the continuum-agent model.
Appendix C Euler-Maruyama Method for Discrete-agent Model
The interacting SDEs considered for the simulation of the discrete-agent model in this study is
[TABLE]
where are the opinions of normal agents and are the opinions of radical agents with . The superscript corresponds to the even -periodic extension as explained below. In order to solve (96) numerically, we employ the Euler-Maruyama method. Algorithm 1 summarizes the numerical scheme. As described in Section 6, we assume that the radicals have a triangular distribution centered at with width . That is, we produce a random sample of radicals with size from the triangular distribution (91) (Step 0). In particular, for complete correspondence between the discrete- and continuum- agent models, we also consider the effect of even -periodic extension in our simulations. To this end, we use even -periodic extensions of x and for calculating the sum on the r.h.s. of (96) (vectors denoted by and in Steps 0, 1 and 2). Also, due to periodicity, in each iteration, the opinion values outside the support are reflected back to (Step 5).
Appendix D Pseudo-spectral Method for Continuum-agent Model
This is a modification of the algorithm given in [43] for our model. Let us first recall the PDE (11) for the continuum-agent model
[TABLE]
where
[TABLE]
Using the first terms of Fourier expansions of and , we can write
[TABLE]
Inserting this into (98), we obtain
[TABLE]
where is given by (82). Hence,
[TABLE]
With Fourier coefficients of in terms of Fourier coefficients of in hand, we can apply pseudo-spectral method for solving (97) as described in Algorithm 2. As shown, the multiplication on the r.h.s. of (97) is performed in the time domain (Step 4), while the differentiations w.r.t. are performed in frequency domain (Step 5). Note that the symmetric nature of solution is preserved in the algorithm (Step 1). Also, preservation of mass is satisfied by setting (Step 5). We also note that the algorithm is semi-explicit (see the first equation in Step 5).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D.-U. Hwanga, “Complex networks: Structure and dynamics,” Physics Reports , vol. 424, no. 4–5, pp. 175–308, 2006.
- 2[2] Y.-Y. Liu and A.-L. Barabási, “Control principles of complex systems,” Reviews of Modern Physics , vol. 88, p. 035006, 2016.
- 3[3] S. H. Strogatz, Sync: The Emerging Science of Spontaneous Order . New York: Hyperion Press, 2003.
- 4[4] C. W. Wu, Synchronization in Complex Networks of Nonlinear Dynamical Systems . Singapore: World Scientific, 2007.
- 5[5] M. Mesbahi and M. Egerstedt, Graph Theoretic Methods in Multiagent Networks . Princeton and Oxford: Princeton University Press, 2010.
- 6[6] A. Pogromsky, G. Santoboni, and H. Nijmeijer, “Partial synchronization: from symmetry towards stability,” Physica D: Nonlinear Phenomena , vol. 172, no. 1, pp. 65 – 87, 2002.
- 7[7] W. Wu, W. Zhou, and T. Chen, “Cluster synchronization of linearly coupled complex networks under pinning control,” IEEE Transactions on Circuits and Systems I: Regular Papers , vol. 56, no. 4, pp. 829–839, 2009.
- 8[8] W. Xia and M. Cao, “Clustering in diffusively coupled networks,” Automatica , vol. 47, no. 11, pp. 2395–2405, 2011.
