# Rumor Spreading of an SIHR Model in Heterogeneous Networks Based on Probability Generating Function

Authors: Jinxian Li; Yanping Hu; Zhen Jin
Journal: Complexity
 (2019)

---

## Abstract

This paper focuses on the modeling of a rumor spreading in heterogeneous networks. Using the probability generating function method and pair approximation method, the current research obtains nonlinear differential equations to describe the dynamics of rumor spreading. The comparison between numerical simulations and Monte Carlo simulations confirms the accuracy of our model. Furthermore, the threshold condition is also obtained in this paper. The numerical simulation results show that the heterogeneity of the network accelerates the outbreak of rumors but reduces the maximum density of spreader and the scale of rumors. The present study also examines the effects of parameters on rumor transmission and the differences between rumor transmission recovery mechanisms and disease transmission recovery mechanisms.


---

## Body

## 1. Introduction

Rumor is an important form of human communication. It can be interpreted as an infection of the mind, which is also defined as a typical social phenomenon which runs through the whole evolution of mankind [1]. Its spreading can cause damage to personal reputations, affect the financial markets, and cause social panic and instability [2, 3]. Traditionally, rumors are propagated by word of mouth [4]. Nowadays, with the emergence of the Internet, people can spread rumors with instant messengers, emails or microblogs, and so on, which speeds up the dissemination of rumors virtually and makes rumors more influential than ever before [5]. The research on rumor propagation will offer us a thorough understanding of this issue and allow us to predict and reduce the possible harms caused by rumor propagation.The study of the spread of the rumor began in the 1960s. Daley and Kendall [6, 7] first proposed the classical DK model of rumor spreading in which the total population is divided into three groups: the people who are spreading the rumor (spreaders), those who have never heard the rumor (ignorants), and the ones who have heard the rumor but do not spread it (stiflers), and they denoted them as S, I, and R, respectively. Afterwards, Maki and Thomson [8] developed another classical MK model in 1973, which focused on the analysis of the rumor spreading based on mathematical theory via direct contact between spreaders and others. After that, more and more scholars paid attention to the spread of rumors. On one hand, more refined rumor spreading models are derived to model more detailed processes; on the other hand, the impacts of network structure on the rumor spreading are noticed.To describe the process of rumor spread more carefully, the population is divided more finely. Xia et al. [9] extended the classic SIR rumor spreading model to a new SEIR rumor propagation model considering hesitating mechanism in complex social networks. Exposed (E) are those who have been infected, in the hesitating state, and do not spread rumors. In addition, in real life, there may be some people who do not agree with the rumor. They may persuade others to resist the rumor propagation. So Zan et al. [10] presented a susceptible-infected-counter-susceptible (SICS) rumor spreading model with counter mechanism in complex social networks. Then they derived mean-field equations to describe their dynamics in homogeneous networks and study the steady-state. In many cases, a rumor that concerns one event does not spread along, as a rumor cannot always spread without being affected by another rumor. To investigate the effects of interactions between two rumors, Jie et al. [11] built a model of a two-rumor interaction in which each individual has two states, which correspond to the attitudes toward each of the two rumors, and they built the corresponding ODE system. Gu et al. [12] revealed that the forgetting and remembering mechanism has great influence on the spread of rumors by extensive simulations. In view of this, Zhao et al. [13] added a new compartment, Hibernators, to the classic SIR model and they derived a new rumor spreading model, Ignorant-Spreader-Hibernator-Stifler (SIHR) model in homogeneous networks. They [13] investigated the final size of the rumor spreading under various spreading rates, stifling rates, forgetting rates, and average degrees of the network. All the above work studied rumor propagation in homogeneous networks, and the models were mean-field equations. Since the model loses a lot of information on the network, the threshold, below which the rumor final size is necessarily proportional to the fraction of initial speaker nodes but above which it is proportional to a fraction of the population, and the rumor final size may be missing in such case.As early as in 1994, Lefevre and Picard [14] revealed the importance of network structure to rumor spreading. In fact, the topology of social networks shows highly complex connectivity in which each individual has a random number of connections to other individuals [15]. Zenette [16, 17] and Buvna et al. [18] performed a series of simulations in both static and small-world networks and showed the existence of a critical threshold of rumor spreading. So the influence of network structure on rumor spreading had been paid more and more attention to. Nekovee et al. [19] extended the former dynamic model to scale-free networks with assortative degree correlations and noticed the effect of degree correlation on rumor spreading. Moreno et al. [20] took into account that not only could nodes be in three different states (S, I, R), but also they belong to different connectivity classes k and built a mean-field equations which is degree-dependent. Zhao et al. [21] also extended their work in [13] to describe rumor propagation by means of the degree-dependent mean-field equation. See more similar work in [22–27].Heterogeneity makes it difficult to derive differential equations to describe the epidemic. In fact, the heterogeneity of the network is not only reflected in the heterogeneity of degree distribution, but also in the locality of rumor spreading along the edge. So we try to find a better way to describe rumor spreading, rather than mean-field theory. Volz et al. [28] resolved this dilemma by showing the SIR-epidemic dynamics with a system of three nonlinear ODE’s which involves the PGF. See more similar work in [29, 30]. In this work, we try to describe the rumor spreading in [13, 21] by the method based on PGF. There are still differences between rumor spreading and disease spreading mechanism. In the process of disease transmission, the recovery of the infected persons is not related to other nodes. The recovery is not dependent on the network structure. However, since the spreading wants to recover, he has to contact a node that is not an ignorant, so, the rumor recovery mechanism depends on the network structure. What is more, the population can move between the compartment of the hibernators and the spreaders in the rumor spreading. For these reasons, the establishment of rumor propagation model based on PGF encounters irresolvable difficulties. So we have to combine the PGF and the pair approximation method to model this process. Our results show that this method is indeed a better way to describe the rumor propagation. Then we also examine the effects of parameters on rumor transmission and the differences between rumor transmission recovery mechanisms and disease transmission recovery mechanisms.The remainder of this paper is organized as follows. We derive the nonlinear ODE’s model to describe the dynamics of the rumor spreading in Section2. Furthermore, we obtain the rumor spreading threshold. In Section 3, we test this model in Poisson network and a refined scale-free network and compare the numerical simulations with Monte Carlo simulations, which shows that the numerical simulations of our model more consistently fit in with the Monte Carlo simulations. Then numerical simulations are conducted to further investigate the properties of parameters on the spread of the rumor. Finally, conclusions and discussions are given.


