Research Article | Open Access

# Rumor-Propagation Model with Consideration of Refutation Mechanism in Homogeneous Social Networks

**Academic Editor:**Cengiz Çinar

#### Abstract

In recent years, increasing attention has been paid to how to effectively manage rumor propagation. Based on previous studies of rumor propagation and some strategies used by the authorities to refute rumors and manage rumor propagation, we develop a new rumor-propagation model with consideration of refutation mechanism. In this paper, we describe the dynamic process of rumor propagation by accounting for the refutation mechanism in homogeneous social networks. And then, we derive mean-field equations for rumor-propagation process. We then analyze the stability of the model with respect to changes in parameter values. Our results show that there exists a critical threshold that is inversely proportional to the average degree of the social networks and is positively correlated with the strength of the refutation mechanism. If the spreading rate is bigger than the critical threshold , rumors can be spread. Our numerical simulations in homogeneous networks demonstrate that increasing the ignorant’s refutation rate can reduce the peak value of spreaders density, which is better than increasing the spreader’s refutation rate . Therefore, based on the seriousness of the rumor propagation and the rumor-propagation rate, the authorities can choose effective strategies that increase the refutation rate so that they can reduce the maximum influence of the rumor.

#### 1. Introduction

The propagation of rumors is a typical form of social interaction that exerts a powerful influence on human affairs [1–3]. Although “rumors” can also imply truthful information, most rumors contain some degree of falsehood, and it is these false rumors that we will focus on in this paper. With the development of technologies such as the Internet and the emergence of new media (especially blogging and Twitter), rumors can spread faster and farther than ever before. When an emergency occurs, the subsequent rumor propagation may lead to more serious harm than the emergency itself [4–6]. For instance, in March 2011, a buying frenzy for iodized salt erupted in China because of the rumor that iodized salt could protect people from the nuclear radiation released as a result of damage to Japan’s Fukushima nuclear plant caused by the Tohoku earthquake. This behavior not only damaged the normal market order but also negatively affected the daily life of many citizens.

The study of rumor-propagation models began in the 1960s. The first classical rumor model (the DK model) was proposed by Daley and Kendall [7]. Afterwards, Maki and Thompson modified the DK model and developed another model that also became a classic in this field [8]. In both models, people are divided into three groups: people who know and transmit a rumor, people who do not know the rumor yet, and people who know the rumor but choose not to transmit it to others. Several variants of these models were subsequently developed by other researchers [9–12].

Sudbury [11] studied the dynamic mechanisms of information transmission in social networks and proposed that the behavior of rumor propagation could be described by what they called the “SIR” model. In this model, a closed and homogeneous population is divided into three groups: ignorants (, who have not yet heard of the rumor), spreaders (, who spread the rumor), and stiflers (, who have heard the rumor but have ceased to spread it). Some rules for the rumor-propagation process can be described based on these categories. When a spreader contacts an ignorant, the ignorant could become a spreader at a certain rate. When a spreader contacts another spreader or a stifler, the former spreader could turn into a stifler at a certain rate. The rumor dies out when no spreaders remain in the population.

Many other scholars have studied rumor propagation by considering the topological properties of social networks [13–16]. Zanette [17, 18] and Buzna et al. [19] studied the dynamic process of rumor propagation and found that there was a critical rumor-propagation threshold that must be exceeded before a rumor can propagate in small-world networks. Moreno et al. [20] examined the dynamics of the critical rumor-propagation model for complex networks. Gu and Cai [21] and Gu et al. [22] introduced forgetting and remembering functions in a two-state model. Nekovee et al. [23] and Zhao et al. [24] studied rumor-propagation models that included a forgetting mechanism. Zhao et al. [25, 26] refined these models considering both forgetting and remembering mechanisms in complex networks. Zhao et al. [27] studied rumor-propagation model in BBV networks and derived the corresponding mean-field based on the strength of the nodes. To characterize information propagation on online microblogs, Xiong et al. [28] proposed a diffusion model (SCIR), which contains four possible states: susceptible, contacted, infected, and refractory. Cheng et al. [29] introduced a stochastic epidemic model of the rumor diffusion, in which the infectious probability is defined as a function of the strength of ties.

