On ISRC Rumor Spreading Model for Scale-Free Networks with Self-Purification Mechanism

Wang, Zijun; Chen, An

doi:https://doi.org/10.1155/2021/6685306

Complexity

On this page

Abstract Introduction Conclusions and Discussion Data Availability Conflicts of Interest Supplementary Materials References Copyright Related Articles

Special Issue

Parallel Analysis, Control, and Intelligence of Cyber-Physical-Social Systems

View this Special Issue

Research Article | Open Access

Volume 2021 | Article ID 6685306 | https://doi.org/10.1155/2021/6685306

On ISRC Rumor Spreading Model for Scale-Free Networks with Self-Purification Mechanism

Zijun Wang^1,2and An Chen^1,2

Academic Editor: Jianxiang Xi

Received09 Oct 2020

Revised26 Dec 2020

Accepted16 Jan 2021

Published03 Feb 2021

Abstract

At present, the feasibility of using self-purification mechanism to inhibit rumor spreading has been confirmed by studies from different perspectives. This paper improves the classical rumor spreading models with self-purification mechanism, analyzes the correlation between spreading threshold in the model and its self-purification level theoretically, and conducts numerical simulations to study the impact of the changes of model parameters on key indicators in the process of rumor spreading. The simulation results show that changes of model parameters, including self-purification level and forgetting rate, exert significant influences on rumor spreading exactly.

1. Introduction

Rumors generally refer to unconfirmed information. Although they contain uncertain elements, most of them are false and wrong [1, 2]. For example, after the nuclear leakage caused by the Japanese earthquake, the rumor that eating iodized salt can prevent radiation led to a large number of people buying salt in many places, which not only caused public panic but also seriously disturbed the normal social order.

The systematic study of rumors began in World War II. Knapp [3], whose research laid a foundation for the study, sorted out the rumors generated during the war and classified them. In 1947, Allport and Postman [4] believed that rumors were affected by personal values and other psychological factors and proposed the formula for the influence of rumors: R (influence of rumors) = I (importance of event) × A (ambiguity of event). The research study on the dynamics of rumor spreading arose during the 1960s. Because the process of rumor spreading is similar to the process of disease infection, the nodes in the model of rumor spreading is frequently divided into three categories by many studies using the dynamic model of disease infection for reference. These are the ignorant, spreaders, and stiflers, corresponding to the susceptible, the infected, and the recovered, respectively, in the model of disease infection. The existing dynamical models of rumor spreading are based on two classical models: DK model [5] and MT model [6]. However, these models failed to accurately describe the rumor spreading process in large-scale social networks with increasing complexity of the objects studied. Therefore, scholars paid more attention to the phenomenon of rumor spreading in complex networks. Moreno et al. [7, 8] examined the rumor spreading thresholds in homogeneous and heterogeneous networks, respectively. Mo and Guo [9] proposed a new control protocol to force the multiagent systems to achieve robust consensus. Zanette [10, 11] applied the rumor spreading model to static and dynamic small-world networks and verified the existence of critical threshold of the rumor spreading. Pan et al. [12] proved that high clustering of the network could effectively resist the spread of rumors. Zhao et al. [13, 14] investigated the dynamic characteristics of the rumor spreading in the BA scale-free network and BBV network and held a viewpoint that the topology of the network has a great influence on the rumor spreading. Scholars also consider the influence of forgetting mechanism [15–17], rejection mechanism [18–20], refutation mechanism [21–23], conformity and authoritative effect [24], ambiguity and attraction characteristics of rumors [25], noise in environment [26, 27], differences of spreading environment [28–31], prevention and control strategies [32–34], and other related factors on the process of rumor spreading. Based on the specific situations and problems, traditional models are modified to ensure their applicability.

Suppressing the spread of rumors and actively spreading the truth of information are two main methods to cope with rumor spreading in practice. However, some problems such as high coping costs, difficulty in confirming the truth in time, and insufficient effectiveness of external intervention keep emerging during this process [35]. Thus, scholars discuss how to apply the self-purification mechanism to solve relevant troubles [36], that is, to encourage users to release the complementation and correction of information, as well as refute false information. At present, the feasibility of using self-purification mechanism to inhibit rumor spreading has been confirmed by studies from different perspectives. Ge et al. [37] analyzed the inhibition effect of collective intelligence on the spread of false information in social media. Xia et al. [35] developed a new rumor spreading model for social media with self-purification mechanism and tested simulations, which unfolded the ability of social media to self-purify rumors. Tanaka et al. [38] proved that public questions and criticisms of rumors can affect individual judgments so that the spread of rumors can be suppressed.