## 2. SIHR Model in Random Networks

This section introduces a low-dimensional system that models the percolation of an SIHR-rumor spreading in a heterogeneous network. It also obtains the disease thresholds.


### 2.1. Rumor Propagation Mechanism

This paper uses the rumor spreading rules proposed in Zhao et al. [13], which can be summarized as follows. (1) When a spreader contacts with an ignorant, the last one becomes a spreader with probability λ, namely, spreading rate. (2) When an ignorant contacts a spreader, the ignorant becomes a stifler with probability β directly, namely, refusing rate. (3) The hibernators reflect the repeatability of rumor spreading. The spreaders could forget the rumor and then remember it. Spreaders spontaneously forget the rumor and switch their state to hibernators at the rate δ as a result of the forgetting mechanism, namely, forgetting rate. The remembering mechanism also exists for hibernators. Hibernators spontaneously remember the rumor and become the spreaders at the rate ξ that is called spontaneous remembering rate. Besides, when a Hibernator contacts a spreader, the hibernator switches to be a spreader with probability η, namely, wakened remembering rate. (4) When a spreader contacts another spreader or a hibernator or a stifler, only the initiating spreader turns into a stifler with probability α, namely, stifling rate.When a rumor spreads through a network, the nodes can be in any of the exclusive states: ignorants(I), spreaders (S), hibernators (H), and stiflers,(R), respectively. We use S, I, H, and R to denote the fraction of nodes in the sets I, S, H, and R, respectively. In addition, they satisfy the normalization condition: S(t)+I(t)+H(t)+R(t)=1. The SIHR rumor spreading process is shown in Figure 1.Figure 1
SIHR rumor spreading process.


### 2.2. Our Model

