The Collective Behaviors of Self-Excitation Information Diffusion Processes for a Large Number of Individuals

Wang, Lifu; Shen, Bo

doi:https://doi.org/10.1155/2020/1861583

Complexity

On this page

Abstract Introduction Related Work Conclusion Appendix Data Availability Conflicts of Interest Acknowledgments References Copyright Related Articles

Special Issue

Collective Behavior Analysis and Graph Mining in Social Networks

View this Special Issue

Research Article | Open Access

Volume 2020 | Article ID 1861583 | https://doi.org/10.1155/2020/1861583

The Collective Behaviors of Self-Excitation Information Diffusion Processes for a Large Number of Individuals

Lifu Wang¹and Bo Shen²

Guest Editor: Hongshu Chen

Received25 Jun 2020

Accepted24 Jul 2020

Published24 Aug 2020

Abstract

The opinion dynamics is a complex and interesting process, especially for the systems with a large number of individuals. It is usually hard to describe the evolutionary features of these systems. In some previous works, it has been shown that the self-excitation type model has superior performance in learning and predicting opinions. Following this line, we consider the self-excitation opinion model and study the collective behaviors of the self-excitation model. We propose a Mckean–Vlasov-type integrodifferential equation to describe the asymptotic behaviors of the model and show that the introduced equation, by coupling with the initial distribution, has the ability of capturing the influence of the self-excitation process, which describes the mutually exciting and recurrent nature of individuals. We also find that the steady-state distribution is a “contraction” of the initial distribution in the linear and bounded confidence (DW model) interaction cases, which is different from the results of the model with nonself-excitation interaction.

1. Introduction

Expressing opinions and then influencing others are the primary forms of social behavior of people. The dynamics of public opinion has long been a major concern of social science and computational social science. There has been an increasing interest on the perception and prediction of social opinion, such as quantitative investment firms which measure investor sentiment and trade using social media Karppi and Crawford [1] and prediction of election results [2].

Based on sentiment analysis with deep learning, there are many frameworks to perceive opinion on the social network. For the prediction of social opinion, there are some noticeable models proposed at the beginning of the 21^st century, such as the Sznajd model [3], Hegselmann–Krause model [4, 5], Deffuant–Weisbuch model [6], and so on, which had been established to understand the co-ordinated movements of opinion as a group. However, these works held some limitations: (i) most of these models on opinion dynamics are theoretical and have not proved their effectiveness quantificationally. (ii) These models are represented by a cellular automaton, which makes it difficult to analyze the global behavior of the dynamics.

More recently, some researchers began to study the models, which can provide more accurate predictions [7–9]. De et al. [9] proposed a framework of opinion dynamics named SLANT, providing accurate predictions of users’ opinions. In the early models, the opinion and the states of the next moment only depend on the states of the last moment, and thus have nothing to do with more previous ones. It means that opinion formation is seen as a Markov process. However, in the real world, this assumption may not be precise. The model given in the study by DE et al. [9] indicates that self-excitation opinion models with exponential function weight have superior performance in learning and predicting opinions.

In many works [9–13], self-excitation models have shown efficient abilities to capture users’ behavior pattern. These models focus on the microbehaviors basing on cellular automata, which would not express the global dynamics of opinion evolution analytically.

In this paper, we study the self-excitation opinion dynamics on the large homogeneous network. We show that when the number of the individuals is very large, the opinion distribution of this system evolves according to a nonlinear partial differential equation (PDE) of Mckean–Vlasov type. Due to the dependence on the initial value in the local rules, the individuals with different initial values will have different dynamic equations; thus, the mean-field equation deriving process is different from the cases of the previous works [14, 15]. We show that this PDE can be decomposed into two parts where the first part is the same as the Fokker–Planck model in the study by Toscani [16]. And the second part can capture the mutually exciting and recurrent nature of individual behaviors by an integral term related to the initial value. This term leads to different steady state behaviors from the Markov model, such as the model given in the study by Toscani [16]. Generally, the stationary solutions of the Toscani type model will trend to a single-point support Dirac measure when noise parameters tend to 0, but the model with additional term makes the steady state to be a “contraction” of the initial distribution.

The rest of this paper is organized as follows. Section 2 is for related work. In Section 3, we introduce the mathematical model of opinion dynamics we study and the main mean-field theorem in this paper. In Section 4, using this theorem, we consider the linear interaction model and the bounded confidence (DW) model and study the steady-state distribution of these models. Section 5 is the proof outline of this theorem. Section 6 is a summary. The detailed proof is in the appendix.

2.1. Information Diffusion Model

