Research Article | Open Access

# A Rumor Spreading Model considering the Cumulative Effects of Memory

**Academic Editor:**Antonia Vecchio

#### Abstract

This paper proposes a rumor spreading model which examines how the memory effects rate changes over time in artificial network and a real social network. This model emphasizes a special rumor spreading characteristic called āthe cumulative effects of memory.ā A function reflecting the cumulative memory effects is established, which replaces the constant rate of memory effects in the traditional model. Further, rumor spreading model simulations are conducted with different parameters in three artificial networks. The results show that all the parameters but the initial memory rate of memory effects function have a significant impact on rumor spreading. At the same time, the simulation results show that the final size of the stiflers is sensitive to the average degree when it is small but is not sensitive to when the average degree is greater than a certain degree. Finally, through investigations on the Sina Microblog network, the numerical solutions show that the peak value and final size of the rumor spreading are much larger under a variable memory effects rate than under a constant rate.

#### 1. Introduction

An old saying goes that rumors come true after being repeated a thousand times. In real life, if people are unable to distinguish authenticity, many rumors are deemed to be true after a large number of repetitions. When rumors are widely propagated, people tend to believe the rumor, especially if they lack timely real information. Because of the increased presence of online social networks, rumors are no longer spread by word of mouth over a small area but are spread amongst strangers in different regions and different countries, meaning that rumors are being spread faster and wider than ever before. This sustained and rapid spreading of rumors deepens peopleās impression about the veracity of the rumor and thus improves the credibility. Rumor spreading, therefore, has the ability to shape public opinion and lead to social panic and instability [1]. For example, the 2011 Tohoku nuclear leakage accidents caused a number of rumors in China. Rumors said that taking materials containing iodine could help ward off nuclear radiation, which led to the fact that many people rushed to purchase iodized salt.

Rumor spreading has attracted significant attention from researchers and, as a result, a great deal of research has been done on rumor spreading models. In the early stages, scholars borrowed from epidemic models to describe rumor spreading process [2ā4]. A classical model is the SIR model, which studies the dynamic behavior of rumor spreading using an epidemic dynamics SIR model [5]. Based on this research, there have been many more rumor spreading models, most of which have been a variant of the SIR model [6ā8]. With the development of network technology, many novel models have appeared inspired by empirical discoveries about network topology [7, 9ā11]. At the same time, researchers have started to consider the specific features of rumor spreading in their models. Dodds and Watts [12] studied the effects of limited memory on contagion. Zhao et al. [13, 14] proposed a rumor spreading model which considered remembering mechanisms in homogeneous and inhomogeneous networks.

However, most previous studies have discussed memory effects as a constant parameter in the model, but, in reality, people hear rumors many times and so have an accumulation of impressions about the rumors, which changes the probability as to when people become rumor spreaders. Therefore, memory effects have a strong time-dependency. Further, the remembering mechanisms can indicate repeatability, which affects the spreading characteristics of the rumor [13]. Even a small amount of memory can affect the rumor spread in small network sizes [15]. LĆ¼ et al. [16] proposed a model considered memory effects on information spread but did not construct a function of time and did not build spreading dynamics equations.

In the existing research on rumor propagation, there have been two main classification methods for the population. In the first, the population is divided into the three groups borrowed from the epidemic spreading classifications [5], those that are susceptible (have never heard the rumor), those who are infected (are spreading the rumor), and those who are recovered (have heard the rumor but do not spread it). These classifications have been adopted in most rumor spreading models. In the second classification, however, the population is divided into four groups. This classification adds a new group to the first classification, but this group has been interpreted differently in different studies. In some research, this additional group, which arises from the spreaders, is called the hibernators, those that have heard but forgotten the information [13]. In LĆ¼ās research [16], the additional group is called the known, those who are aware of the rumor but are not willing to transmit it as they are suspicious of its authenticity. An incubation class was suggested in [17], where it was proposed that a susceptible individual first goes through a latent period after being infected before becoming a spreader or a stifler, which is a similar idea to that of LĆ¼. In this paper, we follow a four-group classification including incubation class, the unaware, the spreaders, the lurkers, and the stiflers.