To model the above rumor spreading progress in a heterogeneous network, we consider a closed and mixed populationG=(V,E) with N individuals, where V={v1,v2⋯,vN} is the set of vertices representing the individuals and E is the set of edges representing the connections among individuals. We also assume that contacts are symmetric, that is, if an edge (v1,v2)∈E connects v1 to v2, then an edge also connects v2 to v1. Although the network is undirected (i.e., rumor can spread from each other), we wish to keep track of who spread. Therefore, for each edge (v1,v2)∈E, we define two arcs as the ordered pairs (v1,v2) and (v2,v1). The first and second elements in the ordered pair (v1,v2) are frequently called the ego and the alter, respectively [28]. Let pk be the degree distribution. Then p(k) is the proportion of nodes having k network contacts; i.e., p(k)=[k]/N, which can reveal the structure of this network. Then the probability generating functions (PGFs) of the degree distribution are given by (1)gx=∑kpkxk.Let k- and k2- be the averaged degree and averaged second-moment. Then they are g′(1) and g′′1+g′(1), respectively.Since the network is heterogeneous, we useSk(t), Ik(t), Hk(t), and Rk(t) to denote the density of spreaders, ignorants, hibernators, and stiflers with degree k at time t, respectively. In addition, they satisfy the normalization condition: Sk(t)+Ik(t)+Hk(t)+Rk(t)=1. Since our model is an extension of the network SIR model of Volz [28], we also need some notations in [28]. Let θ represent the fraction of degree one nodes that remain ignorant at time t and PAB represent the probability that an arc with an ego in state A has an alter in state B, where A and B may be I, S, H, or R. Given θ, it is easy to determine the fraction of nodes which remain ignorants at time t; i.e., (2)I=p0+p1θ+p2θ2+⋯=gθ.The model is formulated as follows:(3)θ˙=-λ+βPISθ,Sk˙=-δSk+ξHk+λkIkPIS+ηkHkPHS-αkSk-kSkθg′θPISΣkpkSk,Hk˙=δSk-ξHk-ηkHkPHS,PIS˙=-λ+β+δPIS+ξPIH+λθg′′θPIIPISg′θ+λ+βPIS2+ηΣkkk-1pkHkΣkkpkHkPIHPHS-αΣkkk-1pkSkPISΣkkpkSk1-θg′θPISΣkkpkSk,PII˙=λ+βPIIPIS-λ+βθg′′θPIIPISg′θ,PIH˙=-ξPIH+δPIS+λ+βPISPIH-ηΣkkk-1pkHkPIHPHSΣkkpkHk,PHS˙=δΣkkpkSkPSS-PHSΣkkpkHk+ξPHH+λθ2g′′θPISPIHΣkkpkHk+ηΣkkk-1pkHkPHHPHSΣkkpkHk-δ+η+αPHS-αΣkkk-1pkSkPHSΣkkpkSk1-θg′θPISΣkkpkSk+ηPHS2,PHH˙=2δPHS-ξPHH-ηΣkkk-1pkHkPHHPHSΣkkpkHk-δΣkkpkSkpHHΣkkpkHk+ηPHSPHH,PSS˙=-α-δPSS+ΣkkpkHkΣkkpkSk2ξPHS-ξPSS+2ηPHS-ηPHSPSS+λθ2g′′θΣkkpkSkPIS2PIS-PSS+ηΣkkk-1pkHkΣkkpkSkPHS2PHS-PSS+λθg′θΣkkpkSkPIS2-PSS-αΣkkk-1pkSkPSSΣkkpkSk+αθg′θΣkkk-1pkSkPSSPISΣkkpkSk2-αθg′θPISPSSΣkkpkSk.It should be noted that since the spreaders and the hibernators can be transformed into each other, the model cannot be established by simply using the methods in the literature [28], which is the difficulty of the modeling process. The modeling process is given in detail in Appendix.


### 2.3. Initial Conditions and Spreading Threshold