The spread of rumors has always had the potential to lead to serious harm, but this potential has increased due to the ability of rumors to spread rapidly through modern social networks. The potential harm caused by rumor propagation has therefore attracted the attention of many countries. To minimize this harm, the authorities have adopted various measures to manage the spread of rumors. For example, in some countries, such as the United States, England, and China, special websites exist to refute rumors; these include http://www.sunnidefense.com/exp/, http://snopes.com/, and http://baike.m4.cn/. When rumor propagation occurs, the government should take immediate measures to refute the rumor and provide a smooth flow of correct information to the people, thereby helping them to learn the truth. This approach can greatly reduce the influence of rumors. This means that rumor-propagation models should account for the strategies adopted by the authorities to refute rumors. As far as the refutation mechanism is concerned, an ignorant who is contacted by a rumor spreader will become a stifler at a certain rate, because the ignorant’s ability to distinguish true information from the false is improved by the strategies adopted by the authorities to refute rumors; at the same time, under the refutation mechanism, rumor spreaders may spontaneously become stiflers at a certain rate because the spreaders become aware of the truth of the rumor. However, no previous models consider the refutation mechanism.

A model that considers the refutation mechanism would clearly describe rumor propagation more accurately than a model that lacks such a mechanism. Thus, in the present study, we examine the dynamic process of rumor propagation by considering the impact of the refutation mechanism. The paper is organized as follows. In Section 2, we develop a rumor-propagation model that incorporates a refutation mechanism and provide the corresponding mean-field equations. We present analytical results for a steady state in this model in Section 3 and in Section 4 we describe numerical simulations of the dynamics of the model to analyze the impact of various factors on the model’s outputs. In Section 5, we conclude this paper by summarizing the key results of our analysis and providing an outlook for future research.

#### 2. An SIR Rumor-Propagation Model That Incorporates a Refutation Mechanism

The propagation of rumors is a complex sociopsychological process. In this paper, we define our model based on certain simplifying initial assumptions. We assume that a closed social network exists, in which there is uniform mixing of the individuals in the network. These individuals can be represented as vertices in the network, and links between them can be represented as edges. This model provides an undirected graph , in which is the set of vertices and is the set of edges. Based on the work of Maki and Thompson [8], we assume that a rumor propagates through direct contacts between the spreader and others in the social network. Figure 1 illustrates the propagation process in a network in which the population is divided into ignorants, spreaders, and stiflers. The rumor-propagation rules can be summarized as follows.(1)When an ignorant contacts a rumor spreader, the ignorant becomes a rumor spreader at rate , which we define as the rumor-propagation rate.(2)Based on the internal discrimination ability of the ignorants from their own hobbies, knowledge backgrounds, and experiences, we assume that when an ignorant contacts a spreader, the ignorant becomes a stifler at rate , which we define as the refusal rate, where we do not consider the refutation strategies used by the authorities; that is, the ignorant’s ability to distinguish true information from the false is not affected by the external strategies adopted by the authorities to refute rumors.(3)To account for the refutation strategies issued by the authorities, we assume that an ignorant who is contacted by a rumor spreader will become a stifler at a certain rate , because the ignorant’s ability to distinguish true information from the false is improved by the authorities’ refutation strategies; thus, we define the parameter as ignorant’s refutation rate.(4)Under the refutation mechanism, rumor spreaders may also cease spreading a rumor at a certain rate , because the spreaders become aware of the truth of the rumor. Thus, we define the parameter as spreader’s refutation rate.(5)When a rumor spreader contacts another rumor spreader or a stifler, the former rumor spreader may become a stifler at a rate , which we define as the stifling rate.(6)Based on differences in the personality, knowledge background, and experience of the spreaders, we account for the forgetting mechanism by assuming that rumor spreaders may also cease spreading a rumor spontaneously at rate , which we define as the forgetting rate.