Most of the current research studies on self-purification mechanism of networks are qualitative or case studies, and some other rumor spreading models are built with self-purification and skepticism mechanism. Zan et al. [19] who considered counterattack and self-resistance mechanism based on SIR model proposed the SICR rumor spreading model. Wang and Zhao [39] studied the SIQR rumor spreading model with skepticism mechanism and found that rumor truth disseminating rate plays an important role in rumor spreading process. Zhao et al. [40] added the group of doubters and constructed an SIHR rumor spreading model with self-protection awareness and skepticism mechanism, which suggests that many countermeasures can effectively prevent the dissemination of rumor, such as reducing the real contact rate between the ignorant and spreaders, improving the attention-degree of media to skeptics, and cutting down the depletion rate of mass media.

It is worth noting that the above models with self-purification mechanism are mostly based on homogeneous networks, while the theoretical analysis and related simulation studies of the complex networks, such as online social networks, are less involved. Moreover, once the status of doubters in most models is determined, even if they contact with other groups, the identity of doubters will not change. That is not completely consistent with the actual situation that rumor spreaders are mostly skeptical before spreading rumors [41]. In order to improve these shortcomings, the new rumor spreading model is introduced, traditional interaction rules are innovated, and correlation between spreading threshold in the model and its self-purification level is analyzed in this paper. In addition, simulations are designed and conducted to prove that the changes of model parameters, including self-purification level and forgetting rate, exert significant influences on rumor spreading exactly.

In this paper, the novelties are as follows. (1) adding the rule that “the criticizer may become a rumor spreader after hearing rumors for many times” as a complement to classical rules; (2) theoretical analysis of correlation between spreading threshold and self-purification level of the network is conducted; and (3) the influence of combinations of varying rumor spreading rate, forgetting rate, and self-purification capacity on the key indicators during rumor spreading process is explored. In the next section, the rumor spreading model for scale-free networks is built and relevant interaction rules, transformation relationships, and mean-field equations are introduced. Theoretical analysis about the correlation between spreading threshold and self-purification level is performed in Section 3. In Section 4, relevant numerical simulations are tested. Finally, conclusions and discussions are shown in Section 5.

2. Rumor Spreading Model Building

When building the rumor spreading model with self-purification mechanism, “whether an individual believes in rumor, whether an individual spreads rumor, and whether an individual criticizes rumor” are taken as a basis for grouping, and the situation of criticizing is a sufficient but non-necessary condition for the situation of disbelieving.

The rumor spreading model in this paper is called the ISRC model, where ‘I’ stands for the ignorant, ‘S’ means spreaders, ‘R’ denotes the recovered, and ‘C’ indicates criticizers. refers to the density of the ignorant who do not hear the rumor at time , and for the same reason, , , and show the density of spreaders who believe in and spread the rumor at time , the density of the recovered who can determine falsity of the rumor and do not spread or criticize it at time , and the density of criticizers who criticize the rumor at time , respectively. It is a remarkable fact that the criticizers consist of the individuals who can accurately identify the rumor and the others who criticize the rumor without understanding the truth of rumor information. The latter is likely to be assimilated by rumor spreaders due to the herd effect after getting access to the rumor for many times. That corresponds to the conclusion in the previous study that “the criticizer may become a rumor spreader after hearing rumors for many times [41].” Correspondingly, represents the density of the ignorant with connectivity at time . The meanings of , , and are similar to that of and will not be repeated here. We have that with the degree distribution and so do , , and . In addition, and .

Here, we assume that (1) the rumor spreading model targets a single rumor and does not consider the interaction among multiple rumors; (2) the method without nodes joining or leaving is used to keep the total number of nodes in the network constant in the selected period; (3) the transformation of these four groups must be based on the information exchange between groups, and only spreaders and criticizers can spread the information, the others are receivers of the information; (4) considering the herd effect, some criticizers who do not understand the truth may be assimilated by rumor spreaders after repeated exposures to the rumor; similarly, rumor spreaders have chance to be the recovered after hearing criticizing information for many times; and (5) rumor exchange within the group of spreaders has no effect on the change of status of both sides.

For scale-free networks, the transformation relationships and interaction rules among I, S, R, and C are illustrated in Figure 1.

Figure 1