If the probability of a node with degreek selected uniformly at random and initial spreader is ϵk, we can anticipate the following initial condition.(1)
Sk=ϵkNk/Nk=ϵk, MS=Σkpkϵk/Σkpk, MIS≈MS=Σkpkϵk/Σkpk.(2)
MI=1-MIS=1-Σkpkϵk/Σkpk, MII=MI-MIS=1-2Σkpkϵk/Σkpk.(3)
PIS(t=0)=MIS/MI=Σkpkϵk/Σkpk-Σkpkϵk, PII(t=0)=MII/MI=Σkpk-2Σkpkϵk/Σkpk-Σkpkϵk.(4)
Hk=0, PIH=0 (because there is no hibernator initially).(5)
θ≈1, which can be interpreted as the fraction of nodes remaining ignorant.Applying the initial conditions above into thePIS˙ and considering ϵk≪1 give(4)PIS˙t=0≈-λ+β+δΣkpkϵkΣkpk-Σkpkϵk+λg′′1g′1ΣkpkϵkΣkpk-ΣkpkϵkΣkpk-2ΣkpkϵkΣkpk-Σkpkϵk+λ+βΣkpkϵkΣkpk-Σkpkϵk2-αΣkk-1pkϵkΣkpk-Σkpkϵk+αg′1Σkk-1pkϵkΣkpk-Σkpkϵk2.For (4), giving up the higher order items gets (5)PIS˙t=0≈-λ+β+δΣkpkϵkΣkpk+λg′′1g′1ΣkpkϵkΣkpk-αΣkk-1pkϵkg′1+αΣkk-1pkϵkg′1=λg′′1g′1-λ+β+δΣkpkϵkg′1.Because Σkpkϵk/g′(1)>0, the condition to guarantee PIS>0 is (6)λg′′1g′1-λ+β+δ>0.Therefore, the threshold is(7)λc=β+δg′1g′′1-g′1On the basis of above theoretical analysis, a nonzero rumor diffusion thresholdλc would be present. If λ>λc, the rumor diffuses and necessarily occupies a fraction of population even as ϵk→0. And the rumor only spreads an infinitesimally small number of spreaders which approximates to zero compared with large population while λ is below threshold λc. Next, take different values for ϵk as ϵk=ϵ, ϵk=ϵk and ϵk=ϵ1/k. Equation (5) shows that the choice of ϵk does not affect the outbreak of the rumor. However,(8)PIS˙ϵk=ϵ1/k>PIS˙ϵk=ϵ>PIS˙ϵk=ϵk.Hence, the selection of initial spreader nodes will not affect the threshold, but will affect the speed of rumor expansion.We should also note that there is a threshold for rumor spreading in this paper, which is absent in the literature [13, 21]. Furthermore, the threshold depends not only on averaged degree g′(1) but also on the fluctuations of the connectivity distribution g′′(1).


## 2.1. Rumor Propagation Mechanism

This paper uses the rumor spreading rules proposed in Zhao et al. [13], which can be summarized as follows. (1) When a spreader contacts with an ignorant, the last one becomes a spreader with probability λ, namely, spreading rate. (2) When an ignorant contacts a spreader, the ignorant becomes a stifler with probability β directly, namely, refusing rate. (3) The hibernators reflect the repeatability of rumor spreading. The spreaders could forget the rumor and then remember it. Spreaders spontaneously forget the rumor and switch their state to hibernators at the rate δ as a result of the forgetting mechanism, namely, forgetting rate. The remembering mechanism also exists for hibernators. Hibernators spontaneously remember the rumor and become the spreaders at the rate ξ that is called spontaneous remembering rate. Besides, when a Hibernator contacts a spreader, the hibernator switches to be a spreader with probability η, namely, wakened remembering rate. (4) When a spreader contacts another spreader or a hibernator or a stifler, only the initiating spreader turns into a stifler with probability α, namely, stifling rate.When a rumor spreads through a network, the nodes can be in any of the exclusive states: ignorants(I), spreaders (S), hibernators (H), and stiflers,(R), respectively. We use S, I, H, and R to denote the fraction of nodes in the sets I, S, H, and R, respectively. In addition, they satisfy the normalization condition: S(t)+I(t)+H(t)+R(t)=1. The SIHR rumor spreading process is shown in Figure 1.Figure 1
SIHR rumor spreading process.


## 2.2. Our Model