In this paper, we study a rumor spreading model with variable rate which considers cumulative memory effects as a function of time, which is more in line with reality. The remainder of this paper is organized as follows. In Section 2, first, the rumor spreading model with a variable rate varying over time is described. Then, the mean-field equations are derived, and the dynamic analysis of the model is conducted. In Section 3, numerical simulations demonstrating the dynamics of the established model are conducted on regular networks, random networks, BA networks, and online social networks. We compare our model using different parameters and analyze the modelās impact at different average degree of networks. Then, we make comparisons between a constant versus a variable rate on Sina Microblog. In Section 4, further discussion is presented. Finally, in Section 5, we conclude this paper and provide several avenues for further research.

#### 2. A Rumor Spreading Model with Variable Memory Rate

In this model, we construct a function of time which reflects the accumulation of memory, the speed of memory change, and the importance of an event which triggers rumors. Then, with this function added as a parameter to a differential dynamic spread model, a new rumor propagation model is proposed.

##### 2.1. Memory Effects Function

Consider a network with nodes and links representing the individuals and their interactions. At each time step, each individual is in one of the following four states:(1)the unaware: this individual has not yet heard the rumor;(2)the lurkers: this individual knows the rumor but is not willing to spread it because they require an active effort to discern the truth or falseness of the rumor;(3)the spreaders: this individual knows this rumor and transmits it to all their contacts;(4)the stiflers: this individual neither trusts the rumor nor transmits it.

People generally hear a rumor after many times, and therefore they get an accumulated impression about the rumor, which means that the probability that people become a spreader changes from āwill never believeā to ābelieves.ā This can be described as the cumulative effect of memory, which affects the probability that an individual becomes a spreader from a lurker in the rumor spreading process. In information spreading theory, a function was established which reflected the probability that a person would approve the information at time after having received the news times [16]. This function is , where is the approving probability of the first receipt of the information and is the upper bound of the probability indicating maximal approval probability. In fact, as is a function of time, we can transform this function into a function of time ; that is, the probability that a person approves the rumor at time can be denoted by a function of time . From the following analysis, we determine a specific form for the function of time* t*.

First, we analyze the changing process of the lurkers. From a microcosmic point of view, lurkers do not automatically change their states at time step . Some may become a stifler or a spreader, while others remain lurkers and may become stiflers or spreaders at a later time. We assume that the new lurkers at each time step have a part of the residuals which last until the end of the rumor spreading. This corresponds with the fact that there are always some people who take a long time to change their state in real life. From the above analysis, lurkers become spreaders at a variable probability, denoted by , and become stiflers at the rate of , so we can determine the lurkersā process of change at each time step, as shown in Figure 1. In the following paragraph, we explain this function .

As the number of times the rumor is received, the probability that a individual agrees to the truth of the rumor grows and infinitely approaches a constant [16]. Thus, as time passes, the number of times the rumor is received for the residual lurkers gradually increases. Because the probability that an individual becomes a spreader from a lurker is a level that reflects the transformation probability of all lurkers, including the residual old lurkers and the new joined lurkers in each time step, as time passes, the probability increases gradually because of the cumulative effect of memory and infinitely approaches a constant when the accumulated memories achieve a certain degree.

In the following, we show how probability becomes larger and infinitely approaches a constant. Figure 2 shows the probabilities that each part of the lurkers becomes spreaders. Firstly, we prove a lemma.

Lemma 1. *In the rumor spreading process, there is a time point , such that āā and āā before .*

*Proof. *According to rumor spreading theory, at the beginning of the process, there is an increase in the number of spreaders as the rumor propagates, and, with the further spreading of the rumor, the number of spreaders reaches a peak and then decreases as time goes on. Finally, the number of spreaders is zero and the rumor spreading terminates.

Therefore, with an increase in the spreaders, the probability of the lurkers receiving the rumor increases gradually before the number of spreaders reaches a peak at least. We assume this time point to be . That is, the probability that the lurkers become spreaders increases before . Therefore, there is a time point , such that āā and āā before .

Because is a level that reflects the transformation probability of all lurkers, including the residual old lurkers and the new joined lurkers in each time step, we prove that it has the following properties.

Theorem 2. *With an increase in time, the probability becomes increasingly larger and infinitely approaches a constant.*

*Proof. *First, the probability becomes increasingly larger. We use mathematical induction to prove this theorem. According to the lemma.

For ,
For ,
For ,
Assuming the result is true for , that is,

