SIR RUMOR SPREADING MODEL WITH TRUST RATE DISTRIBUTION

. In this paper, we study a rumor spreading model in which several types of ignorants exist with trust rate distributions λ i , 1 ≤ i ≤ N . We rigor- ously show the existence of a threshold on a momentum type initial quantity related to rumor outbreak occurrence regardless of the total initial population. We employ a steady state analysis to obtain the ﬁnal size of the rumor. Using numerical simulations, we demonstrate the analytical result in which the threshold phenomenon exists for rumor size and discuss interaction between the ignorants of several types of trust rates.


1.
Introduction. Currently it is the digital era where there is a steady flood of information. Such information inundation makes a variety of mass media more important, for example, newspapers, broadcast, social network system media, and public speaking. Before developing mass media, rumors propagated by word of mouth and played a crucial role in communication between people or groups. This process can be understood as a kind of homogenization of information system and social interaction [1]. With the emergence of multimedia and social media, rumors have spread faster and have wide transmissions [5]. However, some harmful and powerful rumor outbreaks arise from such wide transmission via these media [10,14,18]. Moreover, their influence causes multiple effects for a variety of situations rather than the mono effect for localized situations [12].
As a benefit in return for the homogenization, personality is more heavily emphasized and the diversity of people has garnered much attention in our social community. In the microscopic viewpoint of rumor spreading, this variety of characteristics is important. Many researchers already have investigated that the degree of belief is important in rumor spreading [8,16]. From this perspective, we assume that there will be various groups that share the same trust rate. In this paper, we propose an SIR type rumor spreading model with given spreading rate distributions λ i , 1 ≤ i ≤ N . Each spreading rate distribution λ i represents a different character of several classes of groups. With the distribution λ i , we present a sufficient condition for the rumor outbreak. To obtain a rumor outbreak, we need a sufficiently large initial quantity that represents the momentum of rumor spreading. We also provide numerical simulations to verify our analysis with several combinations of different parameters. We notice that the authors in [19] studied an SIR type rumor spreading model with a reputation mechanism and considered a probability that represents the reputation of the opinion, where reputation is related to the trust rate. They used a single ignorant SIR model. On the other hand, we consider a model with several classes of ignorants and trust rate distributions λ i , 1 ≤ i ≤ N .
Next we provide a brief historical review of the rumor spreading model. Starting the pioneering studies by Daley and Kendall [3,4], a lot of researchers have studied rumor spreading and tried to build mathematical models [11,17]. Zanette [23,24] numerically obtained the existence of a critical threshold for a rumor spreading model regarding small-world networks. In [13], the authors derived the mean-field equation of complex heterogeneous networks. For other topological settings, see [7,15]. Most mathematical models for rumor spreading are based on the epidemic model. In [27], the authors considered an SIR type rumor spreading model with forgetting mechanism. See also [6,28] for other models with forgetting mechanisms. In [26], the authors added a hibernator variable to the SIR type rumor spreading model. Similarly, in [20,22], the authors adapted several new variables to construct a more realistic model for the rumor spreading phenomena. In [25], the authors employed the probability that ignorants directly become stiflers when they are aware of a rumor. We refer to papers [2,9,29] for other rumor spreading models.
The paper is organized as follows. In Section 2, we present the trust distribution and its mechanism in the SIR type model. In Section 3, we derive a single equation for the rumor size φ. In Section 4, we provide proof of the main theorem. In Section 5, we demonstrate our results by numerical simulations. Finally, we summarize our results in Section 6. Notation: Throughout the paper, we use the following simplified notation: , . . . , I N (t)),I = (I 1 , . . . ,I N ),I n = (I n 1 , . . . ,I n N ), n, N ∈ N.
2. Spreading rate distribution model. Let V and E be sets of vertices and edges, respectively. Representing the individuals and contacts as the vertices and edges, a social network leads to an undirected graph G = (V, E). A general social network is close to a small-world network [21]. In [13], the authors derived the mean-field rate equation based on the Poisson distribution of small-world network. As in [13], we consider a rumor spreading model based on the SIR model of a homogeneous network.
There are three groups of populations: ignorants (I), spreaders (S), and stiflers (R). At the first stage, ignorants contact a spreader, realize a rumor, and accept the hearsay. According to the acceptance with rate λ, some of them become spreaders and then spread the rumor to other ignorants. However, as spreaders lose interest in spreading the rumor, they become stiflers. Based on this mechanism, the SIR rumor spreading model [3,4] is given bẏ where k is the average degree of the network, λ is the spreading rate of the system, σ 1 is the contact rate between spreaders, and σ 2 is the contact rate between spreaders and stiflers.
As in [25], we assume that spreaders lose their interest in rumors with probability δ and become stiflers. Moreover, stiflers interact with spreaders to create other stiflers from other spreaders. Spreaders also have a negative effect on other spreaders because they consider the rumor to be outdated if the spreader meets with other spreaders frequently. For simplicity, we assume that the contact rates σ 1 and σ 2 are the same, say σ = σ 1 = σ 2 . As mentioned before, we consider several groups of ignorants with different spreading rates λ i , i = 1, . . . , N , motivated by [8,16]. The mean-field equation is then given bẏ subject to initial data I i (0) =I i , i = 1, . . . , N, S(0) =S, R(0) =R, where I i is the population density of the ith group of ignorants with spreading (trust) rate λ i . S and R are the density of spreaders and stiflers, respectively. Moreover, σ is the contact rate between spreaders and stiflers, and δ denotes the decay rate of spreaders to stiflers.
Throughout this paper, we assume that (1) k, σ and δ are fixed positive constants.
(2) The spreading (trust) rate distribution λ i is nonnegative constant for each 1 ≤ i ≤ N . We will consider a family of initial dataI 1 , . . . ,I N ,S andR such that T = N j=1I j +S +R for a fixed total initial populationT .
Next, we define the rumor size, a momentum type quantity of the initial data and rumor outbreak.
Definition 2.1. [19,25,26]For a solution (I, S, R) to system (1), we define the rumor size φ of (I, S, R): Definition 2.2. Let (I, S, R) be a solution to system (1) with initial dataI,S and R. We define initial reliability of ignorants M 1 (I):