The early theory of information diffusion in mathematical sociology was proposed by Sznajd in the study by Sznajd-Weron and Sznajd [3]. Sznajd’s model is designed to explain the features of opinion dynamics, in which every individual is on a lattice and have a state 0 or 1 to express the opinion. Individuals update their opinion by the opinions of their neighbors. The numerical simulations of this model are also investigated by many researchers [17–19]. On the complete graph, Slanina and Lavicka [20] show that when the number of individuals is very large, the probability densities evolve according to the partial differential equationswhere is the probability distribution of opinion. Equation (1) describes the Ochrombel simplification of the Sznajd model, and (2) does the original case. The authors showed the existence of phase transition in the original formulation and smooth behavior without transition in the model modified by Ochrombel.

For the theory of continuous opinion dynamics, the Deffuant–Weisbuch model [6] and Hegselmann–Krause model [4, 5] deal with two different cases. Both these models are so-called bounded confidence models, i.e., the individuals can only be influenced by some others whose opinions are close enough to theirs. The characteristics of bounded confidence lead to the formation of communities, which coincides with the phenomenon in the real world. A very beautiful analysis of the convergence of the Deffuant–Weisbuch model is given in the study by Zhang et al. [21], which reveals the community structure of the model. Bhattacharyya [22] proves the convergence of the Hegselmann–Krause model. On the other hand, numerical simulations on complex networks [23] show that “the more heterogeneous the complex network is, the weaker the ability of polarization and consensus of the complex network will be.” Models with both continuous opinion and discrete states are also considered, such as the SHIR model [24], where the individuals have a four-state variable to represent susceptible, hesitated, infected, and removed. Opinion dynamics of the social network and the impact on the recommendation are studied in the studies by Xiong et al. [25] and Li et al. [26].

Como and Fagnani [27] gave a general framework to prove that the scaling limits of the many-body continuous opinion system can be described by a measured value ordinary differential equation (ODE). In such models, every individual will change its opinion to , a convex combination with the neighbor with probability . When , it becomes the Deffuant–Weisbuch model. The key ideas of their work are the large deviation principle and some estimations based on the Lipschitz property, which are the same as the general method used to prove the chaotic propagation properties [28].

Based on the Boltzmann equation with granular gas like interactions, Toscani [16] introduced a collision model, in which the communication between individuals was considered as a collision with the following form:where function D and P describe the local relevance of the compromise and diffusion for a given opinion. Toscani also considered the quasi-invariant opinion limit for the Boltzmann-type equation. The main idea of that is to scale the interaction frequency, strength, and the diffusion in the integral equation, and then, the equation reduces to a Fokker–Planck type equation. Then, on the base of this model, considering the influence of the structure of the social network, Albi et al. [29] consider the kinetic opinion dynamics on the large scale networks evolving over time. The evolutions of both the network and the opinion were involved.

2.2. Self-Excitation Point Process in Social Systems

Point processes type models are generally used to analyze the impact of events on the system such as CSMA/CD [30], financial data [31], and the dynamics of book sales [32]. A very succinct and effective analysis for the time series of daily views for videos on YouTube is introduced [33]. The authors showed that most of the video viewing record data could be described statistically by a Poisson process, but still, about 10% data show a point process with the instantaneous rate ,where is the number of potential viewers influenced directly by person who views the video through the social network, and captures all spontaneous views that are not triggered by epidemic effects on the network.

For the self-excitation social opinion models, De et al. [9] proposed an opinion model on a social network, in which every user has a latent opinion about the given topic and can post messages about the topic. The experiments on real data show that the self-excitation model, with the intensity depending on the messages sent from a neighbor in the past and the weight function having the form like , performs much more better than the Poisson process () model.

Wang et al. [13] used point process to predicting user activities. They proposed a generic framework for point process prediction problem, and they used a mass transport equation to update the transport rate and compute the conditional mass function.

2.3. Mean Field Theory

Mean-field theory (MFT) is introduced to study many-body problem by using a single averaged effect to approximate the effect of all individuals. The core of MFT is to estimate the error of the mean-field approximation. If there is no interaction, all individuals are independent of each other, and then, the law of large numbers works and gives the mean-field approximation. In the general case, we still want to be able to use the law of large numbers. That is to say, if one picks a chaotic (i.i.d) initial distribution of particles, we hope that this distribution is still chaotic as time-evolving, which is the so-called propagation of chaos.