In the paper, and represent different influences of internal factor and external factor, respectively.

Because the parameters , , , , , and are rates, their values cannot be smaller than zero.

Many social networks are abstracted as homogenous networks, in which degree fluctuations are very small and there are no degree correlations. The degree of nodes on homogeneous networks has a Poisson distribution; that is to say, the above networks degrees distributions peak at an average value and show small fluctuation around the value. That is, in homogeneous networks, most nodes have the same degree, whose value is approximately equal to the average degree of network. The rumor propagation follows the above rules in homogeneous networks and each node has the same degree . In the model that incorporates a refutation mechanism, , , and denote the proportions of the population that are ignorants, spreaders, and stiflers, respectively, at time . These proportions satisfy the normalization condition: . According to the above elaborated rumor spreading progress, the mean-field equations for our model in homogeneous networks can be described as follows:

Equation (1) indicates that the density of ignorants varies over time , which consists of three parts: the density of ignorants varies over time caused by ignorants contacting spreaders and ignorants becoming spreaders at the rate ; the density of ignorants varies over time caused by ignorants contacting spreaders and ignorants becoming stiflers at the rate due to refusal mechanism; the density of ignorants varies over time caused by ignorants contacting spreaders and ignorants becoming stiflers at the rate due to refutation mechanism. Equation (2) indicates that the density of spreaders varies over time , which consists of four parts: the density of spreaders varies over time caused by ignorants contacting spreaders and ignorants becoming spreaders at the rate ; the density of spreaders varies over time caused by spreaders contacting other spreaders or stiflers, or the former spreaders may become stiflers at the rate ; the density of spreaders varies over time caused by spreaders that may also become stiflers at the rate due to refutation mechanism; the density of spreaders varies over time caused by spreaders that may also become stiflers at the rate due to forgetting mechanism. Equation (3) indicates that the density of stiflers varies over time , which consists of five parts: the density of stiflers varies over time caused by spreaders contacting other spreaders or stiflers, and the former spreaders may become stiflers at the rate ; the density of stiflers varies over time caused by spreaders that may also become stiflers at the rate due to forgetting mechanism; the density of stiflers varies over time caused by ignorants contacting spreaders and ignorants becoming stiflers at the rate due to refutation mechanism; the density of stiflers varies over time caused by spreaders that may also become stiflers at the rate due to refutation mechanism; the density of stiflers varies over time caused by ignorants contacting spreaders and ignorants becoming stiflers at the rate due to refusal mechanism.

The classical SIR rumor-spread model [7] and the classical SIR rumor-spread model that incorporates a forgetting mechanism [23] are special cases of our new version of the SIR model that includes a refutation mechanism.

*Case 1. *When , , , and , the model becomes the classical SIR rumor-spread model [7].

*Case 2. *When , , , and , the model becomes Nekovee’s rumor-spread model, which incorporates a forgetting mechanism [23].

#### 3. Steady-State Analysis

During the process of rumor propagation in a homogeneous network, we assume that there is initially one spreader and that the rest of the people are ignorants. The initial condition for rumor-propagation at time is , , and .

The number of spreaders first increases and then decreases until it reaches zero, at which point the rumor stops spreading. Finally, when the system reaches a stable state, there are no spreaders and only ignorants and stiflers remain. We analyze the final size of a rumor R, which can be utilized to measure the level of rumor influence. Here the final rumor size . We will discuss this in more detail in this section.

We calculate the final rumor size, , by analyzing the mean-field equations in homogeneous networks. Dividing (1) by (3) will get Then,

Both sides of (5) can be integrated with respect to and from the initial state to the stable state. Considering the initial condition and the final state for the ignorants . We can therefore get

Taking the logarithm of for (7), we obtain the following transcendental equation: where

Given

taking the derivation of with respect to , we have That is to say, is a concave function on the interval . Also and So, has a nontrivial solution and the following condition must be fulfilled: ; that is, where

That is, (8) permits a nonzero solution only if . For , this condition is fulfilled if the following condition is true:

This condition is equivalent to the constraint , which represents the critical rumor-propagation threshold that must be exceeded before a rumor can propagate. In particular, for , we obtain the critical rumor-propagation threshold in a homogeneous network:

This result shows that the threshold for rumor propagation is not only related to the average degree of the social network but also depends on the refutation rate. From (19), we know that, given a fixed , the critical rumor-propagation threshold increases with increasing . That is, rumor propagation becomes more difficult with a strong refutation mechanism.

#### 4. Numerical Solution

First, according to (7), we analyze the effects of various factors on by using Matlab. Figure 2 displays the variation of as a function of with refutation rate , propagation rate , and forgetting rate , respectively. Figure 2(a) shows how changes for three values of . As the value of increases, decreases; as the value of increases, increases and eventually reaches a steady state that depends on the value of . These results indicate that adding to the model affects the final size of the rumor, . Figure 2(b) reveals that the larger the propagation rate, the greater the value of . Figure 2(c) reveals that the forgetting rate has noticeable influence on rumor propagation. The larger the forgetting rate, the smaller the value of at a given value of . For a given forgetting rate, increases as increases, eventually reaching a steady state.

**(a)**

**(b)**

**(c)**

At the steady state, we can obtain a critical rumor threshold . In particular, for , we can obtain the critical rumor-propagation threshold , which depends on the average degree of the social network and the refutation rate. Figure 3 confirms this conclusion. According to (7), we can plot Figures 3(a), 3(b), and 3(c) by using Matlab. Figure 3(a) shows how changes as a function of the spreading rate for three values of , with and . According to (11), when , , and , we can calculate that the critical rumor-propagation threshold is . Similarly we can obtain other thresholds of and at and , respectively. The above conclusions are verified by simulation data in Figure 3(a). Figure 3(a) clearly shows that when the propagation rate is larger than the critical rumor-propagation threshold (i.e., when ), a rumor can spread. Figure 3(a) also shows that, as increases, decreases. Figure 3(b) reveals how changes as a function of for three values of , with and . Following the same approach, we can obtain the corresponding rumor-propagation thresholds. As increases, decreases. Figure 3(c) shows the relationship between and under the given conditions. That is, increases as increases. Analytical result (see (11)) is verified by the simulation in Figure 3.

**(a)**

**(b)**

**(c)**

At last, based on the descriptions in Section 2, we constructed a homogeneous network consisting of nodes, with an average degree , with each person representing a vertex in the network and each path between two people representing an edge. In the following simulations, we assumed an initial condition with only one spreader in the homogeneous network; thus , , and . The fourth-order Runge-Kutta method is widely used to solve the differential equation problem. So we can use the fourth-order Runge-Kutta method to solve the coupled differential equations (1) to (3), and we performed numerical simulations to analyze the effects of the model parameters on the rumor-propagation process. The concrete steps of the algorithm are given as follows: Here,

Calculated by the Runge-Kutta method, Figure 4 vividly shows how the density of spreaders and stiflers changes over time steps on homogeneous network before and after the refutation mechanism is considered, respectively. The peak value of spreaders density max denotes the biggest fraction of spreaders in the process of rumor spreading, which can be used to measure the maximum influence of the rumor. In Figure 4, the red solid line represents the scenario that and ; that is, the refuting mechanism is not considered. From Figure 4(a), we can obtain, as the and increase, that the max decreases; that is, the bigger the refutation rate , the smaller the maximum of rumor influence. Figure 4(b) clearly shows that at first the bigger the refutation rate, the bigger the stifler density. But as the time step goes on, the influence of the refutation mechanism on the stifler density becomes remarkably weakened, and the stifler density reaches the same level in the end with different value of refutation rate .

**(a) Density of spreaders**

**(b) Density of stiflers**