BUM IL HONG, NAHMWOO HAHM AND SUN-HO CHOI
and total population with initial T (0) =T : Definition 2.3. Let (I, S, R) be solutions to system (1) subject to initial dataI, S andR = 0. If φ(t) in Definition 2.1 converges as t → ∞, we define φ ∞ as the final size of the rumor: Definition 2.4. For a given initial dataI,S andR of system (1) withS = 0 and R = 0, letI n ,S n andR n be sequences satisfying We additionally assume that the total populations are the same: We say that a rumor outbreak occurs if the following limit exists and φ e (I) is positive, where φ ∞ (I n ,S n ) is the final size of the rumor for the initial dataI n ,S n ,R n .

Remark 1.
(1) In [13,15,25], the authors define that the rumor outbreak occurs if lim This is essentially equivalent to Definition 2.4. We use φ(∞) instead of R(∞), since . See the result in Lemma 3.3.
(2) The rumor spreading begins with one spreader. Therefore,S = 1/N , where N is the total population number. Generally, N is a large number and this implies that S ≈ 0. However, if we assume thatI =T andS =R = 0, then the corresponding solution (I(t), S(t), R(t)) is the trivial stationary solution. Therefore, to get an intrinsic property of the system, we have to consider a limit of sequence with initial dataS n → 0.
The following is the main theorem of this paper.
We assume that eachS n is positive,I n →I andS n → 0 for an N-dimensional vectorI, andT Then, there exists the following limit of steady states: where φ ∞ (I n ,S n ) is the final size of the rumor for the initial dataI n andS n with Remark 2. An equivalent condition of occurring a rumor outbreak is 3. An equation for rumor size φ. In this section, we derive a single equation for φ and consider the steady state analysis for the rumor spreading model (1) via a derived single equation of φ from the next argument.
Lemma 3.1. Let (I, S, R) be a solution to system (1) with an initial dataI,S and R. Then each I i (t) satisfies where φ(t) is a function defined in Definition 2.1.
Proof. From the first equation of system (1), we have Integrating the above relation gives For the population density of S(t), we can obtain the following formula for I i : Lemma 3.2. Let (I, S, R) be a solution to system (1) with initial dataI,S andR. For the given initial data, the total population T (t) of the solution to system (1) is conserved. Thus, we have Proof. Note that the summation of all equations in system (1) yields N i=1İ i +Ṡ +Ṙ = 0.
Integrating the above equation leads to (2), we easily obtain the following formula for S(t):