The theory of propagation of chaos in the cases of Wiener noise is summed in the study by Sznitman [28]. If particles with initial “chaotic” distribution satisfy the stochastic differential equation (SDE),the Mckean–Vlasov mean-field equation iswhere u is the law of . The method to show this is to use the Lipschitz character of and Gronwall’s lemma. Mckean–Vlasov equation for SDE with Poisson jumps is in the study by Andreis et al. [15]. The authors used Burkholder–Davis–Gundy inequality for martingales. The main step in the study by Andreis et al.[15] is to use Doob–Meyer decomposition and estimate the compensated Poisson process.

Using the large deviation principle [34], Arous and Guionnet [35] studied the mean-field simplification dynamics for Langevin spin glass. The framework of their proof makes use of Sanov’s theorem and Varadhan’s lemma in the path space to get the rate function for the interaction system.

The main obstacle to use these methods to prove MFT is the unboundedness of coefficients in SDE. Because of Varadhan’s lemma, if we use a stop time to get the localization of SDE, we can get the so-called local large deviation principle. Dawsont and Gartner [36] gave some compactness criteria to convert the “local” result into “global” one. They also show that a Lyapunov function for the system of weakly interacting diffusions will let the compactness condition be satisfied. Puhalskii [37] set up the whole framework of local to global LDP and introduce the -exponential tightness conditions.

3. Mathematical Model

3.1. Self-Excitation Opinion Model

In this paper, we consider a simplified version of the model [9] and study the large number limit of the self-excitation opinion model with the following form:

There are N individuals with opinion , which is a function of the time , such thatwhere is a interaction function, is the convolution operator, is the triggering kernel, and is a Poisson process. This model has been previously studied [11, 12].

The original model proposed in the study by De et al. [9] has the following form:where is the message sent by user j, is the interaction intensity between and , is the initial opinion of user , is the history of events up to time t for user j, and is a triggering kernel. The values of message m come from a sentiment distribution related to the opinion x and .

As the models have been previously studied [11, 12], we only consider the opinion part, the simplified model (7). In the case that , where is the opinion of the individual , De et al. and Wang et al. [9, 11] showed the validity of the model in the study by DE et al. [9] on the real world data. And when , the form of this model will degenerate into the form of the DW model [6] and Toscani model [16] when .

In studies by De et al. and Wang et al. [9, 11], the self-excitation opinion model with exponential function type weight was shown to be very effective in the opinion dynamics; therefore, we set , where is a constant. Due to the fact that differential of the convolution of two functions , where there is a jump part in , and . We can use a stochastic differential equation (SDE) to describe [11].

It is also necessary to add into the model to represent noise, where is the Wiener noise with .

The above two equations are given in the study by Wang et al. [11]. Because of the dependence on the path of the history, it is apparently not a Markov process. We consider the limit that the population size tends to infinity. Let be the opinion variable of the -particles system. satisfieswhere . In the case that and , this is a Deffuant–Weisbuch-like model.

If we only consider the case and replace the Poisson Noise with and consider the form

The mean-field theory of this equation is well studied [28]. The Mckean–Vlasov mean-field equation is

In this paper, we first use Doob–Meyer decomposition for . Then, we estimate the compensated Poisson process by Burkholder–Davis–Gundy inequality for martingales. This method helps us to reduce our equation to the form in (12). As for the dependence on the initial values, we regard the initial as a random media. Using the methods in the study by Pra and Hollander [38]. The Mckean–Vlasov equation can be obtained using Sanov’s theorem and Varadhan’s lemma in the path space . In this paper, we use a direct estimation to prove the convergence to the Mckean–Vlasov equation.

3.2. Main Results

The main result in this paper is the following theorem:

Theorem 1. When tends to infinity, there is a limit process for in equation (11), with SDE:where is the law of , and is a random variable. And given the initial distribution , the law of is , where is the solution of the Fokker–Planck equation associated with the Mckean–Vlasov process:where is a Dirac measure with support on b.
From this theorem, we can study the asymptotic behavior of the self-excitation opinion model. In Section 4, we will study the steady state of this system by using Fokker–Planck equation and show the effects of self-excitation, which makes it impossible to give a perfect consensus, such that it can avoid Abelson’s diversity puzzle [39].
In order to prove this theorem, we need some assumptions. Stemming from the physical meaning, we can assume that the support of initial distribution is bounded, such as the uniform distribution on [0, 1]. Also, for the proof of Mckean–Vlasov limit, we need the function to have good enough properties to makewhere is the solution of the Mckean–Vlasov equation.
If is bounded, the first condition is satisfied trivially. In the appendix, we will give other examples of that can make these conditions be satisfied. Also, we assume that is Lipschitz for both of the variables. However, this is not the necessary condition [14].Most of these conditions can be relaxed, but we hope to prove our results without excessive technical details on tightness; therefore, these restrictions are imposed.