To establish the truth of , we need to show that

Consequently, with an increase in the time step , the probability that a lurker becomes a spreader increases gradually because of the cumulative effect of memory. The probability is that the number of contact times infinitely approaches a constant [16]. Therefore, infinitely approaches a constant when accumulated memories achieve a certain degree.

In light of above analysis, the probability that lurkers become spreaders affected by memory accumulation at* t*th time step is
where , , and are parameters. These three parameters reflect the characteristics of the variable memory effects rate. is the initial value of the memory effects function at . The parameter reflects the importance of an event triggering rumors in the spreading process, and it is the initial probability that an individual becomes a spreader. A larger value for means that the spreaders more easily remember the rumor because the event is probably more important. , , is the maximal transformation probability. As time passes, infinitely approaches . The parameter can be regarded as the memory speed; namely, captures how quickly reaches the maximum value . The memory effects rate is a probability varying over time . Here, we do not consider interest decay and assume that the time scale for the rumor spreading is much faster than the memory decay. Figure 3 shows the transformation probability as a function of , given a different and a fixed , , as shown in Figure 2.

##### 2.2. Rumor Spreading Model

Denote by , , , and the density of the unaware, lurkers, spreaders, and stiflers at time , . As shown in Figure 4, the rumor spreading rules can be summarized as follows.(1)Everyone needs time to determine the authenticity of rumor, so an unaware becomes a lurker with a probability 1 when an unaware individual contacts a spreader. The contact probability is decided by the specific network topology. Therefore, the reduced speed of the unaware is proportional to the number of the unaware* S*(*t*) and the spreaders* I*(*t*), so we can derive the differential equation:
(2)A lurker becomes a spreader at the rate of and becomes a stifler at the rate of , which depends on cognition. For example, some unaware individuals have strong knowledge structures and logical reasoning abilities, so they may have little interest in rumors; thus the probability is large. Because an unaware individual becomes a lurker with a probability 1 when an unaware contacts a spreader, the increased speed of the lurkers is equal to
(3)When two spreaders contact each other, both may find the two pieces of information inconsistent, so they stop the spread. When a spreader contacts a stifler, the spreader tries to stop the spread, as the stifler shows no interest in the rumor or denies its veracity. We suppose that the above cases occur at the same probability [17]. Therefore, the reduced speed of the spreaders is proportional to the number of and , Additionally, a lurker becomes a stifler at the rate of , so we have
(4)The increasing speed of the stiflers is proportional to the number of existing and from , and a lurker becomes a stifler at the rate of from , so we get

Based on the previous discussion, the model is described using the following system of differential equations:

##### 2.3. Steady-State Analysis of Model

At the beginning of the rumor spreading process, the system has only the unaware and the spreaders and at the end has only the unaware and stiflers as an equilibrium state is reached. So here, we analyze the systemās steady-state.

Substituting into differential equations (9), as the differential equations (7), (8), and (9) are not related to the , we only consider these three equations. Then the reduced limiting dynamic system is given by

From differential equations theory, systems and are homogeneous, which means that analyzing the properties of system is equal to analyzing the properties of system . First, some definitions and the required theorem are introduced.

Our model is a nonautonomous differential dynamic system, the general form of which is

Suppose that , , and is a continuous differentiable function defined in . is a continuous differentiable function defined in .

*Definition 3 (see [18]). *If is a positive (negative) definite function, such that is true in and , is called a positive (negative) definite function in . If āā, is called a positive (negative) semidefinite function.

*Definition 4 (see [18]). *If is a positive (negative) definite function, such that , it is called and has an infinitesimally small upper bound. If is an infinite positive definite function, such that , it is called and has an infinite lower bound.

Theorem 5 (see [18]). *Suppose that is a positive definite function in , which has an infinitesimally small upper bound and an infinite lower bound and is a negative semi-definite, so the zero solutions for system are global uniformly asymptotically stable.*

Theorem 6. *āā is the equilibrium of the system .*

*Proof. *Let the right side of each of the differential equations (12) be equal to zero in the system which gives the equation

The feasible region for the equations is , and so we study the equations in a closed set* A* = .

From (11) and (12), we can get , so . Substituting into (13), we have . Adding (12), we can get . From (13), the system has the equilibrium āā.