Transformation relationships and interaction rules among I, S, R, and C for scale-free networks where represents probability of transforming from I to S after contacting (S) called rumor spreading rate; represents probability of transforming from I to R after contacting (S); represents probability of transforming from I to C after contacting (S); represents probability of transforming from C to S after contacting (S); represents probability of transforming from I to R after contacting (C); represents probability of transforming from I to C after contacting (C); represents probability of transforming from S to R after contacting (C) called self-purification level; and represents probability of transforming from S or C to (R) called forgetting rate.

The following formulas hold and . According to the relevant dynamical method, the mean-field equations can be described as follows:where denotes the conditional probability that a node with links is connected to a node with degree . It can be written as , where means the average degree and denotes the degree distribution [15].

3. Analysis of Correlation

In this section, we analyze the correlation between spreading threshold in the ISRC model for scale-free networks and self-purification level. Considering the model shown in Figure 1, only nodes of type I and type R exist in the final network. Referring to the idea on the SIR-like model for complex networks in reference [42], spreaders S and criticizers C are grouped into one category in this section and recorded as Information Spreaders, denoted by X. This model is called IXR model, and its transformation relationships and interaction rules among I, X, and R are shown in Figure 2.

Mean-field equations are depicted by the following equations:where and stand for the conditional probability, represented as , where means average degree and denotes degree distribution.

We assume a homogeneous initial distribution of the ignorant , and set without loss of generality. In this case, equation (2) can be integrated directly yieldingwhere an auxiliary function is defined as follows:with the shortened form , and is the simple mark for for convenience.

Multiplying equation (3) with , summing over, and integrating terms in the equation, we obtain

Because and are very small when close to the critical threshold, we assert , where denotes a finite function. We solve equation (3) using the method to ODE, solve equation (7) using Taylor series expansion and retaining leading terms and eventually derive the expression of as follows:

When , . Therefore, according to equation (7), we have

Insert equations (8) into (9) and expand the exponential to the relevant order in yieldingwhere is a positive-defined integral.

Consequently,where is always a solution. We can find the nonzero solution as follows:

From expression of in equation (12), we learn is always positive. needs to be true to ensure is positive, i.e., . Therefore, we obtain the spreading threshold in the IXR model:

This result shows that the spreading threshold in the IXR model is not only related to the degree of nodes in the network but also depends on the forgetting rate . That actually indicates that spreading threshold in the IXR model for scale-free networks is uncorrelated with the self-purification level . It can be deduced that there is no correlation between spreading threshold in the ISRC model for scale-free networks and self-purification level of the network.

4. Numerical Simulations

In this section, the Runge–Kutta method is used to solve the system of differential equation (1), and the numerical simulations are conducted by using NetLogo to analyze the influence of changes of rumor spreading rate, forgetting rate, and self-purification level on process and results of rumor spreading in scale-free networks. Maximum value of the sum of the density of group S in the process of rumor spreading is regarded as peak value of rumor influence (abbreviated as PVI), and the moment when this situation is reached is called arrival time of peak value of rumor influence (abbreviated as TPVI). Since the types of remaining nodes in the final network will only be part or all of I and R, the situation in which the density of I and the density of R is no longer changing is set a sign of the end of the rumor spreading process. The duration of rumor spreading is abbreviated as DRS. These three indicators (PVI, TPVI, and DRS) reflect the pros and cons of the effect to inhibit rumor spreading. For example, if with smaller PVI, earlier TPVI, and shorter DRS, there will be better effect to inhibit rumor spreading.

In this section, the rumor is set to spread in a scale-free network with nodes, power exponent , and average degree . In simulations, there are 10 spreaders in the initial network, i.e., , , , and . 30 simulations under each condition is performed, and average value of all results under each condition as final result is taken (the values of PVI are account to two decimal places, and the values of TPVI and DRS are accurate to one decimal place).

Figure 3 shows the influence of changes of rumor spreading rate and self-purification level on three indicators (PVI, TPVI, and DRS) during the process of rumor spreading. Figure 3(a) displays how PVI changes for four values of . It can be seen from Figure 3(a) that PVI decreases as increases, and for the same level of self-purification, the higher the rumor spreading rate is, the greater the PVI is. Figure 3(a) reflects that the improving self-purification level and reducing rumor spreading rate are conducive to reducing the peak value of rumor influence in process of rumor spreading. Correspondingly, Figures 3(b) and 3(c) reveal how TPVI and DRS change. From Figure 3(b), we can obtain that with small ( = 0.2, 0.4, 0.6), TPVI is negatively correlated with , but TPVI has little changes in the situation of . When , TPVI decreases as increases, while , TPVI decreases in . Therefore, Figure 3(b) implies that if rumor spreading rate remains at a high level, the improvement of self-purification level of networks may not affect the arrival time of peak value of rumor influence, and Figure 3(b) also indicates that is a critical value; when , the higher the rumor spreading rate is, the earlier the arrival time of peak value of rumor influence is; when , result is the opposite. Figure 3(c) manifests that and have minor effects on DRS, which also means duration of rumor spreading is not clearly related to rumor spreading rate or self-purification level. Therefore, as a whole, at a low rumor spreading rate and high self-purification level, there is a better effect to inhibit rumor spreading in the network, while in the case of high rumor spreading rate, as the level of self-purification increases, the effect to inhibit rumor spreading may become worse.