4. The Properties of Mckean–Vlasov Dynamics

4.1. Mckean–Vlasov Equation

For the equationwe consider a simple case

Then, we can see thatwhere , the mean value of x.

Since h is an odd function, it is easy to see that

So, since , , and .

Then, we have the Fokker–Planck equation associated with the Mckean–Vlasov process:

Integral over

Another example is the bounded confidence type model [4, 6] where every agent interacts only within a certain level of confidence:where is a continuous function, and if , and if . Since, in this case, is bounded and Lipschitz, our assumptions are satisfied.

Note that for the case that , which is used in the SLANT system [9],where . Since

As a sanity check, this formula matches (4) in the study by De et al. [9]. Solving this equation, we get

4.2. Discussion

Como and Fagnani [27] showed that when the population size tends to infinity, the limit behavior of the Deffuant–Weisbuch model can be described by a measure-valued ODE. And also, Toscani introduced a kinetic model of opinion formation [16]. In this model, the opinion is changed by the binary interaction of collision, and the dynamics of the opinion distribution is modeled by Boltzmann-type integrodifferential equation.

In these models, the dynamics of opinion distribution is depicted as follows:where is the measure of opinion distribution, and is an arbitrary test function. The right side of (29) has the following form [27]:and in Boltzmann case [16],

Intuitively, both models can be derived from the stochastic differential equation with Poisson jump interactions by the method mentioned in the study by Méléard [14]. Events that interact with other particles are regarded as a Poisson process.

For the system with ,in the case that , which is the nonself-excitation case, it degenerates into the general opinion dynamics model, or equally, the quasi-invariant opinion limit for Toscani’s Boltzmann equation [16]:

The term is a modification to consider the influence of the self-excitation process.

In this paper, we only consider the homogeneous network. However, using the method in the study by Pra and Hollander and Albi et al. [38, 40], we can study the large system of agents interacting through a network with a given distribution of the number of connections by the following way:(1)Consider a random media , which is a discrete variable describing the number of connections. should be a random variable to represent the complex network. For example, obeys power law distribution.(2)Construct a new interaction equation as in the study by Albi et al. [40]. Then, it is the same as Theorem 1 in the study by Pra and Hollander [38] such that in this random media, we can also prove a mean-field theorem. And there is a distribution about the variable , opinion , and time . Using a similar argument as Albi et al. [40], we have obtained the stationary solutions.

4.3. Steady-State Distribution of the Linear Case

Considering a simple case of initial distribution . We will use this simple form to explain how the initial distribution is coupled to the equation. Then, the equation will become

The overall distribution is equal to .

The evolution process of this distribution is shown in in Figure 1(a) . And Figures 1(b) and 1(c) show the differences between two kinds of steady states.

(a)

(b)

(c)

As shown in Figure 1(b), for the initial distribution , the steady state distribution is normal. In fact, this is true for any initial distribution, and we have the following theorem.

Theorem 2. In the case that , for all type of initial distribution , we have the steady-state distribution , where is the normalization constant.
This is because the form of PDE for has the formThe steady-state equationand this steady state is asymptotically stable, such that when , the solution of the equation will trend to the steady state. It is easy to see that the steady state is a normal distribution as shown in Figure 1(b).
From Theorem 2, this model cannot describe the actual situation since, in this model, the final state of the opinion distribution has no community structures but a perfect consensus (in fact, this is true for any monotonic function , since the steady state is the Gibbs distribution of a potential energy , such that ), which is so-called Abelson’s diversity puzzle [39], a persistent research puzzle in the social sciences. Generally, this puzzle is solved by the bounded-confidence mode, such as HK [4] and DW [6] models. It is proved in the study by Como and Fagnani [27] for a large number of individuals case and by Zhang et al. [21] for the general case that the steady state of the DW model has the form , where is the opinion of the community i, and if , where R is the bounded confidence distance.
However, in the case , the equation has the steady state as in Figure 1(c) when the initial distribution has the form . In the general case, we have

Theorem 3. In the case that , given an initial distribution , we have the steady-state distribution , where is the normalization constant.
Let , and is the solution of Mckean–Vlasov equation,The steady state of is easy to calculate:where Z is the normalization constant, so we have .
Considering the limit behavior , the steady state of Mckean–Vlasov equation when has the formSo that even in the case that the variance of the noise trends to 0, this equation will not converge to a single Dirac measure, which is different from the case. Intuitively, the term makes the opinion try not to deviate from the initial position too far, which can be considered as soft-bounded confidence.
In the case that , which is used in the SLANT system in the study by De et al. [9], supposing , the steady state will have the similar form since the equation of which iswhere (this is from (25)), the final mean value of x. We have .