Therefore, we can obtain the equilibrium for the system āā, where ; that is, the rumor must disappear with time, and all and that satisfy represent stable situations. Next, we look at the stability of the equilibrium .

Theorem 7. *The equilibrium is globally uniformly asymptotically stable.*

*Proof. *Let the Liapunov function be , and taking the derivative of versus along the solution for the equations, we have

In order to ascertain and , and taking the values of , , and , we get , and

So we get , which is positive definite, ; that is, it has an infinitesimally small upper bound and an infinite lower bound, and is negative semidefinite in the feasible region .

From Theorem 5, the equilibrium is globally uniformly asymptotically stable.

#### 3. Numerical Analysis

In the following sections, simulations are conducted using the Runge-Kutta method and MATLAB in artificial networks and online social networks, respectively. First, we examine how the proportion of spreaders and stiflers changes over time by varying the function parameters. Then, we discuss the effect of the average degree of networks on rumor spreading. Finally, numerical solutions for the established model are conducted on the Sina Microbolg online social network, and we make comparisons between a constant versus a variable memory rate on the Sina Microbolg.

##### 3.1. Sensitivity Analysis in Artificial Networks

To compare the results, the proposed model was performed on two artificial networks with different values for parameter . We chose regular networks and ER random networks with the same network size and the same average degree .(1)Regular networks [19]: this is a nearest-neighbor coupled network, in which every node is of the same degree.(2)Random networks [20]: two different nodes are connected with a probability of , so we get random networks with nodes and edges. ER random networks degree distributions are an approximate Poisson distribution, . This distribution reaches its peak value at the average degree [21].(3)BA network [22]: the network exhibits a power-law degree distribution with .

Given that the other parameters are fixed, we compared the rumor spreading processes on the three networks with different values for . The smaller the value of , the slower the speed of increase for . So here, we set , , and . Figure 5 illustrates how the density of spreaders and stiflers changes over time for the different values of in a regular network. From a macroscopic perspective, we found that the greater parameter is, the higher the peak for is, and, as parameter increases, the size of the stiflers increases, as larger indicates a higher speed for to reach the maximum value . Figure 5(a) describes how the density of spreaders changes with changes in parameter . The green line indicates a scenario in which the memory speed is very fast. We have carefully checked that the results are not sensitive to when . It can be seen that the higher parameter is, the larger the spreader peak value is and the slower the rumor terminates. Figure 5(b) describes how the density of stiflers changes with over time. The final value for the stifler density is greater, which indicates the number of people affected by a rumor when is larger. Clearly, the larger the value of when other parameters are fixed, the broader the rumorās influence. A larger indicates that the speed is higher and reaches the maximum value, less spreaders change into stiflers, and therefore the influence of the rumor increases.

**(a)**

**(b)**

Figures 6 and 7 illustrate how the density of spreaders and stiflers changes over time with different values for in ER random networks and BA networks. Similar to the regular network, it can be seen that rumors spread more broadly when is larger. However, there is a most significant impact from the importance of events on rumor spreading in random networks. That is to say, rumor spreading is sensitive to parameter , which is related to the topology of random networks. From Figure 7(a), in the same situation, if is larger, the rumors spread most quickly in BA networks than in the other two networks. And the number of follows the relation . These results are consistent with the traditional understanding of epidemic and information spread in that the speed and range of the spread obey the relationship [8]. Figure 7(b) describes how the density of stiflers changes as changes over time. When parameter is fixed, we can see that the rumor spreads faster and the final size of the stiflers, , is largest in BA networks. In other words, rumors spread faster and more broadly on BA networks than the other networks. For all the networks, the bigger the value of , when other parameters are fixed, the bigger the rumors influence.

**(a)**

**(b)**

**(a)**

**(b)**

Because BA networks are closer to real social networks, we analyze the effect of the parameters and on these networks, respectively. Figure 8(a) illustrates how the spreader density changes as parameter changes in BA networks. Given that other parameters are fixed, the bigger the value of , the bigger the rumorās influence. is the maximal transformation probability that lurkers become spreaders; in reality, along with the increase of , there are more lurkers becoming spreaders. As a result, the number of spreaders increases, which increases the influence of the rumor. Figure 8(b) describes how the density of spreader changes as changes over time. Also, we can see in Figure 8(b) that the bigger the value of , when other parameters are fixed, the bigger the rumorās influence. is the initial probability that an individual becomes a spreader. In reality, a large means that the individual thinks that an event triggering rumors is very important in the spreading process, which can make more individuals change into spreaders and, therefore, increase the influence of the rumor. But has little influence on the spread of rumor.