Remark 3. By the conservation property (3) in Lemma 3.2 and the formula in
Lemma 3.3. Let (I, S, R) be a solution to system (1) with initial dataI,S andR. Then R(t) is a function depending on φ: Proof. The third equation in system (1) gives us that From (4) and the definition of φ: We directly have K 1 and K 4 with For K 2 , we use λ i = 0 for all 1 ≤ i ≤ N . By the change of variables and the fact that φ(0) = 0, we obtain Similarly, we have K 3 with Therefore, the above elementary calculations yield The formula (4) of S(t) implies that By the result in Lemma 3.3, we derive a single decoupled equation for φ such that For simplicity, we define F (φ) =F (φ,I,S,R,T ) Then, φ(t) is the solution to the following single equation subject to initial data 4. Steady state analysis. In this section, we use the steady state analysis to obtain the threshold phenomena for asymptotic behavior of the solution to system (1). To obtain the asymptotic behavior of solutions to (6), we first consider a steady state φ to (6). In other words, the steady state φ satisfies where F (φ) = F (φ,I,S,R,T ) is the function defined in (5). Therefore, φ is one of solutions to equation (7). Using a standard method from [19,25,26], we can obtain a sufficient condition for the existence of nontrivial zeros. We define G and H by and Then, we divide F into two parts G and H with F (φ) = G(φ) − H(φ). Note that F is the difference between the exponential part G and the linear part H. Hence equation (7) is equivalent to the following: For the next result, we take the limit such that Notice that the second term on the right hand side of the above equation is finite.
Proof. Note that the derivative of G is We can calculate the first term in the above as Thus, if at least one non-zero λ iIi exists, we have Proof. Note that Therefore, δ+kσT −kσ λi=0I i is positive and this means that δ+kσT > kσ where φ(t) is the rumor size satisfying (6). Moreover, φ ∞ (I,S) is the smallest positive zero of F (·) such that F (φ ∞ (I,S)) = 0.
Proof. This follows from an elementary result of ordinary differential equations. Note that for given initial dataS > 0,I ≥ 0 andR = 0, the corresponding equatioṅ φ = F (φ) is autonomous. Therefore, we can apply Lyapunov's stability theorem. For a fixedS > 0, F (0) =S > 0. This shows that φ(t) is increasing near t = 0 and F (x) > 0 on {0 < x < φ ∞ }. Moreover, F (x) is differentiable with respect to x, which implies that φ(t) → φ ∞ as t → ∞ by an elementary result of ordinary differential equations. Therefore, So, This yields and the continuity of F implies that there is a positive real number φ > 0 such that Thus, the intermediate value theorem and (10) show that F (φ,I,S,R,T ) = 0 has a positive solution φ > 0. In order to complete the proof of this proposition, it suffices to verify that the equation has a unique solution φ = 0 on {φ ≥ 0} if kM 1 ≤ δ.
The fact in (10) with F (0) = 0 leads us to Therefore, we complete the proof.
We are now ready to prove the main theorem.
The proof of the main theorem. LetR n =R = 0 and letI n andS n be sequences such thatI n →I,S n → 0.
First, assume that kM 1 (I) > δ. By (12), we have Note that (11) implies that Therefore, By (13), there is N 0 ∈ N such that if n > N 0 , then and Thus, there are constants φ > 0, N 0 ∈ N such that if 0 ≤ φ < φ and n > N 0 , then ∂F ∂φ (φ,I n ,S n ,R n ,T ) > 0. (14) In order to prove convergence, we consider differentiable functions I(s), S(s) and R(s) with respect to s ∈ R such that > 0, the implicit function theorem implies that φ(s) is differentiable near s = 0. Thus, φ ∞ (I n ,S n ) = φ(1/n) converges. We now prove that φ ∞ n → φ e > 0. Assume not, that is φ ∞ n → 0 as n → ∞. Then there is a N 1 ∈ N such that n > N 1 implies φ ∞ n (S) < φ . We may take N 1 ∈ N such that N 1 > N 0 .
For n > N 1 , we have F (0,I n ,S n ,R n ,T ) =S n > 0 and F (φ ∞ n ,I n ,S n ,R n ,T ) = 0. However, by (14), ∂F ∂φ (φ,I n ,S n ,R n ,T ) > 0. This is a contradiction. Thus we obtain the desired result.
5. Numerical simulation. In this section, we numerically provide the solutions to system (1) with respect to several δ and compare them with the analytical results in Section 4. The main result in this paper suggests that the condition for rumor outbreak is that M 1 (I 0 ) is less than δ/k. For the numerical simulations, we used the fourth-order Runge-Kutta method with the following parameters: We take sufficiently large initial dataI i , i = 1, 2 and 3, and sufficiently smallS such thatI 1 =I 2 =I 3 = 9999,S = 3,R = 0. To see the threshold phenomena for M 1 (I 0 ) and δ/k, we consider δ = 0.5 × 10 5 , 1.5 × 10 5 , 2.5 × 10 5 , 3.5 × 10 5 , 4.5 × 10 5 and 5.5 × 10 5 .
Note that in Proposition 1, we rigorously obtained that the final size of the rumor φ ∞ = lim t→∞ φ(t) is the smallest positive zero of F (φ). In Figure 1, we plotted the rumor size φ(t) and F (φ) with respect to several δ > 0. Here, we can observe that the final size of the rumor φ ∞ is also the smallest positive zero of F (φ). Thus the numerical results are consistent with the analytical result.
In Figure 2, we plotted the densities of the spreaders (S) and the stiflers (R) with respect to several δ > 0. Thus, we can see that the rumor size are proportional to 1/δ. In Figure 3, we plotted φ ∞ with respect to δ > 0 to see the threshold phenomena for M 1 (I 0 ) and δ/k. Note thatS 0, M 1 (I) = λ 1I1 + λ 2I2 + λ 2I2 6 × 10 4 . From our analytic results, we can expect that the threshold occurs when δ = kM 1 (I) 6 × 10 5 . In Figure 3, φ ∞ decreases almost linearly in δ, and the graph of φ ∞ (δ) is very close to the line φ ∞ = 0 as δ goes to 6 × 10 5 . Therefore, this numerical simulation coincides with our analytic result. By the way, a small error occurs between the analytical and the numerical results. We guess that this error may result from the nonzero assumption forS > 0. 6. Conclusion. In this paper, we consider the rumor spreading model with the trust rate distribution. The model consists of several ignorants with trust rates λ i , i = 1, . . . , N . We provide the threshold phenomenon for this model by using classical steady state analysis. Fortunately, we can obtain the corresponding equation of rumor size for this model with several types of ignorants. We also present a rigorous proof for the convergence result. As seen from the steady state analysis, we obtain that the threshold phenomena depends on the decay rate δ of spreaders to stiflers and the momentum type quantity M 1 defined in Definition 2.2:M 1 (I) = N i=1 λ iIi .
We conclude that a necessary and sufficient condition for rumor outbreak is that the trust momentum M 1 (I) is greater than some combination of parameters δ/k.