Figure 5 shows how the densities of spreaders change over time for different refuting rates. It can be seen from Figure 5(a) that the max decreases as increases. Figure 5(a) shows that does not affect the point where the number of spreaders increases sharply and only influences the maximum density of spreaders. That is, does not affect the critical rumor threshold but does affect how the density of spreaders changes. From Figure 5(b), we can also obtain that the max decreases as increases. Figure 5(b) shows that is a key determinant of the point where begins to increase sharply. The larger the value of is, the later this sharp increase occurs. Therefore, if the authorities can take appropriate measures to refute a rumor, this can provide enough time for them to plan how to cope with the impact of the spreading rumor. If we take the buying frenzy for iodized salt that occurred in China as an example, effective refutation of the rumor would have provided time to ensure an adequate supply of iodized salt. This would maintain public calm until the rumor propagation ceases. From Figure 5(a), we can also obtain that when value varies from 0.1 to 0.5, the peak value of spreaders density decreases to 0.14. However, from Figure 5(b), we can get that when value varies from 0.1 to 0.5, the peak value of spreaders density only decreases to 0.08. So from Figure 5, we can obtain that, under the same conditions, increasing the ignorant’s refutation rate can reduce the peak value of spreaders density, which is better than increasing the spreader’s refutation rate .

**(a) Density of spreaders**

**(b) Density of spreaders**

Figure 6 shows how the densities of stiflers change over time for different refuting rates. Figure 6(a) clearly shows that the final density of stiflers is unchangeable as increases. In the process of rumor propagation the bigger the ignorant’s refutation rate, the bigger the stifler density. But as the time step goes on, the influence of the ignorant’s refutation rate on the stifler density becomes remarkably weakened, and the stifler density reaches the same level in the end with different value of the ignorant’s refutation rate . From Figure 6(b), we can obtain that the final density of stiflers decreases as increases. That is, the larger the value of , the smaller the final influence of rumor propagation.

**(a) Density of stiflers**

**(b) Density of stiflers**

The results of these simulations demonstrate that the refutation strategies adopted by the authorities play an important role in rumor-propagation process. When rumor prevails, the authorities can improve the refuting rate by a variety of ways for reducing the influence of rumors propagation. For example, the authorities should strengthen construction of refuting rumor websites to improve the rumor identification ability of the public; the authorities should choose a wide variety of mass media to release the rumor truth to the public. Particularly, in the days of information and network, apart from the older media (the newspaper, broadcast, TV, and so on), the authorities attach special importance on the application of new media such as Twitter and Forum. The microblogging of the authorities can be used to timely refute the rumor and quickly provide a smooth flow of correct information to the public, thereby helping them to learn the truth, which can improve the refuting rate. At the same time, the authorities should strengthen the education investment to improve the rumor identification of the public, which also can increase the refuting rate in the rumor model. The authorities can strengthen surveillance and monitoring of the public opinion to early discover the rumor and then can timely refute the rumor to reduce the influence of rumor. For more important is that the authorities should enhance the government credibility. The public believe more the truth of rumor which is released by the authorities of high credibility. The above methods would bring about a high refutation rate that can reduce the influence of rumor and mitigate the damage it can cause.

#### 5. Conclusions

In this paper, we analyzed the dynamics of rumor propagation in homogeneous networks using a model that incorporated a refutation mechanism. We found the following novel features and significant results of the model.(1)To account for differences in the effectiveness of the strategies adopted by the authorities, thereby making the simulations more realistic, we incorporated a refutation mechanism in the rumor-propagation model. We then derived mean-field equations to describe changes in the proportions of spreaders, ignorants, and stiflers. The classical SIR rumor-spread model and Nekovee’s rumor-spread model with a forgetting mechanism are special cases of the model.(2)Our steady-state analysis revealed the existence of critical threshold for rumor propagation. In particular, for , it is only dependent on the average degree of the network and the refutation rate . Our model allows prediction of for a rumor with different propagation rates and . Graphs of the results confirmed the existence of the threshold and that it is dependent on both and .(3)We used the Runge-Kutta method to simulate the mean-field equations used in the rumor model with a refutation mechanism. The simulations showed that, under a given set of conditions, the refutation factor affected the rumor-propagation process: an increasing refutation rate decreased the maximum spreader density.