**(a)**

**(b)**

Figure 9 displays the final spread size for regular networks and random networks as a function of the average degree when . In random networks, because , analyzing the effect of average degree is equal to analyzing the effect of connected probability on random network when network size is fixed. There are many similarities between Figures 9(a) and 9(b). It is obvious that increases with , but the final spreading size is larger in random networks at same average degree. Moreover, the curves show that peaks suddenly with small , which means that is sensitive when is small. Rumor spreading enhancement with the average degree could be more significant in random networks than that on regular networks when is small because of the different network topologies, while for a large , the changing scale for is smaller, which means that the final size of is not sensitive to the average degree when is large. We have carefully checked the fact that, with an increase in , becomes increasingly larger and is finally equal to 1 when is large enough. That is, when all individuals change to stiflers, the whole population is infected. In general, the final size of is sensitive to when is small but not sensitive to when is large.

**(a)**

**(b)**

##### 3.2. Rumor Spreading in Social Networks

To study how rumors spread on social networks, we simulated the rumor spreading process on a snapshot of the Chinaās largest microblog site, Sina Microblog networks which had been crawled by Yuan and Liu [23]. This snapshot consisted of 118,517 nodes and 2728,213 edges, with the degree distribution obeying the power law [24], . We chose online social networks because of the available network data and because we feel that their structure might be similar to that of other real world social networks.

Figure 10 corresponds to a case where , , and , which shows the general trends for the four kinds of agents in our rumor spreading model. From the simulation, we find that as the rumor propagates at the beginning of the process, there is a sharp increase in the number of spreaders. With the further spreading of the rumor, the number of spreaders quickly reaches a peak at about and then decrease as time goes on. Finally, the number of spreaders is zero and the spreading of the rumor terminates. With an increase in time , the number of unaware individuals always reduces while the number of stiflers always increases, finally reaching a balance at the end of the rumor spreading process. From this figure, it can be seen that almost all individuals become stiflers after about 70 time steps. The variation trend for the number of lurkers is similar to that of the spreaders, in that they increase at first and then decrease to zero. However, this increasing and decreasing trend for the lurkers is much more moderate than for the spreaders, and, as can be seen, the peak for the lurkers is much smaller than that for the spreaders.

Figure 11 shows how the densities of spreaders and stiflers change over time for variable and constant memory rate in the Sina Microbolg network. For the variable rate, it can be seen that the peak of the spreader is much higher, compared to the constant rate case. It can be seen from Figure 11(b) that final stifler density value is greater, which means that the population affected by the rumor is greater under a variable memory rate. At the same time, the rumor terminates faster when the memory rate is nonconstant, which shows that the addition of function has accelerated the pace of the entire rumor spreading process. Generally speaking, the rumor spreads faster and more broadly under variable rates on the Sina Microbolg. In real social networks, the number of people who spread rumors is small, but the rumors can spread widely as social networks have a high clustering coefficient which means the number of the lurkers who come into contact with the rumor is greater. Rumors spread quickly in the early stages through the friends of the people on social networks, and, some time later, the number of people who come into contact with the rumor reaches a maximum, after which people lose interest because local authorities have debunked the rumor or people have an increased awareness of the truth or otherwise of the rumor. Thus the speed of the transmission reduces. Finally, the spreaders gradually disappear, and the entire population becomes stiflers.

**(a)**

**(b)**

#### 4. Discussion