(a)

(b)

(c)

Figure 4 displays the influence of changes of forgetting rate and self-purification level on three indicators (PVI, TPVI, and DRS) during the process of rumor spreading. Figure 4(a) shows how PVI changes for four values of . We can learn from Figure 4(a) that PVI is negatively correlated with , and for the same level of self-purification, the higher the forgetting rate is, the smaller the PVI is. Figure 4(a) reveals that the improvement of self-purification level and forgetting rate is conducive to reducing the peak value of rumor influence in process of rumor spreading. Accordingly, Figure 4(b) demonstrates how TPVI changes. For same , as increases, the values of TPVI tend to decrease. However, as forgetting rate increases, the changes of TPVI become more and more irregular and erratic. It is conveyed by Figure 4(c) that DRS is negatively correlated with , and for same forgetting rate, the change of has a minor effect on DRS. Figure 4(c) also means that duration of rumor spreading is considerably related to forgetting rate. Thus, whether the network is at a high or low forgetting rate, on the whole, the increase in self-purification level will lead to a tendency to suppress rumor spreading. However, compared with the case of high forgetting rate, when the forgetting rate is low, the improvement of self-purification level has a more significant effect to inhibit rumor spreading.

(a)

(b)

(c)

5. Conclusions and Discussion

This paper improves classical rumor spreading models with self-purification mechanism, analyzes the correlation between spreading threshold in the model and its self-purification level theoretically, and conducts numerical simulations to prove that the changes of model parameters, including self-purification level and forgetting rate, exert significant influences on rumor spreading. Novel features and significant results are summarized into three respects:(1)When building the model, take “the criticizer may become a rumor spreader after hearing rumors for many times” into account and add variable to convey the probability of a criticizer transforming to a rumor spreader under the influence of rumor spreaders.(2)Through theoretical analysis about the correlation between spreading threshold in the model and its self-purification level, we find the spreading threshold in the ISRC rumor spreading model for scale-free networks has no correlation with self-purification mechanism. More precisely, the spreading threshold has no correlation with the probability of a criticizer transforming to a rumor spreader under the influence of rumor spreaders.(3)Numerical simulations are conducted to study the impact of changes of model parameters on key indicators in process of rumor spreading. The results manifest that changes of model parameters exert significant influences on rumor spreading exactly. On the one hand, at a low rumor spreading rate and high self-purification level, there is a better effect to inhibit rumor spreading in the network, while in the case of high rumor spreading rate, as self-purification level increases, the effect may become worse; on the other hand, whether the network is at a high or low forgetting rate, on the whole, the increase in self-purification level will lead to a tendency to suppress rumor spreading. However, compared with the case of high forgetting rate, when the forgetting rate is low, the improvement of self-purification level has a more significant effect to inhibit rumor spreading.

It should be noted that the authoritative effect of individuals is not considered in this paper, and the forgetting rate is regarded as a fixed value. In real social networks, there are “opinion leaders,” which mirror that the more fans a person has, the greater his or her assimilation influence on other individuals is. Considering the forgetting rate tends to change over time in real networks, the authoritative effect of individuals and the dynamic forgetting rate can be combined in the follow-up research to further explore the influence of changes of related parameters on the process of rumor spreading.

Data Availability

The data in this paper are obtained through simulations by NetLogo 6.1.0. The specific code and data are available from the author ([email protected]) on reasonable request.

Conflicts of Interest

The authors declare that they have no potential conflicts of interest.

Supplementary Materials

The code within Code.txt is run using Netlogo 6.1.0. and adjusted the parameters to get simulation results (results of authors are shown in Data.txt). Figures are plotted according to the data within Data.txt and eventually Figures 3(a)–3(c) and Figures 4(a)–4(c) are obtained in this paper. (Supplementary Materials)