4.4. Steady-State Distribution of Bounded Confidence Models

In the case that and , the steady-state distribution is studied [27]. We can follow their methods to study the weak solution of our equation.

Theorem 4. Let , , and if , otherwise . We have when , where if .

Proof. Considering equation (19) with , let . We havewhere is a bounded confidence kernel. In (a) of (42), we use the symmetry of and and the integration by parts.
Considering the steady state and limit, we have , yet if in the support of , there are two points and such that and , and we have , which is a contradiction, so that our claim follows. □
Supposing , it is hard to obtain a steady state directly. However, we can use function to give an estimation. We can show that in the bounded confidence case, the steady-state solution is still a “contraction” of initial distribution.Since and , we havesuch that in the sense of mean value, . And the degree of offset is depending on the value of . We can see that will increase as the radius of the kernel grows. When and , the model will degenerate into the linear case in Theorem 3.

5. The Outline of the Proof

5.1. SDE Related to Initial Values

Since the process we study is not a Markov process, we need to consider SDE with the form

It has no Markov generator, but the non-Markovian of it is “not so bad”. The law of can be solved by the following method. For a given , we can solve the law by , where is the generator of the Fokker–Planck equation, and is the initial Dirac distribution. Then, the solution of the SDE has the formwhere is the generator with given , is the Dirac measure with the support on , and is the initial distribution of .

The essence of this method is to regard as an additional random variable. When SDE has the above form, we need the double layer empirical measure, which will regain the symmetry.

We will consider the SDEswhere is a stochastic variable such that ; then, we will prove the large number law for the double layer empirical measure , which will give the Mckean–Vlasov limit. This is equal to consider SDEswhere is the stochastic process with given b, and .

5.2. Intermediate Process

Andreis et al. [15] proved that the Mckean–Vlasov limit of the equationhas the formwhere P is the law of X.

We use the same way as Andreis et al.[15] to reduce the jump-SDE to the “averaging dynamics.” Their method is to decompose the jump terms into a martingale and a continuous part. Then, the martingale can be easily estimated by Burkholder–Davis–Gundy inequality.

We will show that there is an intermediate process with the following SDE:such that

By comparing these two process directly, we can notice thatwhere , and .

Using Doob–Meyer decomposition,where is a martingale.

Intuitively, the supremum of a martingale would not be very large. This can be proved by Burkholder–Davis–Gundy inequality and our assumption on . Then, we can obtain the approximation (52). See the second part of the appendix for a detailed proof of (52).

5.3. Mckean–Vlasov Process

The intermediate process has the form likewhere is a random variable.

The asymptotic behavior of the double layer empirical measure, with the case that and are bounded, has been studied [38]. They use Varadhan’s lemma to reduce the system to the case without interaction. Since f and are not bounded, we use the method in the study by Sznitman [28] to compare the two SDEs directly. Using the Lipschitz condition, we can control by the first Wasserstein distance .

The first Wasserstein distance is defined bywhere is the set of all probability measures on with marginals and .

By Kantorovich–Rubinstein duality theorem, it has a dual representation:where is the minimal Lipschitz constant for .

Using this representation, since we have assumed that the coefficients are Lipschitz, we can see thatwhere is the empirical measure, and is the solution of Mckean–Vlasov equation.

For , we havewhere is the empirical measure for N independent Mckean–Vlasov processes.

Then, we can derive our result by considering the Wasserstein distance between the solution of Mckean–Vlasov equation and empirical measure. Using Theorem 1 in the study by Zanella and Guillin [41], if the two order moment is finite,when the size tends to infinity and the Wasserstein distance trends to zero, so our claim follows. The detailed proof is given in the appendix.

6. Conclusion

In this paper, we studied the asymptotic behaviors of the exponential function weight of the self-excitation interaction system on the large homogeneous network when , the number of the individuals, trends to infinity. We proved that there is a Mckean–Vlasov process , such that is zero, whose opinion distribution evolve according to a Mckean–Vlasov type integrodifferential equation, which couples with the initial distribution. The steady state of this equation is also studied. We investigated the steady state distribution of linear and bounded confidence models and showed that the steady distribution of these models is a “contraction” of initial distribution. By virtue of the self-excitation interaction, even if we do not consider bounded confidence, it will give not a perfect consensus, but a distribution depending on the initial distribution, such as this model, can avoid Abelson’s diversity puzzle.

Appendix

A. The Condition under which the Assumptions Hold