In our opinion, the cumulative effects of memory play an important role in the rumor spreading process. Although some variants of the SIR model do consider the memory effects, they do not consider the cumulative memory effect. That is to say, they reflect the memory effects using a constant parameter rather than a variable parameter which changes with time across the entire rumor spreading process. In order to better describe the rumor spreading process, we establish mean-field equations with variable memory effects rates in the network. As such, previous models which consider the memory effects rate as a constant become a special case of the new model. We compared our new rumor spreading model to the traditional model on an online social network. The simulation results showed that the function induced a broader and faster rumor spreading process. Although rumor spreading simulates on a given snapshot of the Sina Microblog networks. The model does not take into account all rumor spreading features, such as the forgetting mechanism [25], or the nonredundancy of contact [16], but it largely reflects the cumulative memory effects in the variants of the SIR model. We also found that rumor spreading is more influenced by parameter in random networks, which is caused by the specific topology of random networks. At the same time, it can be seen that the random networks are more effective in rumor spreading which supports Zanetteās experiment. In addition, our experiments show that a high average degree is very helpful in promoting the spreading of rumor. This is expected because as the average degree of networks increases, there are more friends for a user, which means there are more chances for spreaders to contact the unaware, making the spreading of the rumor much easier. However, the final number of people affected by the rumors is sensitive to the average degree when is small, but for a large , nearly all individuals spread the rumor. In fact, the entire population knows the rumor quickly when reaches a certain level, at which point the increased average degree has no effect.

From the discussion of the cumulative effects of memory in this paper, governments should use this special property to control the spread of rumors. Because a sustained and rapid spread of information deepens peopleās impression about this information and to a certain extent improves the credibility of the information, when an emergency arises, governments should release official information at a high frequency to ensure the sustained and rapid spreading of official information, which may help avoid the spread of panic and prevent the spread of unfounded rumors.

#### 5. Conclusions

In this paper, we have proposed a rumor spreading model which considers changing memory effects over time. At the same time, the speed that takes to reach a maximum value and the importance of an event were considered. The cumulative effect of memory reflects the repeatability of the spreading characteristics of the rumor, so the probability of a lurker becoming a spreader becomes increasingly larger and infinitely closer to a constant. Therefore, the probability is not a constant but a function of time in entire rumor spreading process. This conclusion was demonstrated in this study. We established a function to describe the cumulative effect of memory, and this function as a parameter was added to the rumor spreading model, and a dynamic analysis of the model was conducted.

The simulations showed how the memory effects do affect rumor spreading when the parameters of the memory function vary in regular networks, ER random networks, and BA networks. The simulation results indicated that a rumor spreads faster and more broadly in three network types when the initial memory rate is larger; the larger the maximum value of the memory rate , the faster the memory speed , and the greater the peak value for the spreaders. These results suggest that rumor spreading is sensitive to parameter in random networks, BA networks are most effective for rumor spreading, and the initial memory rate has little influence on the spread of rumor. We conducted a sensitivity analysis on the average degree in our model, the results of which demonstrated that the average degree plays a positive role in promoting rumor spreading. The final number of people affected by the rumors was found to be sensitive to the average degree when is small. Finally, the numerical solutions also demonstrated that the spreader peak value and final rumor spreading size on the Sina Microblog were much higher when the memory effects rate changes over time, compared to the case when the memory effects rate is considered a constant. Further study will be conducted which includes the other differences between rumor spreading and epidemic spreading. Further, investigation of rumor control strategies in different network topologies is also a future research direction.

#### Conflict of Interests

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

#### Acknowledgments

This research was supported by the Major Bidding Program of the National Social Science Foundation of China (Grant nos. 12 and ZD217) ad the National Natural Science Foundation of China (Grant no. 71301109) and supported by the Natural Science Foundation of Anhui Province (Grant no. KJ2011B140). We appreciated all support in finance and in spirit.

#### References