Our results suggest that the authorities should choose appropriate media to increase the refutation factor by releasing the truth to the public. Using mass media with a high audience rating among the individuals in the population who are most likely to spread and receive the rumor and using a medium with high credibility for these individuals would generate a high refutation rate that can effectively slow the rumor’s propagation and mitigate the damage it can cause.

The present study only addressed some of these aspects. In complex networks, the incorporation of refutation mechanisms in models of rumor propagation will be an interesting topic for future research.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgments

This study is supported by Grants from the National Natural Science Foundation of China (project no. 90924030) and Social Development of Metropolis and Construction of Smart City (project no. 085SHDX001).

#### References

- S. Galam, “Modelling rumors: the no plane Pentagon French hoax case,”
*Physica A: Statistical Mechanics and Its Applications*, vol. 320, pp. 571–580, 2003. View at: Publisher Site | Google Scholar - M. Kosfeld, “Rumours and markets,”
*Journal of Mathematical Economics*, vol. 41, no. 6, pp. 646–664, 2005. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - H. Hayakawa, “Ryugen no shakaigaku—keishikisyakaigaku karano sekkin (sociology of rumor approach from formal sociology),” Seikyusya, Tokyo, Japan, in Japanese, 2002. View at: Google Scholar
- S. A. Thomas, “Lies, damn lies, and rumors: an analysis of collective efficacy, rumors, and fear in the wake of Katrina,”
*Sociological Spectrum*, vol. 27, no. 6, pp. 679–703, 2007. View at: Publisher Site | Google Scholar - E. R. Danzig, P. W. Thayer, and L. R. Galanter,
*The Effects of a Threatening Rumor on a Disaster-Stricken Community*, National Academy of Science, National Research Council, Washington, DC, USA, 1958. - Z. L. Zhang and Z. Q. Zhang, “An interplay model for rumour spreading and emergency development,”
*Physica A: Statistical Mechanics and its Applications*, vol. 388, no. 19, pp. 4159–4166, 2009. View at: Publisher Site | Google Scholar - D. J. Daley and D. G. Kendall, “Epidemics and rumours,”
*Nature*, vol. 204, no. 4963, p. 1118, 1964. View at: Publisher Site | Google Scholar - D. P. Maki and M. Thompson,
*Mathematical Models and Applications*, Prentice-Hall, Englewood Cliffs, NJ, USA, 1973. View at: MathSciNet - D. P. Maki,
*Mathematical Models and Applications, with Emphasis on Social, Life, and Management Sciences*, Prentice Hall, Englewood Cliffs, NJ, USA, 1973. - J. D. Murray,
*Mathematical Modeling in Epidemiology*, Springer, Berlin , Germany, 1980. View at: MathSciNet - A. Sudbury, “The proportion of the population never hearing a rumour,”
*Journal of Applied Probability*, vol. 22, no. 2, pp. 443–446, 1985. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - B. Doerr, M. Fouz, and T. Friedrich, “Social networks spread rumors in sublogarithmic time,” in
*Proceedings of the 43rd ACM Symposium on Theory of Computing*, pp. 21–30, 2011. View at: Publisher Site | Google Scholar | MathSciNet - D. Trpevski, W. K. S. Tang, and L. Kocarev, “Model for rumor spreading over networks,”
*Physical Review E*, vol. 81, no. 5, Article ID 056102, 2010. View at: Publisher Site | Google Scholar - F. Roshani and Y. Naimi, “Effects of degree-biased transmission rate and nonlinear infectivity on rumor spreading in complex social networks,”
*Physical Review E, Statistical, Nonlinear, and Soft Matter Physics*, vol. 85, no. 3, Article ID 036109, 2012. View at: Publisher Site | Google Scholar - J. Huang and X. Jin, “Preventing rumor spreading on small-world networks,”
*Journal of Systems Science and Complexity*, vol. 24, no. 3, pp. 449–456, 2011. View at: Publisher Site | Google Scholar | MathSciNet - P. Li and Q. Z. Zhao, “Rumor spreading in local-world evolving network,”
*Communications in Computer and Information Science*, vol. 227, pp. 693–699, 2011. View at: Google Scholar - D. H. Zanette, “Critical behavior of propagation on small-world networks,”
*Physical Review E—Statistical, Nonlinear, and Soft Matter Physics*, vol. 64, no. 5, Article ID 050901, 4 pages, 2001. View at: Google Scholar - D. H. Zanette, “Dynamics of rumor propagation on small-world networks,”
*Physical Review E*, vol. 65, no. 4, Article ID 041908, pp. 1–9, 2002. View at: Publisher Site | Google Scholar - L. Buzna, K. Peters, and D. Helbing, “Modelling the dynamics of disaster spreading in networks,”
*Physica A: Statistical Mechanics and its Applications*, vol. 363, no. 1, pp. 132–140, 2006. View at: Publisher Site | Google Scholar - Y. Moreno, M. Nekovee, and A. F. Pacheco, “Dynamics of rumor spreading in complex networks,”
*Physical Review E, Statistical, Nonlinear, and Soft Matter Physics*, vol. 69, no. 6, Article ID 066130, pp. 1–66130, 2004. View at: Publisher Site | Google Scholar - J. Gu and X. Cai, “The forget-remember mechanism for 2-state spreading,” http://arxiv.org/pdf/nlin/0702021.pdf. View at: Google Scholar
- J. Gu, W. Li, and X. Cai, “The effect of the forget-remember mechanism on spreading,”
*European Physical Journal B*, vol. 62, no. 2, pp. 247–255, 2008. View at: Publisher Site | Google Scholar - M. Nekovee, Y. Moreno, G. Bianconi, and M. Marsili, “Theory of rumour spreading in complex social networks,”
*Physica A*, vol. 374, no. 1, pp. 457–470, 2007. View at: Publisher Site | Google Scholar - L. Zhao, Q. Wang, J. Cheng, Y. Chen, J. Wang, and W. Huang, “Rumor spreading model with consideration of forgetting mechanism: a case of online blogging LiveJournal,”
*Physica A: Statistical Mechanics and Its Applications*, vol. 390, no. 13, pp. 2619–2625, 2011. View at: Publisher Site | Google Scholar - L. J. Zhao, J. J. Wang, Y. C. Chen, Q. Wang, J. Cheng, and H. Cui, “SIHR rumor spreading model in social networks,”
*Physica A: Statistical Mechanics and Its Applications*, vol. 391, no. 7, pp. 2444–2453, 2012. View at: Publisher Site | Google Scholar - L. Zhao, X. Qiu, X. Wang, and J. Wang, “Rumor spreading model considering forgetting and remembering mechanisms in inhomogeneous networks,”
*Physica A: Statistical Mechanics and Its Applications*, vol. 392, no. 4, pp. 987–994, 2013. View at: Publisher Site | Google Scholar | MathSciNet - L. J. Zhao, X. L. Wang, X. Y. Qiu, and J. J. Wang, “A model for the spread of rumors in BARrat-BARthelemy-Vespignani (BBV) networks,”
*Physica A: Statistical Mechanics and its Applications*, vol. 392, no. 21, pp. 5542–5551, 2013. View at: Publisher Site | Google Scholar | MathSciNet - F. Xiong, Y. Liu, Z. Zhang, J. Zhu, and Y. Zhang, “An information diffusion model based on retweeting mechanism for online social media,”
*Physics Letters A: General, Atomic and Solid State Physics*, vol. 376, no. 30-31, pp. 2103–2108, 2012. View at: Publisher Site | Google Scholar - J. Cheng, Y. Liu, B. Shen, and W. Yuan, “An epidemic model of rumor diffusion in online social networks,”
*The European Physical Journal B. Condensed Matter and Complex Systems*, vol. 86, no. 1, article 29, 7 pages, 2013. View at: Publisher Site | Google Scholar | MathSciNet

#### Copyright

Copyright © 2014 Laijun Zhao et al. 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.