To model the above rumor spreading progress in a heterogeneous network, we consider a closed and mixed populationG=(V,E) with N individuals, where V={v1,v2⋯,vN} is the set of vertices representing the individuals and E is the set of edges representing the connections among individuals. We also assume that contacts are symmetric, that is, if an edge (v1,v2)∈E connects v1 to v2, then an edge also connects v2 to v1. Although the network is undirected (i.e., rumor can spread from each other), we wish to keep track of who spread. Therefore, for each edge (v1,v2)∈E, we define two arcs as the ordered pairs (v1,v2) and (v2,v1). The first and second elements in the ordered pair (v1,v2) are frequently called the ego and the alter, respectively [28]. Let pk be the degree distribution. Then p(k) is the proportion of nodes having k network contacts; i.e., p(k)=[k]/N, which can reveal the structure of this network. Then the probability generating functions (PGFs) of the degree distribution are given by (1)gx=∑kpkxk.Let k- and k2- be the averaged degree and averaged second-moment. Then they are g′(1) and g′′1+g′(1), respectively.Since the network is heterogeneous, we useSk(t), Ik(t), Hk(t), and Rk(t) to denote the density of spreaders, ignorants, hibernators, and stiflers with degree k at time t, respectively. In addition, they satisfy the normalization condition: Sk(t)+Ik(t)+Hk(t)+Rk(t)=1. Since our model is an extension of the network SIR model of Volz [28], we also need some notations in [28]. Let θ represent the fraction of degree one nodes that remain ignorant at time t and PAB represent the probability that an arc with an ego in state A has an alter in state B, where A and B may be I, S, H, or R. Given θ, it is easy to determine the fraction of nodes which remain ignorants at time t; i.e., (2)I=p0+p1θ+p2θ2+⋯=gθ.The model is formulated as follows:(3)θ˙=-λ+βPISθ,Sk˙=-δSk+ξHk+λkIkPIS+ηkHkPHS-αkSk-kSkθg′θPISΣkpkSk,Hk˙=δSk-ξHk-ηkHkPHS,PIS˙=-λ+β+δPIS+ξPIH+λθg′′θPIIPISg′θ+λ+βPIS2+ηΣkkk-1pkHkΣkkpkHkPIHPHS-αΣkkk-1pkSkPISΣkkpkSk1-θg′θPISΣkkpkSk,PII˙=λ+βPIIPIS-λ+βθg′′θPIIPISg′θ,PIH˙=-ξPIH+δPIS+λ+βPISPIH-ηΣkkk-1pkHkPIHPHSΣkkpkHk,PHS˙=δΣkkpkSkPSS-PHSΣkkpkHk+ξPHH+λθ2g′′θPISPIHΣkkpkHk+ηΣkkk-1pkHkPHHPHSΣkkpkHk-δ+η+αPHS-αΣkkk-1pkSkPHSΣkkpkSk1-θg′θPISΣkkpkSk+ηPHS2,PHH˙=2δPHS-ξPHH-ηΣkkk-1pkHkPHHPHSΣkkpkHk-δΣkkpkSkpHHΣkkpkHk+ηPHSPHH,PSS˙=-α-δPSS+ΣkkpkHkΣkkpkSk2ξPHS-ξPSS+2ηPHS-ηPHSPSS+λθ2g′′θΣkkpkSkPIS2PIS-PSS+ηΣkkk-1pkHkΣkkpkSkPHS2PHS-PSS+λθg′θΣkkpkSkPIS2-PSS-αΣkkk-1pkSkPSSΣkkpkSk+αθg′θΣkkk-1pkSkPSSPISΣkkpkSk2-αθg′θPISPSSΣkkpkSk.It should be noted that since the spreaders and the hibernators can be transformed into each other, the model cannot be established by simply using the methods in the literature [28], which is the difficulty of the modeling process. The modeling process is given in detail in Appendix.


## 2.3. Initial Conditions and Spreading Threshold