In this section, we will give some examples that the assumptions can be satisfied. We will show that when has linear growth, the assumptions (16) and (17) are satisfied.

For SDE,and it is shown in the study by Situ [42] that since both and has linear growth, this SDE has a strong solution, and also, we can estimate the moment.

In order to prove (16), since h is linear growth, we can turn to consider the second moment by Jensen’s inequality . Using Ito formula,

Since and , we can show that

We use by Jensen’s inequality. Then, using Gronwall’ lemma, our claim follows.

As for the second condition (17), the above method can be also applicable.

B. Reduce to the Averaging Dynamics

The SDE for stochastic process is

Following the study by Andreis et al. [15], it is useful to introduce an intermediate process with SDE

Since the Poisson process is a semimartingale, can be decomposed into by Doob–Meyer decomposition, where is a martingale. The in Y is the second part of Doob–Meyer decomposition of . To simplify the symbol, we set .

We will show that for large ,so, can be approximated by .

Letso,

In our model (9), , so that we have .

For ,

As in the study by Andreis et al. [15], we can use the Burkholder–Davis–Gundy inequality for martingales.where we use the symmetry, assumption (16), and the Lipschitz condition for h. Combine the two results; then, we get

Then, using the standard technology of Gronwall’s lemma, we get the approximation.

C. Mckean–Vlasov process

As shown in the previous section, we can turn to analyze the stochastic process Y. Let be a stochastic process with SDE:where is the law of , and b is a random variable, such that .

Using the trick in (47), we can show thatwhere is the law of SDE with given b, the initial distribution is , and is the given initial distribution of . We will show that

Let be the empirical measures , we have

Since h is Lipschitz, we can see that

Summing over i,then, using Gronwall’s lemma

So, we only need to estimate the right side.

Using the Lipschitz condition for again, this can be controlled by where is the Wasserstein distance between the two measures, and is the solution of Mckean–Vlasov equation (72). is the empirical measures . It follows from [41] Theorem 1 that if the moments is bounded (this is satisfied by (17))

Thus, our claim follows.

Data Availability

This paper is not data-driving, and the model we study is from other data-driving ones. The data used in this article are only the data of the simulation of PDE, which are contained in Figure 1.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

The authors thank Wenyu Zhang for his great help in writing and Prof. Haibo Wang who introduced the recent developments in the mean-field game theory to us. This research was funded by the National Key Research and Development Program of China, grant number 2018YFC0831300.

References

