1. Opinions on Social Networks
With the widespread of multimedia and internet in the last several decades, a large amount of social media emerge such that people are ubiquitously connected with friends, family or peers, through all kinds of social networks, which increasingly shape or influence their opinions and judgments on many topics such as consumer products, politics, lifestyles or celebrities, thus the problem of modeling how users update opinions on social networks becomes an important research topic in Sociodynamics [1] , since understanding how users in social networks update opinions based on their neighbors’ opinions, as well as the emergence of aggregate social trends or global opinion structure from the opinion update of each individual, are important in the context of virtual marketing, information dissemination or targeting messages to users in social networks.
To investigate opinions on social networks, one needs to prescribe the network mathematically. There are basically two types of models, i.e., graph based models and statistically structured models. For graph models of social networks, one can see for example [2] , in which some collective dynamics of “small-world” networks were studied.
The statistically structured models for social networks are appealing [3] , since that in some applications, the number of nodes and links of a social network is so large that a detailed description by means of classical graphs would be largely unfeasible. Later on, various mathematical approaches are developed for theoretical investigations of opinion formation and/or wealth distribution on social networks, see for example [4] [5] [6] [7] [8] , to name just a few, ranging from microscopic models, mesoscopic models, to corresponding macroscopic limits. Among these models, the mesoscopic kinetic models are important, especially for dealing with large scale social networks.
Next, we notice that the key factor of a network is the connectivity. The connectivity of an agent represents one’s number of contacts/followers. The opinion of the agents with a higher connectivity, i.e., a larger number of followers, results in more convincing than that of the agents with a lower number of followers [9] . Note that agents with high number of contacts/followers are sometimes identified as influencers. Influencers are not necessarily recognized as leaders, since they obey the same mechanism of opinion sharing as any other agents but do not operate in a coordinated manner. For opinion dynamics with leaders, we refer to [10] and references therein.
In the present study, we consider a kinetic model of an opinion model with three opinions ±1, 0, allowing indecisive individuals who cannot make a clear choice between ±1 in the study, which extends the result in [11] where only binary opinions, ±1, were considered. Note that the kinetic modeling of the Sznajd model with three opinions is studied in [12] , but without considering connectivity of the social network. By the kinetic modeling approach, we will derive the asymptotic mean opinion of a social network in terms of the initial opinion and the connectivity of the agents. The plan of the paper is that, in the next section, a discretized model, say, Sznajd model [13] , will be introduced, and two revisitations of Sznajd model provide the interaction rules for the further derivation of the Boltzmann-type kinetic equations. In section 3, the kinetic model will be derived. Next, the large time behaviour of the mean opinions of the model is studied in Section 4. Finally, some concluding remarks and research perspectives are given in Section 5.
2. The Sznajd Model
As one important opinion model in computational sociophysics, we mention the important Sznajd model [13] , which is considered a “Ising model of opinion dynamics”. The dynamics are based on the principle that if two agents share the same opinion, they may succeed in convincing their acquaintances of their opinion (“united we stand, divided we fall”). By using this model, one tries to model the interaction of a system of agents distributed on a 1-dimensional string, with the opinion variables taking only two extreme opinions ±1 denoting positive or negative opinions, mimicking the up/down in the context of Ising model.
Note that the original Sznajd model was introduced as the binary-opinion model, which is very natural for statistical physicists. However, it was later generalized to accommodate three or larger number of discrete states [14] [15] [16] [17] , or even a continuous set of opinions [18] [19] . Moreover, the original Sznajd model on a string has also been generalized and studied on square lattice, randomly diluted square lattice, triangular lattice, as well as on various networks. See [20] for more on a review of the Sznajd model. The Sznajd type model for opinion exchange will provide the basic interaction rules for the kinetic modeling of the opinion dynamics on social networks.
Motivated by the study of Loy-Raviola-Tosin [11] , in this paper, we consider the kinetic modeling of a Sznajd type opinion model on social networks, in which the distribution function depends on both the opinion and the connectivity of the agents. Note that unlike classical modeling of opinion formation in a multi-agent society [21] [22] [23] [24] [25] where agents are considered indistinguishable, the connectivity of the agents in a social network is intrinsically considered in the kinetic modeling in [11] .
Let
be the opinions of three agents in the social network at time t. Assume that the connectivity described by the number of followers of a given individual changes more slowly than opinion, so it can be taken as a constant in time. With the notations used in [26] , which are some revisitations of the Sznajd model [13] , we consider the following two interaction schemes:
1) The two-against-one model. This model assumes that the third agent takes the opinion of the first two agents if the latter have same opinions. Otherwise, no interaction occurs. This model can be represented as
(2.1)
where
are the opinions of the first two agents,
is the time interval in which the interaction may happen,
is a Bernoulli random variable which describes whether the interaction happens or not, with the probability
in which
is a constant,
denotes the characteristic function, and
are the connectivities of the first two agents. This formula indicates that the interaction takes place only if
, with the probability proportional to the connectivities of first two individuals,
, and the time interval
. In order to obtain a meaningful probability, the value of probability cannot exceed the extreme value 1, thus there is a constraint on
that
where the maximum is taken over the connectivities of all agents.
2) The Ochrombel-type simplification. Instead of assuming that the interactions take place under the condition that two individuals have the same opinions, it is assumed that every agent can affect each of their neighbors’ opinion, then the interaction rule becomes
(2.2)
where the probability for occurrence of interaction,
, is given by
that is, the probability is proportional to the connectivity of the first individual, C, and the time interval
. The constraint for
becomes
where the maximum is also taken over the connectivities of all agents.
3. Kinetic Modeling
We consider a social network with large number of agents, each agent is associated with an opinion-connectivity pair of states
,
is a discrete opinion variable and
is a continuous non-negative connectivity variable: Note that the opinion variable w takes values ±1 denoting conventionally two opposite opinions in the same spirit as the original Sznajd model, the third opinion
allowing for indecisive agents who cannot make a clear choice between ±1 and prefer therefore to abstain. The connectivity c is assumed to be a representative measure of the contacts/followers of a given agent, which is considered a continuous variable in accordance with the reference literature on the connectivity distribution of social networks. For simplicity, we take the statistical distribution of the connectivity of the agents constant in time as in [11] , which corresponds to the assumption that the connectivity distribution possibly evolves over a timescale much slower than that of the opinion changes such that it can be considered as an almost stationary background.
Let
be the distribution function of the opinion-connectivity pair
at time
. Due to the discreteness of w, the distribution function f can be represented as
(3.1)
where
denotes the Dirac delta function centered at
, and the coefficients
are the percentage of individuals expressing opinion
, respectively. Moreover,
for all
is assumed, together with the normalisation condition
meaning that there is a constant-in-time number of agents and connections of the social network.
1) The two-against-one model describes multiple interactions, i.e. the interactions among three agents. So we consider multiple-interaction Boltzmann-type equation following the derivation process in [11] [27] . Let
be an arbitrary observable quantity (test function). Taking the two-against-one model (2.1) as the interaction rule, the Boltzmann-type equation reads
(3.2)
with collision kernel
2) The Ochrombel-type simplification. Similarly, the Boltzmann-type equation with interaction rule corresponding to (2.2) reads [11]
(3.3)
in which the collision kernel takes
4. Behaviour of the Mean Opinion
To study the opinion evolution process in the kinetic models (3.2) or (3.3), one defines the mean opinion of the system
Here f is taken with the form (3.1). We will mainly concern the evolution of the mean opinion
of the system. For later use, we also denote
(4.1)
Note that we have assumed the number of followers of an agent changes more slowly over time than their opinions, the marginal distribution g is constant in time, that is,
for all
, and the mean connectivity
is a constant
4.1. The Two-Against-One Model
For the two-against-one model, let
in the Boltzmann-type Equation (3.2), we have
(4.2)
in which
(4.3)
Note that
and
are not constants. To study the behavior of
, we need to obtain the evolution of
and
. For this purpose, we take
and
in the Boltzmann-type Equation (3.2) to get
The two equations can be simplified with the help of (4.3). Together with (4.2), we get
(4.4)
Note that this is a closed system of ordinary differential equations with unknowns
. To analyze the asymptotic behaviour of the system, we denote
with
then the system (4.4) can be rewritten in the form
(4.5)
This dynamic system has seven rest points:
and
The stability of an equivalent point of a differential system depends on the sign of the eigenvalues of the Jacobian matrix. For this, we compute the Jacobian matrix of
:
(4.6)
where
Now we study the Jacobian matrix at each equivalent point
. For
, one computes
The characteristic equation is
The three eigenvalues
are all negative, then the equivalent point
is asymptotically stable. Similarly, the eigenvalues for
are
, the eigenvalues for
are
, they are asymptotically stable.
For
, the three eigenvalues are
Note that the third eigenvalue
is positive, then the rest point
is not asymptotically stable. The eigenvalues for
are
The eigenvalues for
are
The eigenvalues for
are
In summary, the three stable equivalent points of (4.4) are
which correspond to three possible asymptotically limits of the mean opinion, ±1 or 0, respectively. The final asymptotically limit of the mean opinion is determined by the competition of the connectivity-weighted percentage of agents expressing the initial opinion 1, −1, 0, that is, which one of the three equivalent points will be the asymptotically limit depends on the initial opinion-connectivity distribution located in the attraction domain of each rest point.
4.2. The Ochrombel-Type Simplification
For the Ochrombel-type simplification, let
in the Boltzmann-type Equation (3.3), we get the following equation after some calculations:
(4.7)
This equation is coupled to
and
. Recall that
is assumed to be constant in time. Taking
in (3.3), one gets the equation for
as
which implies that
is also constant in time, i.e.
, where
is the initial value of
, defined with a given initial opinion-connectivity distribution
of the social network. Then (4.7) becomes
which is solved with the initial mean opinion
that
(4.8)
this asymptomatically converges to the connectivity-weighted mean initial opinion:
(4.9)
5. Conclusions and Perspectives
In this paper, a kinetic model of opinion formation on social networks is derived, in which the distribution function depends on both the opinion and the connectivity of the agents. The opinion exchange process is governed by a Sznajd type model considering three opinions, ±1, 0, and the social network is represented statistically with connectivity denoting the number of contacts of a given individual. Two revisitations of the Sznajd model, the two-against-one model and its Ochrombel-type simplification, are considered the microscopic interaction rules. The large time behaviour of the mean opinions of the model is studied by using the macroscopic system of differential equations derived from the Boltzmann-type kinetic equations.
For the case of the two-against-one model, three possible asymptotically limits of the mean opinion, ±1 or 0, are derived. The final asymptotically limit of the mean opinion is determined by the competition of the connectivity-weighted percentage of agents expressing the initial opinion 1, −1, 0.
For the case of the Ochrombel-type simplification, the mean opinion converges asymptomatically to the connectivity-weighted mean initial opinion as in (4.9).
The results demonstrated the fact in social networks, that the opinion of the agents with a higher connectivity, i.e., with a larger number of contacts/followers, the so-called influencers, results more convincing than that of the agents with a lower number of followers.
Further extension of the proposed model may include a kinetic description of opinion distribution of agents on evolving network, that is, the case in which the connectivity is not constant in time. This may be resolved by combining an opinion update based on interactions between agents, together with a dynamic creation and removal process of new connections [5] . Since only three opinions are considered in the present study, the model may be extended to the case of more number of discrete states or even a continuous set of opinions.
Acknowledgements
This research is partially supported by National Natural Science Foundation of China (Nos. 11871335 and 11971008).