- W. A. Peterson and N. P. Gist, āRumor and public opinion,ā
*American Journal of Sociology*, vol. 57, no. 2, pp. 159ā167, 1951. View at: Google Scholar - D. J. Daley and D. G. Kendall, āEpidemics and rumours,ā
*Nature*, vol. 204, no. 4963, article 1118, 1964. View at: Publisher Site | Google Scholar - R. M. Anderson, R. M. May, and B. Anderson,
*Infectious Diseases of Humans: Dynamics and Control*, vol. 28, Wiley, 1992. - H. W. Hethcote, āThe mathematics of infectious diseases,ā
*SIAM Review*, vol. 42, no. 4, pp. 599ā653, 2000. View at: Publisher Site | Google Scholar | Zentralblatt MATH | 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 | MathSciNet - L. J. Zhao, H. X. Cui, X. Y. Qiu, X. Wang, and J. Wang, āSIR rumor spreading model in the new media age,ā
*Physica A*, vol. 392, no. 4, pp. 995ā1003, 2013. View at: Publisher Site | Google Scholar | MathSciNet - M. Nekovee, Y. Moreno, G. Bianconi, and M. Marsili, āTheory of rumour spreading in complex social networks,ā
*Physica A: Statistical Mechanics and its Applications*, vol. 374, no. 1, pp. 457ā470, 2007. View at: Publisher Site | Google Scholar - J. Wang, L. Zhao, and R. Huang, āSIRaRu rumor spreading model in complex networks,ā
*Physica A*, vol. 398, no. 15, pp. 43ā55, 2014. View at: Publisher Site | Google Scholar | MathSciNet - S. H. Strogatz, āExploring complex networks,ā
*Nature*, vol. 410, no. 6825, pp. 268ā276, 2001. View at: Publisher Site | Google Scholar - C. Liu and Z.-K. Zhang, āInformation spreading on dynamic social networks,ā
*Communications in Nonlinear Science and Numerical Simulation*, vol. 19, no. 4, pp. 896ā904, 2014. View at: Publisher Site | Google Scholar | MathSciNet - S. Han, F. Z. Zhuang, Q. He, Z. Shi, and X. Ao, āEnergy model for rumor propagation on social networks,ā
*Physica A: Statistical Mechanics and Its Applications*, vol. 394, no. 15, pp. 99ā109, 2014. View at: Publisher Site | Google Scholar - P. S. Dodds and D. J. Watts, āUniversal behavior in a generalized model of contagion,ā
*Physical Review Letters*, vol. 92, no. 21, Article ID 218701, 2004. View at: Publisher Site | Google Scholar - L. Zhao, J. Wang, Y. 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. J. Zhao, X. Y. Qiu, X. L. Wang, and J. Wang, āRumor spreading model considering forgetting and remembering mechanisms in inhomogeneous networks,ā
*Physica A*, vol. 392, no. 4, pp. 987ā994, 2013. View at: Publisher Site | Google Scholar | MathSciNet - D. Benjamin, F. Mahmoud, and F. Tobias, āExperimental analysis of rumor spreading in social networks,ā in
*Design and Analysis of Algorithms*, vol. 7659 of*Lecture Notes in Computer Science*, pp. 159ā173, Springer, Berlin, Germany, 2012. View at: Publisher Site | Google Scholar - L. Lü, D.-B. Chen, and T. Zhou, āThe small world yields the most effective information spreading,ā
*New Journal of Physics*, vol. 13, Article ID 123005, 2011. View at: Publisher Site | Google Scholar - L. Huo, P. Huang, and C.-x. Guo, āAnalyzing the dynamics of a rumor transmission model with incubation,ā
*Discrete Dynamics in Nature and Society*, vol. 2012, Article ID 328151, 21 pages, 2012. View at: Publisher Site | Google Scholar | MathSciNet - Z. E. Ma and Y. C. Zhou,
*The Qualitative and Stability Theory of Ordinary Differential Equations*, Science Press, Beijing, China, 2001, (Chinese). - D. J. Watts and S. H. Strogatz, āCollective dynamics of ‘small-world’ networks,ā
*Nature*, vol. 393, no. 6684, pp. 440ā442, 1998. View at: Publisher Site | Google Scholar - P. Erdös and A. Rényi, āOn random graphs,ā
*Publicationes Mathematicae Debrecen*, vol. 6, pp. 290ā297, 1959. View at: Google Scholar | MathSciNet - B. Bollobás,
*Random Graphs*, Academic Press, New York, NY, USA, 2001. - A. L. Barabási and R. Albert, āEmergence of scaling in random networks,ā
*Science*, vol. 286, no. 5439, pp. 509ā512, 1999. View at: Publisher Site | Google Scholar | MathSciNet - W. Yuan and Y. Liu, āEmpirical analysis and evolution modeling of network topological structure in microblog,ā in
*Proceedings of the 5th IEEE International Conference on Intelligent Networking and Collaborative Systems (INCoS '13)*, pp. 656ā661, Xi'an, China, September 2013. View at: Publisher Site | Google Scholar - A. Clauset, C. R. Shalizi, and M. E. Newman, āPower-law distributions in empirical data,ā
*SIAM Review*, vol. 51, no. 4, pp. 661ā703, 2009. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - 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

#### Copyright

Copyright © 2015 Yi Zhang and Jiuping Xu. 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.