References

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
J. Kostka, Y. A. Oswald, and R. Wattenhofer, “Word of mouth: rumor dissemination in social networks,” Lecture Notes in Computer Science, vol. 5058, pp. 185–196, 2008.
View at: Google Scholar
R. H. Knapp, “A psychology of rumor,” Public Opinion Quarterly, vol. 8, no. 1, pp. 22–37, 1944.
View at: Publisher Site | Google Scholar
G. W. Allport and L. Postman, The Psychology of Rumor, Henry Holt and Company, New York, NY, USA, 1947.
D. J. Daley and D. G. Kendall, “Stochastic rumours,” IMA Journal of Applied Mathematics, vol. 1, no. 1, pp. 42–55, 1965.
View at: Publisher Site | Google Scholar
D. P. Maki and M. Thomson, Mathematical Models and Applications: With Emphasis on the Social, Life and Management Sciences, Prentice-Hall, Englewood Cliffs, NJ, USA, 1973.
Y. Moreno, M. Nekovee, and A. F. Pacheco, “Dynamics of rumor spreading in complex networks,” Physical Review E, vol. 69, Article ID 066130, 7 pages, 2004.
View at: Publisher Site | Google Scholar
Y. Moreno, M. Nekovee, and A. Vespignani, “Efficiency and reliability of epidemic data dissemination in complex networks,” Physical Review E, vol. 69, Article ID 055101, 4 pages, 2004.
View at: Publisher Site | Google Scholar
L. Mo and S. Guo, “Consensus of linear multi-agent systems with persistent disturbances via distributed output feedback,” Journal of Systems Science and Complexity, vol. 32, no. 3, pp. 835–845, 2019.
View at: Publisher Site | Google Scholar
D. H. Zanette, “Critical behavior of propagation on small-world networks,” Physical Review E, vol. 64, Article ID 050901, p. 4, 2001.
View at: Publisher Site | Google Scholar
D. H. Zanette, “Dynamics of rumor propagation on small-world networks,” Physical Review E, vol. 65, Article ID 041908, p. 9, 2002.
View at: Publisher Site | Google Scholar
Z. Pan, X. Wang, and X. Li, “Simulation investigation on rumor spreading on scale-free network with tunable clustering,” Journal of System Simulation, vol. 18, no. 8, pp. 2346–2348, 2006.
View at: 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
L. Zhao, X. Wang, X. Qiu, and 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
M. Nekovee, Y. Moreno, G. Bianconi, and M. Marsili, “Mechanism of rumour spreading in complex social networks,” Physica A: Statistical Mechanics and Its Applications, vol. 374, no. 1, pp. 457–470, 2006.
View at: 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
X. Wang, L. Zhao, and W. Xie, “Rumor spreading model with variable forgetting rate in scale-free network,” System Engineering Mechanism and Practice, vol. 35, no. 2, pp. 458–465, 2015.
View at: Google Scholar
N. Ren and J. Li, “Rumor-spreading model with a rejection mechanism,” Journal of Yunnan Minzu University (Natural Sciences Edition), vol. 28, no. 1, pp. 67–71, 2019.
View at: Google Scholar
Y. Zan, J. Wu, P. Li, and Q. Yu, “SICR rumor spreading model in complex networks: counterattack and self-resistance,” Physica A: Statistical Mechanics and Its Applications, vol. 405, pp. 159–170, 2014.
View at: Publisher Site | Google Scholar
L. Zhao, X. Wang, J. Wang, X. Qiu, and W. Xie, “Rumor-propagation model with consideration of refutation mechanism in homogeneous social networks,” Discrete Dynamics in Nature and Society, vol. 2014, Article ID 659273, 11 pages, 2014.
View at: Google Scholar
X. Wang, L. Zhao, and Z. Wu, “Rumor propagation model with considering refutation mechanism in inhomogeneous networks,” Systems Engineering, vol. 2015, no. 12, pp. 139–145, 2015.
View at: Google Scholar
N. Zhang, H. Huang, B. Su, J. Zhao, and B. Zhang, “Dynamic 8-state ICSAR rumor propagation model considering official rumor refutation,” Physica A: Statistical Mechanics and Its Applications, vol. 415, pp. 333–346, 2014.
View at: Publisher Site | Google Scholar
Q. Guo, X. Liu, and Z. Hu, “Effect of factual information release on rumor spreading,” Application Research of Computers, vol. 31, no. 4, pp. 1031–1034, 2014.
View at: Google Scholar
Y. Ma, Y. Zhao, and Y. Qiang, “Conformity effect and authoritative effect of rumor spreading in social network,” Journal of Computer Applications, vol. 39, no. 1, pp. 232–238, 2019.
View at: Google Scholar
L.-L. Xia, G.-P. Jiang, B. Song, and Y.-R. Song, “Rumor spreading model considering hesitating mechanism in complex social networks,” Physica A: Statistical Mechanics and Its Applications, vol. 437, pp. 295–303, 2015.
View at: Publisher Site | Google Scholar
H. Chen, “Analysis on the dynamics behavior of a rumor transmission model with stochastic perturbation,” Bulletin of Science and Technology, vol. 32, no. 6, pp. 139–144, 2016.
View at: Google Scholar
N. Cai, M. He, Q. Wu, and M. J. Khan, “On almost controllability of dynamical complex networks with noises,” Journal of Systems Science and Complexity, vol. 32, no. 4, pp. 1125–1139, 2019.
View at: Publisher Site | Google Scholar
Y. Gu and F. Meng, “Rumor spreading in the online social network: A case of a Renren account,” in Proceedings of the Third International Conference on Digital Manufacturing and Automation, pp. 751–754, Guilin, China, August 2012.
View at: Google Scholar
D. Lu, J. Guo, and Y. He, “Based on the double S model research in WeChat rumors spreading,” Mathematics in Practice and Mechanism, vol. 47, no. 16, pp. 157–163, 2017.
View at: Google Scholar
C. Fan, H. Song, and G. Ding, “Research on an improved SEIR network rumor propagation model,” Journal of Intelligence, vol. 36, no. 3, pp. 86–91, 2017.
View at: Google Scholar
L. Zhu and H. Zhao, “Dynamical behaviours and control measures of rumour-spreading model with consideration of network topology,” International Journal of Systems Science, vol. 48, no. 10, pp. 2064–2078, 2017.
View at: Publisher Site | Google Scholar
Z. Song, J. Wang, and R. Shi, “Emergency rumor spreading on Weibo: a research based on scale-free networks,” Journal of Intelligence, vol. 34, no. 12, pp. 111–115, 2015.
View at: Google Scholar
Y. Wan, D. Zhang, and Q. Ren, “Propagation and inhibition of online rumor with considering rumor elimination process,” Acta Physica Sinica (Chinese Edition), vol. 64, no. 24, pp. 69–79, 2015.
View at: Google Scholar
Y. Gu and L. Xia, “The propagation and inhibition of rumors in online social network,” Acta Physica Sinica (Chinese Edition), vol. 61, no. 23, Article ID 238701, 7 pages, 2012.
View at: Google Scholar
Z. Xia, Z. Wu, X. Wang, and Y. Xie, “The quantitative simulation of social media rumors self-purification mechanism,” Journal of Modern Information, vol. 39, no. 3, pp. 103–110, 2019.
View at: Google Scholar
P. Ozturk, H. Li, and Y. Sakamoto, “Combating rumor spread on social media: the effectiveness of refutation and warning,” in Proceedings of the IEEE 2015 48th Hawaii International Conference on System Sciences, pp. 2406–2414, Washington, DC, USA, January 2015.
View at: Google Scholar
T. Ge, Z. Xia, and Y. Zhai, “Analysis of collective intelligence effect on social media false information transmission,” Journal of Intelligence, vol. 34, no. 7, pp. 148–152, 2015.
View at: Google Scholar
Y. Tanaka, Y. Sakamoto, and T. Matsuka, “Toward a social-technological system that inactivates false rumors through the critical thinking of crowds,” in Proceedings of the IEEE 2013 46th Hawaii International Conference on System Sciences, pp. 649–658, Washington, DC, USA, January 2013.
View at: Google Scholar
X. Wang and L. Zhao, “Rumor spreading model with skepticism mechanism in social networks,” Journal of University of Shanghai for Science and Technology, vol. 34, no. 5, pp. 424–428, 2012.
View at: 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
H. Yuan and Y. Xie, “Research on rumormonger in public events based on content analysis of 118 Internet rumors in public events,” Shanghai Journalism Review, vol. 2015, no. 5, pp. 58–65, 2015.
View at: Google Scholar
X. Qiu, L. Zhao, J. Wang, X. Wang, and Q. Wang, “Effects of time-dependent diffusion behaviors on the rumor spreading in social networks,” Physics Letters A, vol. 380, no. 24, pp. 2054–2063, 2016.
View at: Publisher Site | Google Scholar

Copyright

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

PDF Download Citation

Download other formats

Order printed copies

Views

466

Downloads

1069

Citations