T. Karppi and K. Crawford, “Social media, financial algorithms and the hack crash,” Theory, Culture & Society, vol. 33, no. 1, pp. 73–92, 2016.
View at: Publisher Site | Google Scholar
A. Ceron, L. Curini, and S. M. Iacus, “Using sentiment analysis to monitor electoral campaigns,” Social Science Computer Review, vol. 33, no. 1, pp. 3–20, 2015.
View at: Publisher Site | Google Scholar
K. Sznajd-Weron and J. Sznajd, “Opinion evolution in closed community,” International Journal of Modern Physics C, vol. 11, no. 6, pp. 1157–1165, 2000.
View at: Publisher Site | Google Scholar
R. Hegselmann and U. Krause, “Opinion dynamics driven by various ways of averaging,” Computational Economics, vol. 25, no. 4, pp. 381–405, 2005.
View at: Publisher Site | Google Scholar
R. Hegselmann and U. Krause, “Opinion dynamics and bounded confidence models, analysis and simulation,” Journal of Artificial Societies & Social Simulation, vol. 5, no. 3, p. 2, 2002.
View at: Google Scholar
G. r. Weisbuch, G. Deffuant, F. d. r. Amblard, and J.-P. Nadal, “Meet, discuss, and segregate!,” Complexity, vol. 7, no. 3, pp. 55–63, 2002.
View at: Publisher Site | Google Scholar
A. Das, S. Gollapudi, and K. Munagala, “Modeling opinion dynamics in social networks,” in Proceedings of the ACM International Conference on Web Search and Data Mining, pp. 403–412, New York, NY, USA, 2014.
View at: Google Scholar
A. De, S. Bhattacharya, P. Bhattacharya, N. Ganguly, and S. Chakrabarti, “Learning a linear influence model from transient opinion dynamics,” in Proceedings of the ACM International Conference on Conference on Information and Knowledge Management, pp. 401–410, Shanghai, China, 2014.
View at: Google Scholar
A. De, I. Valera, N. Ganguly, S. Bhattacharya, and M. G. Rodriguez, Learning and Forecasting Opinion Dynamics in Social Networks, 2015, http://arxiv.org/abs/1506.05474v3.
K. Zhou, H. Zha, and L. Song, “Learning social infectivity in sparse low-rank networks using multi-dimensional hawkes processes,” in Proceedings of the Sixteenth International Conference on Artificial Intelligence and Statistics, C. M. Carvalho and P. Ravikumar, Eds., vol. 31, pp. 641–649, Scottsdale, AZ, USA, 2013.
View at: Google Scholar
Y. Wang, E. Theodorou, A. Verma, and L. Song, “A stochastic differential equation framework for guiding online user activities in closed loop,” in Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics, A. Storkey and F. Perez-Cruz, Eds., vol. 84, pp. 1077–1086, Playa Blanca, Spain, 2018.
View at: Google Scholar
Y. Wang, G. Williams, E. Theodorou, and L. Song, “Variational policy for guiding point processes,” in Proceedings of the International Conference on Machine Learning, pp. 3684–3693, Sydney, Australia, 2017.
View at: Google Scholar
Y. Wang, X. Ye, H. Zha, and L. Song, “Predicting user activity level in point processes with mass transport equation,” in Advances in Neural Information Processing Systems, I. Guyon, U. V. Luxburg, S. Bengio et al., Eds., vol. 30, pp. 1645–1655, Curran Associates, Inc., Red Hook, NY, USA, 2017.
View at: Google Scholar
S. Méléard, “Asymptotic behaviour of some interacting particle systems; McKean-Vlasov and Boltzmann models,” in Probabilistic Models for Nonlinear Partial Differential Equations, pp. 42–95, Springer, Berlin, Germany, 1996.
View at: Google Scholar
L. Andreis, P. D. Pra, and M. Fischer, “McKean-Vlasov limit for interacting systems with simultaneous jumps,” 2017, http://arxiv.org/abs/1704.01052v1.
View at: Google Scholar
G. Toscani, “Kinetic models of opinion formation,” Communications in Mathematical Sciences, vol. 4, no. 3, pp. 481–496, 2006.
View at: Publisher Site | Google Scholar
A. T. Bernardes, D. Stauffer, and J. Kertész, “Election results and the Sznajd model on Barabasi network,” The European Physical Journal B, vol. 25, no. 1, pp. 123–127, 2002.
View at: Publisher Site | Google Scholar
D. Stauffer, “Better being third than second in a search for a majority opinion,” Advances in Complex Systems, vol. 5, no. 1, pp. 97–100, 2002.
View at: Publisher Site | Google Scholar
D. Stauffer and P. M. C. de Oliveira, “Persistence of opinion in the Sznajd consensus model: computer simulation,” The European Physical Journal B-Condensed Matter, vol. 30, no. 4, pp. 587–592, 2002.
View at: Publisher Site | Google Scholar
F. Slanina and H. Lavicka, “Analytical results for the Sznajd model of opinion formation,” The European Physical Journal B-Condensed Matter, vol. 35, no. 2, pp. 279–288, 2003.
View at: Publisher Site | Google Scholar
J. Zhang, G. Chen, Y. Hong, J. Zhang, G. Chen, and Y. Hong, “Convergence analysis of asymmetric homogeneous deffuant-weisbuch model,” in Proceedings of the China Conference on Control and Decision-Making, pp. 2394–2399, Taiyuan, China, 2012.
View at: Google Scholar
A. Bhattacharyya, M. Braverman, B. Chazelle, and H. L. Nguyen, “On the convergence of the hegselmann-krause system,” in Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, ITCS’13, pp. 61–66, ACM, New York, NY, USA, 2013.
View at: Publisher Site | Google Scholar
L. Guo and X. Cai, “Bifurcation phenomena of opinion dynamics in complex networks,” in Proceedings of the International Conference on Complex Sciences, pp. 1146–1153, Shanghai, China, 2009.
View at: Google Scholar
Y. Liu, S.-M. Diao, Y.-X. Zhu, and Q. Liu, “SHIR competitive information diffusion model for online social media,” Physica A: Statistical Mechanics and its Applications, vol. 461, pp. 543–553, 2016.
View at: Publisher Site | Google Scholar
F. Xiong, W. Shen, H. Chen, S. Pan, X. Wang, and Z. Yan, “Exploiting implicit influence from information propagation for social recommendation,” IEEE Transactions on Cybernetics, 2019.
View at: Publisher Site | Google Scholar
Z. Li, F. Xiong, X. Wang, H. Chen, and X. Xiong, “Topological influence-aware recommendation on social networks,” Complexity, vol. 2019, Article ID 6325654, 12 pages, 2019.
View at: Publisher Site | Google Scholar
G. Como and F. Fagnani, “Scaling limits for continuous opinion dynamics systems,” The Annals of Applied Probability, vol. 21, no. 4, pp. 1537–1567, 2011.
View at: Publisher Site | Google Scholar
A. S. Sznitman, “Topics in propagation of chaos,” Biophysical Journal, vol. 108, no. 2, p. 501, 1991.
View at: Google Scholar
G. Albi, L. Pareschi, and M. Zanella, “Opinion dynamics over complex networks: kinetic modeling and numerical methods,” Kinetic & Related Models, vol. 10, no. 1, pp. 1–32, 2016.
View at: Google Scholar
B. J. Cho, A Simulation Study on Interference in CSMA/CA Ad-Hoc Networks Using Point Process, Aalto University, Helsinki, Finland, 2010.
V. Chavez-Demoulin and J. A. Mcgill, “High-frequency financial data modeling using Hawkes processes,” Journal of Banking & Finance, vol. 36, no. 12, pp. 3415–3426, 2012.
View at: Publisher Site | Google Scholar
F. Deschatres and D. Sornette, “Dynamics of book sales: endogenous versus exogenous shocks in complex networks,” Physical Review E, vol. 72, no. 2, Article ID 016112, 2005.
View at: Publisher Site | Google Scholar
R. Crane and D. Sornette, “Robust dynamic classes revealed by measuring the response function of a social system,” Proceedings of the National Academy of Sciences, vol. 105, no. 41, pp. 15649–15653, 2008.
View at: Publisher Site | Google Scholar
J.-D. Deuschel and D. W. Stroock, “Large deviations,” vol. 342, American Mathematical Society, Providence, RI, USA, 2001.
View at: Google Scholar
G. B. Arous and A. Guionnet, “Large deviations for Langevin spin glass dynamics,” Probability Theory and Related Fields, vol. 102, no. 4, pp. 455–509, 1995.
View at: Publisher Site | Google Scholar
D. A. Dawsont and J. Gärtner, “Large deviations from the Mckean-Vlasov limit for weakly interacting diffusions,” Stochastics, vol. 20, no. 4, pp. 247–308, 1987.
View at: Publisher Site | Google Scholar
A. Puhalskii, Large Deviations and Idempotent Probability, Chapman & Hall/CRC, London, UK, 2001.
P. D. Pra and F. D. Hollander, “McKean-Vlasov limit for interacting random processes in random media,” Journal of Statistical Physics, vol. 84, no. 3-4, pp. 735–772, 1996.
View at: Publisher Site | Google Scholar
R. P. Abelson, “Mathematical models of the distribution of attitudes under controversy,” in Contributions to Mathematical Psychology, N. Frederiksen and H. Gulliken, Eds., Holt McDougal, New York, NY, USA, 1964.
View at: Google Scholar
G. Albi, L. Pareschi, and M. Zanella, “Opinion dynamics over complex networks: kinetic modelling and numerical methods,” Kinetic & Related Models, vol. 10, no. 1, pp. 1–32, 2017.
View at: Publisher Site | Google Scholar
N. Zanella and A. Guillin, “On the rate of convergence in Wasserstein distance of the empirical measure,” Probability Theory & Related Fields, vol. 36, no. 3, pp. 1–32, 2013.
View at: Google Scholar
R. Situ, Theory of Stochastic Differential Equations with Jumps and Applications: Mathematical and Analytical Techniques with Applications to Engineering, Springer Science & Business Media, Berlin, Germany, 2006.

Copyright

Copyright © 2020 Lifu Wang and Bo Shen. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

293

Downloads

841

Citations

Complexity

Collective Behavior Analysis and Graph Mining in Social Networks

The Collective Behaviors of Self-Excitation Information Diffusion Processes for a Large Number of Individuals

Abstract

1. Introduction

2. Related Work

2.1. Information Diffusion Model

2.2. Self-Excitation Point Process in Social Systems

2.3. Mean Field Theory

3. Mathematical Model

3.1. Self-Excitation Opinion Model

3.2. Main Results

4. The Properties of Mckean–Vlasov Dynamics

4.1. Mckean–Vlasov Equation

4.2. Discussion

4.3. Steady-State Distribution of the Linear Case

4.4. Steady-State Distribution of Bounded Confidence Models

5. The Outline of the Proof

5.1. SDE Related to Initial Values

5.2. Intermediate Process

5.3. Mckean–Vlasov Process

6. Conclusion

Appendix

A. The Condition under which the Assumptions Hold

B. Reduce to the Averaging Dynamics

C. Mckean–Vlasov process

Data Availability

Conflicts of Interest

Acknowledgments

References

Copyright