If the probability of a node with degreek selected uniformly at random and initial spreader is ϵk, we can anticipate the following initial condition.(1)
Sk=ϵkNk/Nk=ϵk, MS=Σkpkϵk/Σkpk, MIS≈MS=Σkpkϵk/Σkpk.(2)
MI=1-MIS=1-Σkpkϵk/Σkpk, MII=MI-MIS=1-2Σkpkϵk/Σkpk.(3)
PIS(t=0)=MIS/MI=Σkpkϵk/Σkpk-Σkpkϵk, PII(t=0)=MII/MI=Σkpk-2Σkpkϵk/Σkpk-Σkpkϵk.(4)
Hk=0, PIH=0 (because there is no hibernator initially).(5)
θ≈1, which can be interpreted as the fraction of nodes remaining ignorant.Applying the initial conditions above into thePIS˙ and considering ϵk≪1 give(4)PIS˙t=0≈-λ+β+δΣkpkϵkΣkpk-Σkpkϵk+λg′′1g′1ΣkpkϵkΣkpk-ΣkpkϵkΣkpk-2ΣkpkϵkΣkpk-Σkpkϵk+λ+βΣkpkϵkΣkpk-Σkpkϵk2-αΣkk-1pkϵkΣkpk-Σkpkϵk+αg′1Σkk-1pkϵkΣkpk-Σkpkϵk2.For (4), giving up the higher order items gets (5)PIS˙t=0≈-λ+β+δΣkpkϵkΣkpk+λg′′1g′1ΣkpkϵkΣkpk-αΣkk-1pkϵkg′1+αΣkk-1pkϵkg′1=λg′′1g′1-λ+β+δΣkpkϵkg′1.Because Σkpkϵk/g′(1)>0, the condition to guarantee PIS>0 is (6)λg′′1g′1-λ+β+δ>0.Therefore, the threshold is(7)λc=β+δg′1g′′1-g′1On the basis of above theoretical analysis, a nonzero rumor diffusion thresholdλc would be present. If λ>λc, the rumor diffuses and necessarily occupies a fraction of population even as ϵk→0. And the rumor only spreads an infinitesimally small number of spreaders which approximates to zero compared with large population while λ is below threshold λc. Next, take different values for ϵk as ϵk=ϵ, ϵk=ϵk and ϵk=ϵ1/k. Equation (5) shows that the choice of ϵk does not affect the outbreak of the rumor. However,(8)PIS˙ϵk=ϵ1/k>PIS˙ϵk=ϵ>PIS˙ϵk=ϵk.Hence, the selection of initial spreader nodes will not affect the threshold, but will affect the speed of rumor expansion.We should also note that there is a threshold for rumor spreading in this paper, which is absent in the literature [13, 21]. Furthermore, the threshold depends not only on averaged degree g′(1) but also on the fluctuations of the connectivity distribution g′′(1).


## 3. Numerical Simulations and Monte Carlo Simulations

In this section, we carry out Monte Carlo simulations and numerical simulations to verify the above analytical results and further investigate the effects of parameters on the rumor spreading model. For Monte CarloN=104. The detailed process can be seen in [31]. If no otherwise specified, the numerical simulations of model (3) are performed with N=104. Since model (3) involves Sk and Hk, (k=1,2,…), to simplify the problem, we truncated the network to a maximum degree of 30. The initial condition of the numerical simulations of the model is ϵ=10-4. For the sake of conveniences, we define the cumulative rumor incidence as the fraction of nodes spreaders, stiflers, or hibernators. The peak value of spreader density max⁡{S(t)} can be used to measure the maximum rumor influence.In Figure2, the black solid lines show the result of 100 Monte Carlo simulations for an SIHR rumor model in a network with the Poisson degree distribution with k-=10. The red solid lines and green star lines represent numerical simulation trajectories based on the mean-field systems in [13] and [21], respectively. The blue dashed lines represent numerical simulation trajectories based on system (3). Figure 2(a) exhibits the trajectories of the density of spreaders and (b) exhibits the cumulative rumor incidence (densities of spreaders, stiflers and hibernators). And obviously, the blue dashed lines which cut through the dense mass of simulation trajectories are the analytical trajectories based on model (3). This implies that the model of (3) can well describe the spread of rumors in complex networks.Figure 2
Simulations withλ=0.7, β=0.3, α=0.2, δ=0.1, ξ=0.1, and η=0.2. The black lines correspond to 100 Monte Carlo simulations for an SIHR rumor model in a network with the Poisson degree distribution with k-=10. The red solid lines and green star lines represent numerical simulation trajectories based on the mean-field system in [13] and [21], respectively. The blue dashed lines represent numerical simulation trajectories based on system (3). (a) The trajectories of the density of spreaders. (b) The trajectories of the densities of spreaders, stiflers, and hibernators.
(a) (b)In order to further verify the reliability of model (3), we perform Monte Carlo simulations and numerical simulations of model (3) in a refined Power-law network. The network considered here can be generated by assigning a random number of lines to a set of N nodes according to the distribution pk, where (9)pk=1-∑k=2304390k-1.2,k=1,4390k-1.2,k=2,3,…,30.Then by the Configuration Model (CM) process [31], we can get a new network which is shown to have characteristic of Power-law network in Figure 3. Figure 3 shows the degree distribution of this new network in double logarithmic coordinates system.Figure 3
Degree distribution of refined power-law network.In Figure4, the Monte Carlo simulations for the network with the refined Power-law degree distribution in Figure 3 and the numerical simulation of model (3) and the mean-field system in [13, 21] are performed with N=104 and pk in Figure 3. The black solid lines show the results of 100 Monte Carlo simulations for the Power-law network. The red solid lines and green star lines represent numerical simulation trajectories based on the mean-field systems in [13] and [21], respectively. The blue dashed lines represent a numerical simulation trajectories based on model (3). Obviously, the blue lines which nearly cut through the dense mass of simulation trajectories are the analytical trajectories based on system (3). This implies that the model of (3) can well describe the spread of rumors in complex networks.Figure 4
Simulations withλ=0.7, β=0.3, α=0.2, δ=0.1, ξ=0.1, and η=0.1. The black lines correspond to 100 Monte Carlo simulations trajectories for an SIHR rumor model in a network with the refined power-law degree distribution. The red solid lines and green star lines represent numerical simulation trajectories based on the mean-field system in [13] and [21], respectively. The dashed blue lines represent numerical simulation trajectories based on the system (3). (a) The trajectories of the densities of spreaders. (b) The trajectories of the densities of spreaders, stiflers, and hibernators.
(a) (b)Figure5 compares the spread of SIHR rumors in networks with the Poisson degree distribution and in the network with the refined power-law degree distribution. The results show that the final scale of rumors in the network with the Power-law degree distribution is smaller than that with the Poisson degree distribution. Furthermore, the density of spreaders reaches its maximum earlier, which is smaller than that with the Poisson degree distribution. Although heterogeneity accelerates the spread of rumors, it reduces the scale of spread.Figure 5
Numerical simulations of (3) with λ=0.7, β=0.3, α=0.2, δ=0.1, ξ=0.1, η=0.1 in the networks with different degree distributions but with the same averaged degree. The red solid lines and the blue dashed lines correspond to numerical simulations trajectories for an SIHR rumor model (3) in a network with the Poisson degree distribution and the refined power-law degree distribution, respectively. (a) The trajectories of the densities of spreaders. (b) The trajectories of the densities of spreaders, stiflers, and hibernators.
(a) (b)The simulation results in Figure6 show the evolution of rumor diffusion over time with different spreading rates λ=0.2, λ=0.4, and λ=0.5, respectively. In Figure 6(a), it is clear to see that the densities of the spreaders have sharp increases until they reach their peaks and then decrease to zero. Meanwhile, we can see that, with the increase of the spreading rate λ, the density of spreaders reaches its maximum earlier and larger. Figure 6(b) shows the cumulative rumor incidence increases with the increase of spreading rate λ.Figure 6
Numerical simulations of (3) with β=0.1, α=0.1, δ=0.1, ξ=0.05, and η=0.1 and different spreading rates λ in the network with the Poisson degree distribution. (a) The trajectories of the densities of spreaders. (b) The trajectories of the densities of spreaders, stiflers, and hibernators.
(a) (b)Figure7 displays how the evolution of rumor diffusion changes over time under different refusing rates β, where we set β=0.1, β=0.2, and β=0.4, respectively. In Figure 7(a), it is clear to see that the maximum of spreader density decreases with the increase of refusing rate β. If more people have the ability to see through the rumor or do not spread rumor (the direct link from the ignorants to the stiflers), the maximum rumor influence would become smaller. Figure 7(b) shows the cumulative rumor incidence decreases with the increase of refusing rate β.Figure 7
Numerical simulations of (3) with λ=0.6, α=0.2, δ=0.2, ξ=0.1, and η=0.2 and different refusing rates β in the network with the Poisson degree distribution. (a) The trajectories of the densities of spreaders. (b) The trajectories of the densities of spreaders, stiflers, and hibernators.
(a) (b)Figure8 illustrates how the evolution of rumor diffusion changes over time under different stifling rates α, where we set α=0.1, α=0.2, α=0.3, and α=0.4, respectively. Figure 8 shows that both the peak value of the spreader and the cumulative rumor incidence decrease with the increase of stifling rate α when α is small, while they increase with the increase of α when α is bigger. However, in this modeling process, we assume that the probability of a spreader node with m nonignorant neighbors recovered in unit time is mα if the stifling rate is α, but, actually, it should be 1-(1-α)m. That is, we use the following approximation: 1-(1-α)m≈mα, which is obviously unreliable with larger α.Figure 8
Numerical simulations of (3) with λ=0.6, β=0.3, δ=0.2, ξ=0.1, and η=0.2 and different stifling rates α in the network with the Poisson degree distribution. (a) The trajectories of the densities of spreaders. (b) The trajectories of the densities of spreaders, stiflers, and hibernators.
(a) (b)From Figure9, we can see that the maximum of the density of the spreader decreases with the increase of the forgetting rate δ and it has almost no effects on the cumulative rumor incidence. Figures 10 and 11 show that the remembering rate ξ and the wakened remembering rate η have weak effects on the rumor spreading process. From Figure 11(a), we can see that the peak value of the spreader density increases with the increase of the wakened remembering rate η.Figure 9
Numerical simulations of (3) with λ=0.7, β=0.3, α=0.2, ξ=0.1, and η=0.2 and different δ in the network with the Poisson degree distribution. (a) The trajectories of the densities of spreaders. (b) The trajectories of the densities of spreaders, stiflers, and hibernators.
(a) (b)Figure 10
Numerical simulations of (3) with λ=0.7, β=0.3, α=0.2, δ=0.2, and η=0.2 and different ξ in the network with the Poisson degree distribution. (a) The trajectories of the densities of spreaders. (b) The trajectories of the densities of spreaders, stiflers, and hibernators.
(a) (b)Figure 11
Numerical simulations of (3) with λ=0.7, β=0.3, α=0.2, ξ=0.1, and δ=0.2 and different η in the network with the Poisson degree distribution. (a) The trajectories of the densities of spreaders. (b) The trajectories of the densities of spreaders, stiflers, and hibernators.
(a) (b)Although the rumor spreading in social networks is similar to the disease spreading in biological networks, there are still differences between them. In the process of disease transmission, the recovery mechanism of the infected persons depends on themselves. However, a spreader turns into a stifler that needs to meet other spreaders, hibernators, or stiflers. So the recovery of spreader relies on the structure of network in the rumor spreading model. In order to compare the difference between the two mechanisms, we do the numerical simulations of SIHR model under two mechanisms, which are depending on the structure of network and depending on themselves. In Figure12, we can see that the maximum rumor influence and the cumulative rumor incidence are lower under the mechanism depending on the structure of network than those under the mechanism depending on themselves.Figure 12
Numerical simulations of (3) with λ=0.6, β=0.3, α=0.3, δ=0.2, ξ=0.1, and η=0.2 in the networks with the Poisson degree distribution but under different recovery mechanisms. (a) The trajectories of the densities of spreaders. (b) The trajectories of the densities of spreaders, stiflers, and hibernators.
(a) (b)


## 4. Conclusion

This paper combines the PGF method and the pair approximation method to obtain rumor propagation model in heterogeneous networks. We obtained the following results.(I) The comparison between numerical simulations and Monte Carlo simulations confirms the accuracy of our model.(II) Different from the literature results, we get the threshold condition of rumor propagation, which only depends on the characteristics of the network and does not depend on the choice of the initial spreader node, which further confirms the fact that the fluctuations of the connectivity distribution cannot be neglected even for finite size systems. In fact, the choice of the initial spreader node only affects the spread speed of rumors.(III) The rumor recovery mechanism, different from the disease recovery mechanism, is dependent on the network. This makes its recovery rate not a constant for the rumor propagator. In the early stage of rumor spreading, the neighbors of a rumor spreader are ignorant, so the recovery time of this rumor spreader is prolonged; however, in the middle and later stage of rumor spreading, the number of the ignorant neighbors of a rumor spreader decreases, so that the rumor spreaders recover faster and faster. Therefore, this recovery mechanism will reduce the scale of transmission.The appendix shows how the model is obtained in detail. This systemic method can be generalized to study other propagation in complex networks.



---

*Source: 4268393-2019-06-23.xml*