Next Article in Journal
An Upper Bound for Locating Strings with High Probability Within Consecutive Bits of Pi
Previous Article in Journal
Uniqueness of Positive Solutions to Non-Local Problems of Brézis–Oswald Type Involving Hardy Potentials
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Analysis and Control of Rumor Propagation Model Considering Multiple Waiting Phases

1
Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China
2
Yunnan Key Laboratory of Artificial Intelligence, Kunming University of Science and Technology, Kunming 650500, China
3
Information Center, Kunming University, Kunming 650214, China
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(2), 312; https://doi.org/10.3390/math13020312
Submission received: 7 December 2024 / Revised: 8 January 2025 / Accepted: 14 January 2025 / Published: 19 January 2025

Abstract

:
Rumors pose serious harm to society and exhibit a certain degree of repetitiveness. Existing rumor propagation models often have simple rules and neglect the repetitiveness of rumors. Therefore, we propose a new SCWIR rumor propagation model (susceptible, commented, waited, infected, recovered) by introducing the user’s repeated waiting behavior to simulate the potential for rumors to lie dormant and spread opportunistically. First, we present the dynamic equations of the model, then introduce three influencing factors to improve the model. Next, by solving for the equilibrium points and the basic reproduction number, we discuss the local and global stability of the rumor-free/rumor equilibrium points. Finally, we perform numerical simulations to analyze the effects of different factors on rumor propagation. The results show that the introduction of the multiple waiting mechanism helps simulate the repetitiveness of rumor propagation. Among the rumor suppression strategies, the effectiveness, from highest to lowest, is as follows: government intervention, information dissemination and popularization, and accelerated rumor value decay, with government intervention playing a decisive role. Information dissemination can reduce the intensity of rumors at the source.

1. Introduction

Rumors refer to statements deliberately fabricated by individuals that do not align with objective facts, and their propagation usually leads to certain negative impacts. The rapid development of the internet has not only made it easier for people to access information but has also intensified the spread of rumors. Rumor propagation tends to have a certain repetitiveness, with some individuals who spread rumors temporarily retreating and then becoming active again. Additionally, individuals who are easily swayed may enter a short-term observation and waiting phase when the public opinion environment improves. Existing research on rumor propagation has overlooked this aspect. Therefore, we will conduct an in-depth study on rumor propagation. In recent years, many scholars have proposed various effective methods for researching rumor propagation models [1,2]. At present, theoretical studies based on infectious disease models [3] and simulation studies based on complex networks [4] are common approaches for examining information diffusion mechanisms in the networks.
In the early stages of rumor dissemination research, it was observed that the spread of infectious diseases and rumors share similarities, as both involve propagation through individual interactions within a network. Scholars were inspired by infectious disease models and further applied them to rumor propagation, leading to models such as SI [5], SIS [6], and SIR [7]. Wang et al. [8] developed the SEIR rumor propagation model, introducing an exposed (E) state to represent individuals who are aware of the information but have not yet disseminated it. Wang et al. [9] developed the SEIRD model, categorizing individuals who believe rumors into different levels to simulate the dynamics of rumor spread. With the growth of internet users, the diversity of user relationships has become more apparent, and the role of group interactions in information dissemination is increasingly significant [10,11,12]. Wang et al. [13] introduced the PN-UHTR dynamic evolution model, integrating individual behavior with the information spread layer to examine the effects of various strategies on information spread within a hypernetwork. Zhang et al. [14] examined strategies for controlling information, including perceived value and timeliness, constructing the SE2IR information propagation model. Markovich et al. [15] used closeness centrality to evaluate node leadership. Nie et al. [16] examined user contact capacity, finding that higher contact capacity leads to greater information popularity. Gong et al. [17] combined the hypernetwork model to establish the UHIR model, exploring the effects of factors such as user trust and information characteristics on rumor propagation. Dong et al. [18] studied the impact of various communication channels and time delays on rumor spread.
In social networks, information browsing behavior is shaped by multiple factors, including public opinion, psychological influences, and personality traits [19], posing significant challenges to rumor control. During sudden events, not everyone makes immediate decisions; some individuals remain neutral, waiting for developments before taking action. Existing rumor propagation models insufficiently account for these factors, neglecting the presence of neutral individuals and their impact on rumor dissemination. To fill these gaps, we develop the SCWIR model, offering the following contributions:
(1)
Establish the initial model by introducing class C members (commenters), representing individuals who engage in commenting on the rumor event, and class W members (waiters), representing neutral waiting individuals who, after being exposed to the event, choose to observe the development of the situation.
(2)
Consider the nature of secondary infection, where neutral wait-and-see individuals may include those who temporarily awakened but later returned to believing the rumor. At the same time, the model also considers the varying rumor propagation abilities corresponding to different levels of belief in the rumor.
(3)
Introduce government intervention to guide the population in resisting rumors; incorporate information popularization rate and information timeliness to study their impacts on rumor propagation. Propose a debunking coefficient and an information timeliness coefficient to improve the SCWIR model.
(4)
Accelerate the decay of information value, strengthen government debunking efforts, and implement earlier interventions to ensure the basic reproduction number R 0 < 1 , thereby suppressing rumors.

2. Preparation Work

2.1. SEIR Rumor Propagation Model

In rumor propagation, some users who know the information do not immediately spread it but still retain the ability to do so. To account for this, the SEIR model introduces exposed individuals (E). As shown in Figure 1, susceptible individuals become exposed with a probability α upon encountering the rumor. Exposed individuals transition to infected with a probability β , while infected individuals recover and become immune with a probability γ . The SEIR model initially considers the scenario where users adopt a neutral, wait-and-see attitude upon their first encounter with a rumor but overlooks the possibility of repeated waiting instances. Building on the SEIR model, this paper fully accounts for multiple waiting scenarios and introduces three influencing factors to analyze and control rumor propagation.

2.2. Comparative Analysis

In existing models, changes in rumor propagation are often unidirectional and irreversible, with insufficient consideration of user stance changes during rumor spread and overlooking the possibility of repeated waiting scenarios. To address these limitations, the SCWIR model offers the following advantages:
(1)
It accounts for the various possibilities of user stance transitions during rumor events. These transitions are reversible and multidirectional, comprehensively considering users shifting between commenting, believing, remaining neutral, or being indifferent upon encountering rumors. It also considers the situation where users wait multiple times for the development of the situation.
(2)
It examines the effect of factors such as information popularization rate and information timeliness on different user groups during rumor propagation. Additionally, it explores the role of government intervention in guiding user behavior.
(3)
It considers the different roles that neutral waiting, commenting, and forwarding groups of believers play in rumor propagation.

3. SCWIR Rumor Propagation Model

3.1. Model Description

This paper presents a rumor propagation model, SCWIR, which considers multiple waiting situations. It introduces Commented (C) individuals, who comment on the rumor, and Waited (W) individuals, who remain neutral and wait for the event to develop, including those who initially believed the rumor but later woke up and returned to a neutral waiting state. Furthermore, the model considers the varying propagation capabilities of commenters and spreaders based on their belief level in the rumor. The model classifies network users into five distinct states: susceptible (S), commenters (C), wait-and-see individuals (W), infected or spreaders (I), and recovered or immune (R).
To facilitate the establishment, analysis, and study of the model, the following assumptions are made:
(1)
Assume the total population is N, where the initial spreaders (I) account for one-thousandth of the population, and the remaining individuals are susceptible (S). During the propagation process, no new nodes are added or removed, and the total population N remains constant.
(2)
Wait-and-see individuals (W) include those who adopt a neutral, wait-and-see stance after first encountering the rumor, as well as those who, after initially believing the rumor, awaken and revert to waiting again. This means that wait-and-see individuals have the potential to believe the rumor a second time.
(3)
Commenters (C) and spreaders (I) occasionally spread rumors, causing the susceptible individuals they interact with to transition into commenters (C), wait-and-see individuals (W), spreaders (I), or immune individuals (R) with probabilities α 1 α 2 , α 3 , and α 4 , respectively. Similarly, wait-and-see individuals (W) interacting with commenters (C) or spreaders (I) transition to commenters (C), immune individuals (R), or spreaders (I) with probabilities γ 1 , γ 2 , and γ 3 , respectively.
(4)
Commenters (C) have a weaker spreading ability compared to spreaders (I), with the model assuming C’s ability is half that of I.
(5)
Commenters (C) who come into contact with spreaders (I) may transition into new spreaders with a probability β 2 . Additionally, commenters may awaken and adopt a wait-and-see stance with a probability of β 1 or become immune to the rumor with a probability of β 3 .
(6)
Spreaders (I) have the potential to awaken, transitioning to wait-and-see individuals (W) with a probability σ 1 or to immune individuals (R) with a probability σ 2 .
(7)
Once individuals transition to immune (R), they no longer respond to the rumor event in any way. Building on these, the SCWIR model is developed, as shown in Figure 2. The parameters definitions are provided in Table 1.

3.2. Propagation Dynamics Equation

In this subsection, building on the assumptions outlined in Section 3.1, the dynamic equations for the SCWIR model are formulated. S(t), C(t), W(t), I(t), and R(t) represent the proportions of susceptibles, commenters, wait-and-see individuals, spreaders, and immune individuals, respectively, at time t.
d S ( t ) d t = α 1 + α 3 2 S ( t ) C ( t ) α 2 S ( t ) α 1 + α 3 S ( t ) I ( t ) α 4 S ( t )
d C ( t ) d t = α 1 2 S ( t ) C ( t ) + α 1 S ( t ) I ( t ) + γ 1 2 W ( t ) C ( t ) + γ 1 W ( t ) I ( t ) β 1 C ( t ) β 2 C ( t ) I ( t ) β 3 C ( t )
d W ( t ) d t = α 2 S ( t ) + β 1 C ( t ) + σ 1 I ( t ) γ 1 + γ 3 2 W ( t ) C ( t ) γ 2 W ( t ) γ 1 + γ 3 W ( t ) I ( t )
d I ( t ) d t = α 3 2 S ( t ) C ( t ) + α 3 S ( t ) I ( t ) + γ 3 2 W ( t ) C ( t ) + γ 3 W ( t ) I ( t ) + β 2 C ( t ) I ( t ) σ 1 I ( t ) σ 2 I ( t )
d R ( t ) d t = α 4 S ( t ) + γ 2 W ( t ) + σ 2 I ( t ) + β 3 C ( t )
α 1 + α 2 + α 3 + α 4 = 1 β 1 + β 2 + β 3 = 1 γ 1 + γ 2 + γ 3 = 1 σ 1 + σ 2 = 1 S ( t ) + C ( t ) + W ( t ) + I ( t ) + R ( t ) = 1 α 1 , α 2 , α 3 , α 4 , β 1 , β 2 , β 3 , γ 1 , γ 2 , γ 3 , σ 1 , σ 2 > 0
Equations (1)–(5) represent the changes in susceptible persons, commentators, observers, disseminators, and immune persons in rumor propagation. Equation (6) defines the constraints that the model must adhere to.

3.3. Quantitative Analysis of Influencing Factors

3.3.1. Information Timeliness

Different rumors demonstrate varying degrees of information timeliness. For example, COVID-19 rumors receive more attention than general flu rumors, and COVID-19 rumors tend to have a longer lifespan, with a slower decay in information value. The value of a rumor decreases over time, leading to a decline in its attention. There is a type of neuron model called LIF (Leaky Integrate-and-Fire) [20], where the membrane potential decreases over time. This characteristic is similar to the concept of information timeliness. The membrane potential’s time-dependent change can be expressed as
τ d u d t = u ( t )
Here, u ( t ) is the neuron’s membrane potential. Solving the differential equation yields
u ( t ) = c 0 e 1 τ t
The decay of rumor information is analogized to the decay of a neuron’s membrane potential. When a rumor (similar to a stimulus) is initially spread, its “information potential” is high, attracting a lot of attention. Over time, its influence gradually weakens, much like how a neuron’s membrane potential naturally decays. This paper uses this analogy to simulate the impact of information timeliness decay on rumor propagation, defining the formula for measuring rumor information timeliness as follows:
l = l 0 e λ t
Here, l is the information timeliness coefficient, representing the impact of information timeliness on rumor propagation. l 0 is the information’s initial value, t represents time, and λ is the information decay coefficient, with 0 < λ < 1 . A larger λ corresponds to a quicker decay in the value of information.

3.3.2. Government Intervention

Government debunking can significantly reduce rumor spread and aid in restoring the online public opinion landscape. Due to the limited number of network nodes, the impact of government intervention will also experience some decay. We adjust Equation (8) to simulate government debunking in order to suppress rumors. When the government begins to debunk rumors, a large number of users receive the debunking information, and the probability of rumor propagation decreases rapidly. However, some nodes with smaller degrees may still have difficulty accessing debunking messages, causing the decline in propagation probability to slow down. The formula for measuring government debunking is defined as follows:
g = 1 μ e t t
where g is the information diffusion coefficient after government intervention, t represents the current time, and t represents the time when debunking begins. The earlier the debunking starts, the smaller the probability of rumor propagation. μ represents the strength of debunking, with 1 μ 10 . The greater the debunking strength, the smaller the likelihood of rumor propagation.

3.3.3. Information Popularization Rate

Actively popularizing positive and accurate information about rumors can raise the number of initially immune users, providing a certain level of prevention against rumor propagation. In this study, the information popularization rate is introduced, with the parameter η representing the information popularization coefficient, indicating the scope of information popularization. At t = 0 , set
R ( 0 ) = η , I ( 0 ) = N / 1000 , S ( 0 ) = 1 R ( 0 ) I ( 0 ) , C ( 0 ) = 0 , W ( 0 ) = 0
Here, 0 η 1 , R ( 0 ) , I ( 0 ) , S ( 0 ) , C ( 0 ) , and W ( 0 ) represent the ratios of recovered, infected, susceptible, commented, and waited individuals in the social network at time t = 0 , respectively.

3.4. The Improved SCWIR Model

Considering the interventions from Section 3.3, the improved SCWIR model is shown in Figure 3. All references to the SCWIR model thereafter refer to the improved model. The propagation dynamics equations are updated as follows:
d S ( t ) d t = α 1 + α 3 2 g l S ( t ) C ( t ) α 2 S ( t ) α 1 + α 3 g l S ( t ) I ( t ) α 4 S ( t ) d C ( t ) d t = α 1 2 g l S ( t ) C ( t ) + α 1 g l S ( t ) I ( t ) + γ 1 2 g l W ( t ) C ( t ) + γ 1 g l W ( t ) I ( t ) β 1 C ( t ) β 2 g l C ( t ) I ( t ) β 3 C ( t ) d W ( t ) d t = α 2 S ( t ) + β 1 C ( t ) + σ 1 I ( t ) γ 1 + γ 3 2 g l W ( t ) C ( t ) γ 2 W ( t ) γ 1 + γ 3 g l W ( t ) I ( t ) d I ( t ) d t = α 3 2 g l S ( t ) C ( t ) + α 3 g l S ( t ) I ( t ) + γ 3 2 g l W ( t ) C ( t ) + γ 3 g l W ( t ) I ( t ) + β 2 g l C ( t ) I ( t ) σ 1 I ( t ) σ 2 I ( t ) d R ( t ) d t = α 4 S ( t ) + γ 2 W ( t ) + σ 2 I ( t ) + β 3 C ( t )

4. Stability Analysis

In this chapter, we apply the next-generation matrix method to calculate the basic reproduction number and use Lyapunov theory to analyze the stability of the system (12) at the rumor-free/rumor equilibrium points. Since immune individuals no longer respond to the rumor, they do not disrupt the system’s equilibrium. At the same time, when the number of immune individuals increases, it indicates that there are still individuals in the system who believe the rumor. We simplify Equation (12) to
d S ( t ) d t = α 1 + α 3 2 g l S ( t ) C ( t ) α 2 S ( t ) α 1 + α 3 g l S ( t ) I ( t ) α 4 S ( t ) d C ( t ) d t = α 1 2 g l S ( t ) C ( t ) + α 1 g l S ( t ) I ( t ) + γ 1 2 g l W ( t ) C ( t ) + γ 1 g l W ( t ) I ( t ) β 1 C ( t ) β 2 g l C ( t ) I ( t ) β 3 C ( t ) d W ( t ) d t = α 2 S ( t ) + β 1 C ( t ) + σ 1 I ( t ) γ 1 + γ 3 2 g l W ( t ) C ( t ) γ 2 W ( t ) γ 1 + γ 3 g l W ( t ) I ( t ) d I ( t ) d t = α 3 2 g l S ( t ) C ( t ) + α 3 g l S ( t ) I ( t ) + γ 3 2 g l W ( t ) C ( t ) + γ 3 g l W ( t ) I ( t ) + β 2 g l C ( t ) I ( t ) σ 1 I ( t ) σ 2 I ( t )

4.1. Stability Analysis of the Rumor-Free Equilibrium Point

First, it is necessary to determine the situation of the model at the rumor-free equilibrium point, where the rate of change in the state densities is zero. It is easy to see that the rumor-free equilibrium point of Equation (13) is E 0 ( ϖ , 0 , 0 , 0 ) , where it represents the density of susceptibles in the absence of commenters, waiters, and spreaders.
The basic reproduction number is a threshold that determines whether information can propagate within a system. Driessche developed a method for determining the basic reproduction number [21]. The system is divided into n compartments, with the compartments of infected individuals grouped and the compartments of uninfected individuals in another group. Let x i ( t ) represent the compartment containing infected individuals, then
x i ( t ) = f i ( t ) v i ( t )
In the equation, f i ( t ) represents the count of newly infected individuals, and v i ( t ) = v i ( t ) v i + ( t ) , where v i + ( t ) represents the count of individuals moving into compartment i from other compartments, and v i ( t ) represents the number of individuals moving out of compartment i. Driessche proved that if F and V denote the Jacobian matrices of f and v at the equilibrium point without disease E 0 , and F and V are the matrix forms of f i ( t ) and v i ( t ) , then the fundamental reproduction number R 0 of the system can be written as
R 0 = ρ ( F V 1 )
In the equation, F V 1 is the next generation matrix, and ρ represents the spectral radius.
In the SCWIR model, moving from the S state to the C, W, or I state represents individuals who have all been exposed to the rumor and are considered infected individuals. If they transition to the R state, they are considered immune to the rumor, thus belonging to the immune group. Therefore, in this system, the infected compartments are the Commented state (C), Waited state (W), and Infected state (I). Based on the concepts of the next-generation matrix, we can derive
F = α 1 2 g l S ( t ) C ( t ) α 2 S ( t ) α 3 2 g l S ( t ) C ( t ) + α 3 g l S ( t ) I ( t )
V = γ 1 2 g l W ( t ) C ( t ) γ 1 g l W ( t ) I ( t ) + β 2 g l C ( t ) I ( t ) + β 3 C ( t ) γ 1 + γ 3 2 g l W ( t ) C ( t ) + γ 2 W ( t ) + ( γ 1 + γ 3 ) g l W ( t ) I ( t ) γ 3 2 g l W ( t ) C ( t ) γ 3 g l W ( t ) I ( t ) β 2 g l C ( t ) I ( t ) + σ 2 I ( t )
Calculate its Jacobian matrix, and obtain
F = α 1 2 g l S ( t ) 0 0 0 0 0 α 3 2 g l S ( t ) 0 α 3 g l S ( t )
V = γ 1 2 g l W ( t ) + β 2 g l I ( t ) + β 3 γ 1 2 g l C ( t ) γ 1 g l I ( t ) γ 1 g l W ( t ) + β 2 g l C ( t ) γ 1 + γ 3 2 g l W ( t ) γ 1 + γ 3 2 g l C ( t ) + γ 2 + ( γ 1 + γ 3 ) g l I ( t ) ( γ 1 + γ 3 ) g l W ( t ) γ 3 2 g l W ( t ) β 2 g l I ( t ) γ 3 2 g l C ( t ) γ 3 g l I ( t ) γ 1 g l W ( t ) β 2 g l C ( t ) + σ 2
Substitute the equilibrium point E 0 into the equation.
F = α 1 2 g l ϖ 0 0 0 0 0 α 3 2 g l ϖ 0 α 3 g l ϖ
V = β 3 0 0 0 γ 2 0 0 0 σ 2
The next generation matrix is
F V 1 = α 1 g l ϖ 2 β 3 0 0 0 0 0 α 3 g l ϖ β 3 0 α 3 g l ϖ σ 2
Calculate its eigenvalues:
λ 1 = α 1 g l ϖ 2 β 3 , λ 2 = α 3 g l ϖ σ 2 , λ 3 = 0
According to the constraint conditions (6) and the parameter definitions, it is known that users who only comment have a higher probability of recovery, β 3 > σ 2 and α 1 2 < α 3 , thus λ 1 < λ 2 . The fundamental reproduction number is given by
R 0 = m a x ( λ 1 , λ 2 , λ 3 ) = α 3 g l ϖ σ 2 = l 0 α 3 ϖ μ ( σ 2 ) e 1 + λ t t t

4.1.1. Local Stability Analysis of the Rumor-Free Equilibrium Point

Theorem 1.
For the dynamical system (13), when R 0 < 1 , the system is locally asymptotically stable at the rumor-free equilibrium point E 0 . When R 0 > 1 , the system is unstable at the rumor-free equilibrium point E 0 .
Proof of Theorem 1.
We analyze the local stability of the model by calculating the Jacobian matrix of the system at the rumor-free equilibrium point E 0 . Let
Θ S ( t ) = d S ( t ) d t , Θ C ( t ) = d C ( t ) d t , Θ W ( t ) = d W ( t ) d t , Θ I ( t ) = d I ( t ) d t
J = ( Θ S ( t ) , Θ C ( t ) , Θ W ( t ) , Θ I ( t ) ) ( S ( t ) , C ( t ) , W ( t ) , I ( t )
The calculation yields
J = a 11 a 12 0 a 14 a 21 a 22 a 23 a 24 a 31 a 32 a 33 0 a 41 a 42 a 43 a 44
where
a 11 = α 1 + α 3 2 g l C ( t ) α 2 ( α 1 + α 3 ) g l I ( t ) α 4 a 12 = α 1 + α 3 2 g l S ( t ) a 14 = ( α 1 + α 3 ) g l S ( t ) a 21 = α 1 2 g l C ( t ) + α 1 g l I ( t ) a 22 = α 1 2 g l S ( t ) + γ 1 2 g l W ( t ) β 1 β 2 g l I ( t ) β 3 a 23 = γ 1 2 g l C ( t ) + γ 1 g l I ( t ) a 24 = α 1 g l S ( t ) + γ 1 g l W ( t ) β 2 g l C ( t ) a 31 = α 2 a 32 = β 1 γ 1 + γ 3 2 g l W ( t ) a 33 = γ 1 + γ 3 2 g l C ( t ) γ 2 ( γ 1 + γ 3 ) g l I ( t ) a 41 = α 3 2 g l C ( t ) + α 3 g l I ( t ) a 42 = α 3 2 g l S ( t ) + γ 3 2 g l W ( t ) + β 2 g l I ( t ) a 43 = γ 3 2 g l C ( t ) + γ 3 g l I ( t ) a 44 = α 3 g l S ( t ) + γ 3 g l W ( t ) + β 2 g l C ( t ) σ 2
Substitute E 0 and solve for its characteristic equation.
| J ( E 0 ) λ E | = α 2 α 4 λ α 1 + α 3 2 g l ϖ ( α 1 + α 3 ) g l ϖ 0 0 α 1 2 g l ϖ β 3 λ 0 α 1 g l ϖ 0 0 γ 2 λ 0 0 0 0 α 3 g l ϖ σ 2 λ = 0
The eigenvalues of the Jacobian matrix J ( E 0 ) are obtained as follows:
λ 1 = α 2 α 4 , λ 2 = α 1 2 g l ϖ β 3 , λ 3 = γ 2 , λ 4 = α 3 g l ϖ σ 2
Clearly, λ 1 < 0 and λ 3 < 0 , so it is only necessary to determine the sign of λ 2 and λ 4 . According to the parameter definitions and concepts, it is known that α 1 2 < α 3 , and under normal conditions, the probability of recovery for commenters is greater than that for spreaders, i.e., β 3 > σ 2 , so λ 2 < λ 4 .
λ 4 = α 3 g l ϖ σ 2 = σ 2 ( α 3 g l ϖ σ 2 1 ) = σ 2 ( R 0 1 )
Since σ 2 > 0 , when R 0 < 1 , λ 2 < 0 and λ 4 < 0 hold, and all eigenvalues of Equation (29) are negative. Therefore, the system (13) is locally stable at the rumor-free equilibrium point E 0 . Additionally, when R 0 > 1 , the eigenvalue λ 4 becomes positive, and the system is unstable at the rumor-free equilibrium point E 0 . □

4.1.2. Global Stability Analysis of the Rumor-Free Equilibrium Point

Theorem 2.
For the dynamical system (13), when the fundamental reproduction number R 0 < 1 , the system is globally stable at the rumor-free equilibrium point: E 0 .
Proof of Theorem 2.
Define the Lyapunov function of the system (13) as shown in Equation (32).
V ( t ) = C ( t ) + W ( t ) + I ( t ) , V ( t ) 0
Take the derivative of both sides.
d V ( t ) d t = α 1 + α 3 2 g l S ( t ) C ( t ) + α 3 g l S ( t ) I ( t ) + α 2 S ( t ) σ 2 I ( t ) β 3 C ( t ) γ 2 W ( t ) 3 α 3 g l S ( t ) I ( t ) σ 2 I ( t ) β 3 C ( t ) γ 2 W ( t ) 3 α 3 g l ϖ I ( t ) 3 σ 2 I ( t ) = 3 σ 2 ( α 3 g l ϖ σ 2 1 ) I ( t ) = 3 σ 2 ( R 0 1 ) I ( t )
When R 0 < 1 , d V ( t ) d t < 0 holds. d V ( t ) d t = 0 holds only at the rumor-free equilibrium point E 0 ( ϖ , 0 , 0 , 0 ) . According to the Lyapunov theorem, it can be inferred that when R 0 < 1 , the system is globally asymptotically stable at the rumor-free equilibrium point E 0 . □

4.2. Stability Analysis of the Rumor Equilibrium Point

In this subsection, we primarily analyze the stability of the system at the rumor equilibrium point. We first assume that there exists a rumor equilibrium point E 1 * = ( S * , C * , W * , I * ) , and the dynamical system (13) satisfies the following equation
1 α 1 + α 3 2 g l S * C * α 2 S * ( α 1 + α 3 ) g l S * I * α 4 S * = 0 α 1 2 g l S * C * + α 1 g l S * I * + γ 1 2 g l W * C * + γ 1 g l W * I * β 1 C * β 2 g l C * I * β 3 C * = 0 α 2 S * + β 1 C * γ 1 + γ 3 2 g l W * C * γ 2 W * ( γ 1 + γ 3 ) g l W * I * = 0 α 3 2 g l S * C * + α 3 g l S * I * + γ 3 2 g l W * C * + γ 3 g l W * I * + β 2 g l C * I * σ 1 I * σ 2 I * = 0
Thus, we obtain
I * = α 3 γ 3 β 2 g l ( 3 α 3 2 + 3 γ 3 2 + β 2 ) g l + σ 1 + σ 2 S * = 1 α 2 + 3 ( α 1 + α 3 ) 2 g l I * + α 4 C * = α 1 γ 1 β 2 g l I * + α 1 ( 3 ( α 1 + γ 1 ) 2 β 2 ) g l I * + β 1 + β 3 W * = α 2 β 1 σ 1 g l I * + α 2 β 1 + β 1 σ 1 γ 2 + 3 ( γ 1 + γ 3 ) 2 g l I *
Based on the above equation, we can calculate the expression for R * . Therefore, there exists a rumor equilibrium point E 1 * = ( S * , C * , W * , I * ) .

4.2.1. Local Stability Analysis of the Rumor Equilibrium Point

Theorem 3.
If H ( I * ) > 0 , G ( I * ) > 0 , K ( I * ) > 0 and H ( I * ) G ( I * ) > K ( I * ) , then the system (13) is locally stable at the rumor equilibrium point E 1 * = ( S * , C * , W * , I * ) .
Proof of Theorem 3.
Obtain the Jacobian matrix of the system at the rumor equilibrium point E 1 * = ( S * , C * , W * , I * ) .
J ( E 1 * ) = a 11 a 12 0 a 14 a 21 a 22 a 23 a 24 a 31 a 32 a 33 0 a 41 a 42 a 43 a 44
where
a 11 = α 1 + α 3 2 g l C * α 2 ( α 1 + α 3 ) g l I * α 4 a 12 = α 1 + α 3 2 g l S * a 14 = ( α 1 + α 3 ) g l S * a 21 = α 1 2 g l C * + α 1 g l I * a 22 = α 1 2 g l S * + γ 1 2 g l W * β 1 β 2 g l I * β 3 a 23 = γ 1 2 g l C * + γ 1 g l I * a 24 = α 1 g l S * + γ 1 g l W * β 2 g l C * a 31 = α 2 a 32 = β 1 γ 1 + γ 3 2 g l W * a 33 = γ 1 + γ 3 2 g l C * γ 2 ( γ 1 + γ 3 ) g l I * a 41 = α 3 2 g l C * + α 3 g l I * a 42 = α 3 2 g l S * + γ 3 2 g l W * + β 2 g l I * a 43 = γ 3 2 g l C * + γ 3 g l I * a 44 = α 3 g l S * + γ 3 g l W * + β 2 g l C * σ 2
Its characteristic equation is
( λ + d ) ( λ 3 + H ( I * ) λ 2 + G ( I * ) λ + K ( I * ) ) = 0
H ( I * ) = a + b + c G ( I * ) = a b + d + e K ( I * ) = a + a b + d e + c
where
a = ( α 1 + γ 1 β 2 ) g l I * , b = ( γ 1 + γ 3 ) g l I * + γ 2 γ 1 g l I * + β 1 , c = ( α 3 + γ 3 + β 2 ) g l I * σ 2 γ 3 g l σ 1 d = ( α 1 + γ 1 σ 1 ) g l I * + β 1 2 α 3 g l I * + γ 3 , e = α 2 g l I * α 4 ( β 3 + γ 3 ) g l I *
Thus, we obtain λ 1 = d < 0 , and
λ 3 + H ( I * ) λ 2 + G ( I * ) λ + K ( I * ) = 0
According to the Routh–Hurwitz criterion, if H ( I * ) > 0 , G ( I * ) > 0 , K ( I * ) > 0 and H ( I * ) G ( I * ) > K ( I * ) , then λ 2 , λ 3 , and λ 4 have negative real parts. Therefore, the system (13) is locally stable at the rumor equilibrium point E 1 * = ( S * , C * , W * , I * ) . □

4.2.2. Global Stability Analysis of the Rumor Equilibrium Point

Theorem 4.
For the dynamical system (13), if there exists a Lyapunov function V ( t ) > 0   ( t 0 ) , V ( 0 ) = 0 , and d V ( t ) d t < 0 , then the system is globally stable at the rumor equilibrium point E 1 * = ( S * , C * , W * , I * ) .
Proof of Theorem 4.
Let g ( a ) = a 1 l n a , where a > 0 and g ( a ) 0 . We construct the Lyapunov function as follows:
V ( t ) = a S * g ( S ( t ) S * ) + b C * g ( C ( t ) C * ) + c W * g ( W ( t ) W * ) + d I * g ( I ( t ) I * )
Let x = S ( t ) S * , y = C ( t ) C * , z = W ( t ) W * , h = I ( t ) I * , a, b, c, and d be positive constants. Taking the derivative, we obtain
d V ( t ) d t = a ( 1 1 x ) d S ( t ) d t + b ( 1 1 y ) d C ( t ) d t + c ( 1 1 z ) d W ( t ) d t + d ( 1 1 h ) d I ( t ) d t
Substituting, we obtain
d V ( t ) d t = ( b α 1 + α 3 2 g l S * C * + d ( α 1 + α 3 ) g l S * I * ) g ( x ) ( c α 2 + a α 4 ) g ( 1 x ) + ( d β 2 g l C * I * + c β 1 C * a α 1 2 g l S * C * c γ 1 2 g l W * C * ) g ( y ) ( c β 1 + d β 2 g l + β 3 ) g ( 1 y ) + ( b γ 1 + γ 3 2 g l W * C * + d ( γ 1 + γ 3 ) g l W * I * a α 2 S * b β 1 C * d σ 1 I * ) g ( z ) ( ( b 2 + d ) ( γ 1 + γ 3 ) g l + γ 2 ) g ( 1 z ) + ( d σ 1 I * a α 3 g l S * C * c γ 3 g l W * C * b β 2 g l C * I * ) g ( h ) ( c σ 1 + σ 2 ) g ( 1 h ) + ( a α 1 2 g l S * C * b ( β 1 C * + β 2 g l C * I * + β 3 C * ) ) g ( x y ) + ( b β 1 C * b γ 1 + γ 3 2 g l W * C * d ( γ 1 + γ 3 ) g l W * I * ) g ( y z ) + ( a α 3 g l S * I * + c γ 3 g l W * I * d σ 1 I * d σ 2 I * ) g ( z h )
It is possible to find suitable constants a, b, c and d, such that the following equation holds
d β 2 g l C * I * + c β 1 C * a α 1 2 g l S * C * c γ 1 2 g l W * C * 0 b γ 1 + γ 3 2 g l W * C * + d ( γ 1 + γ 3 ) g l W * I * a α 2 S * b β 1 C * d σ 1 I * 0 d σ 1 I * a α 3 g l S * C * c γ 3 g l W * C * b β 2 g l C * I * 0 a α 1 2 g l S * C * b ( β 1 C * + β 2 g l C * I * + β 3 C * ) 0 b β 1 C * b γ 1 + γ 3 2 g l W * C * d ( γ 1 + γ 3 ) g l W * I * 0 a α 3 g l S * I * + c γ 3 g l W * I * d σ 1 I * d σ 2 I * 0
Therefore, d V ( t ) d t 0 holds, and d V ( t ) d t = 0 holds only at the rumor equilibrium point E 1 * = ( S * , C * , W * , I * ) . Thus, the dynamical system (13) is globally asymptotically stable at the rumor equilibrium point E 1 * . □

5. Experiment and Result Analysis

5.1. Related Networks

In this section, simulation experiments will be conducted on the baseline model and the SCWIR model based on the NW small-world network, BA scale-free network, hypernetwork, and Facebook network. The first three networks are constructed through algorithms, while the Facebook network is from a public dataset (Stanford large network dataset collection ego-Facebook [EB/OL]. http://snap.stanford.edu/data/ego-Facebook.html (accessed on 1 December 2023)). The parameters for each network are provided in Table 2.
The NW small-world network consists of 1000 nodes, having an average degree of 8.9460 and a rewiring probability of 0.3. The network’s degree distribution follows a Poisson distribution. The BA scale-free network is initially set up with 500 nodes. Following the preferential attachment rule, new nodes are continuously added, increasing the total to 1000 nodes, having an average degree of 17.1000, and its degree distribution follows a power-law distribution. The hypernetwork, which accounts for group relationships, includes 1000 nodes, having an average degree of 20.6180, and its degree distribution follows a power law. The degree distribution of the Facebook network follows a power law, showing characteristics of small-world networks, scale-free networks, and hypernetworks.

5.2. Experimental Design

This paper uses the Monte Carlo (MC) method to compare information propagation across different networks. The basic settings are as follows:
(1)
The data for nodes and edges in each network are shown in Table 2.
(2)
Each network undergoes 1000 independent experiments, and the final results are taken as the average of the experimental outcomes.
(3)
N represents the total number of network nodes, and the initial number of information sources is set as 0.1 % of the total nodes, rounded up if not divisible.
(4)
Model parameter settings. The infection and recovery probabilities in the SIS model are 0.7 and 0.3, respectively. The infection and recovery probabilities in the SIR model are 0.7 and 0.3, respectively. The latency, infection, and recovery probabilities in the SEIR model are 0.3, 0.7, and 0.3, respectively. The experimental parameters for the SCWIR model are as follows: α 1 = 0.2 , α 2 = 0.2 , α 3 = 0.5 , α 4 = 0.1 , β 1 = 0.3 , β 2 = 0.6 , β 3 = 0.1 , γ 1 = 0.4 , γ 2 = 0.2 , γ 3 = 0.4 , σ 1 = 0.7 , σ 2 = 0.3 , l 0 = 1.0 .
(5)
All experiments in this paper were conducted using the MATLAB programming tool, version MATLAB R2018a.

5.3. Visualization of the Propagation Process

This section visualizes the simulation process of the SCWIR model and analyzes its propagation dynamics.
As shown in Figure 4, at the initial stage, the network contains a small number of rumor sources. These source nodes propagate the rumor, influencing their adjacent nodes and indirectly affecting other nodes. At t = 6 , a large number of spreading nodes and neutral waiting nodes appear in the network, indicating that the rumor has gained significant attention. During this stage, commenters further propagate the rumor and may transition into spreaders. At t = 15 , the intensity of the rumor decreases due to the decay in information value. Some users become immune to the rumor, while others, after gaining awareness, return to a neutral state to observe the situation. In the later stages, public opinion stabilizes, and most users lose interest in the rumor. From the figure, we can see that the stage from t = 6 to t = 15 is the phase of rapid rumor decay. During this period, rumors are suppressed due to debunking by authoritative organizations, and the decay of the rumor’s informational value also causes it to lose its ability to spread. In the experiment, we will analyze the factors contributing to the rapid decay of rumors and seek optimal control strategies.

5.4. Comparison of Models

In this subsection, we simulate 60 h of rumor propagation for each model on the Facebook network and provide a comparative analysis.
The experiment randomly selects 0.1 % of the nodes as the initial spreaders, with all other nodes remaining in the susceptible (S) state. As shown in Figure 5, the SIS model classifies participants in rumor propagation into simple categories, with only susceptibles and spreaders. In this model, over 90 % of users spread rumors, which does not align with reality.The SIR model considers users’ permanent immunity to rumors but ignores the possibility of short-term immunity. Once users gain awareness, they immediately exit rumor propagation. The SEIR model includes a hidden state where users receive but do not spread information, more accurately representing the neutral waiting state of users. However, it inadequately considers transitional phases in state changes and still assumes that users exit rumor propagation permanently upon gaining awareness, neglecting the possibility of re-belief in the rumor. The SCWIR model thoroughly accounts for multiple waiting states where users observe the development of events after being exposed to rumors. It also includes short-term immunity behaviors, where users gain awareness after initially believing the rumor and temporarily adopt a neutral waiting stance.

5.5. Impact of Different Network Structures

Rumor propagation effects vary across different network structures. In this subsection, we compare the experimental results of the SCWIR model across different network structures. As shown in Figure 6, in the NW network, users influence only their neighboring nodes, leading to slower rumor diffusion and a later peak in the number of spreaders. After initially encountering the rumor, some users choose to wait and observe; as the number of commenters and spreaders steadily declines, some easily swayed users choose to wait again, increasing the number of observers. In the BA network, there are ’hub’ nodes, and changes in their state significantly impact user stances. When a ’hub’ node spreads a rumor, its supporters rapidly disseminate it, leading to a sharp increase in the number of spreaders and an earlier peak. When a ’hub’ node awakens and switches to the immune state, its followers become observers. In the super network, the group relationships facilitate faster rumor propagation, leading to a higher peak in the number of spreaders, with the peak occurring earlier. The Facebook network, which combines characteristics of small-world, scale-free, and super networks, produces smoother experimental results and more reasonable predictions for the spreaders.

5.6. Parameter Sensitivity Analysis

In this subsection, we conduct a sensitivity analysis of the model parameters. Except for the parameters shown in the figure, the remaining parameters are set according to the experimental design section. The experimental results are shown in Figure 7. In Figure 7a, when the probability α 3 is relatively large, the peak of rumor propagation is higher. When the probability α 4 is large, the rumor propagation intensity is very low. This indicates that to suppress rumors, we need to reduce the probability of users spreading and commenting on rumors and increase the probability of users’ immunity to rumors, with particular focus on controlling the propagation probability α 3 . In Figure 7b, it shows that the probability β 2 of users who participate in commenting on the rumor further spreading the rumor is a key factor contributing to the increase in the peak of rumor propagation. From Figure 7c, we observe that when the probability γ 2 of bystanders becoming immune to rumors is low, rumor propagation becomes more severe. Therefore, to reduce the impact, we need to decrease the probability of bystanders re-engaging in the rumor event, thus increasing γ 2 . In Figure 7d, σ 2 represents the probability that propagating users lose interest in the rumor. When σ 2 is large, the scope of rumor propagation is smaller. In conclusion, to effectively control rumors, strategies should be implemented to reduce the propagation probabilities α 3 and β 2 and the bystander probability σ 1 while increasing the immunity probabilities α 4 and σ 2 . The sensitivity analysis of the parameters related to influencing factors will be provided later in the text.

5.7. The Influence of Various Factors

5.7.1. Information Timeliness

The decay in rumor value diminishes the focus given to it. As shown in Figure 8, when the information decay coefficient λ = 0.1 , the peak number of spreaders is higher, while at λ = 0.3 , the peak number of spreaders is lower, indicating that the quicker the decay of rumor value, the less popular the rumor becomes. At λ = 0.3 , the number of commenters slightly increases, suggesting that when the rumor’s information value decays quickly, people are more inclined to comment on the rumor. At λ = 0.3 , the number of observers is lower, indicating that fewer users choose to wait for the situation to develop when the rumor’s popularity is low. Additionally, the number of susceptibles not exposed to rumor is higher at λ = 0.3 , as users quickly lose interest in the rumor when its information value decays rapidly, leading to fewer users spreading the rumor. Some susceptible individuals remain unaffected by the rumor, and its spread is limited. As shown in Figure 9, the greater the information decay coefficient, the faster the information value decays, the lower the peak number of spreaders, and the slower the increase in the number of spreaders.

5.7.2. Government Intervention

Government debunking can guide users to resist rumors, curb rumor spread, and restore the public opinion environment more quickly. As shown in Figure 10b, when intervention occurs at t = 5 with a debunking intensity μ = 5 , it can be observed that, at the beginning of the intervention, the number of spreaders declines sharply. After debunking, the wait-and-see group spreads the debunking information to their adjacent nodes, and the believing group quickly becomes active, leading to a swift decline in the number of spreaders and commenters. Some hesitant users turn into wait-and-see individuals, increasing the number of observers. The recovery time for the public opinion environment is advanced. When the debunking intensity is increased to μ = 8 and debunking starts at t = 5 , the number of believers decreases faster, and the public opinion environment recovers more quickly. Timely debunking by the government prevents the believing group from spreading rumors, controlling the spread range, and preventing some susceptible individuals from being exposed to the rumors. In Figure 10d, when the debunking time t = 2 and the debunking intensity μ = 8 , only a small number of users are exposed to the rumors, and most users are directly immune to the rumors. Moreover, more susceptible individuals are not exposed to the rumors. As shown in Figure 11, when the debunking time is set at t = 5 , a higher debunking intensity leads to a lower peak number of spreaders. When the debunking intensity μ = 3 , the earlier the debunking time, the lower the peak number of spreaders.

5.7.3. Information Popularization Rate

Positive information related to rumor debunking can help users develop immunity, providing a certain level of prevention against rumor spread. As shown in Figure 12, when the information education rate reaches 25 % , 25 % of users become immune to rumors, reducing the susceptible user count to 75 % , thereby minimizing the rumor’s impact. The number of propagators, commenters, and observers decreases, effectively controlling the rumor spread. Some susceptibles do not come into contact with the rumor. As shown in Figure 13, the larger the scope of information popularization, the smaller the number of rumor spreaders.

5.7.4. Influence of Multiple Factors

By adopting multiple suppression strategies, the spread of rumors can be more effectively controlled. As shown in Figure 14a, introducing government debunking with a debunking strength of μ = 5 and a debunking time of t = 5 , while accelerating the information value decay with a decay coefficient λ = 0.3 , allows the rumor-believing population to wake up in time, and the number of immune individuals increases rapidly, accompanied by a rise in the number of observers. In Figure 14b, combining government debunking with information education, with an initial immune population ratio of R ( 0 ) = η = 0.25 , the rumor’s impact scope is reduced, leading to an increase in the number of susceptible individuals not exposed to the rumor, while the number of propagators decreases. Figure 14c shows that when educational information is provided and the decay of information value is accelerated, the population changes remain relatively stable and there is a certain level of suppression. However, compared to the government’s forced intervention, the rumor’s spread cycle is longer, and the spread is wider, with a less ideal suppression effect, highlighting the decisive role of government intervention. In Figure 14d, when all three factors are introduced, only 10.73 % of individuals are affected by the rumor, 32.42 % of susceptible individuals remain unexposed to the rumor, and the number of immune individuals increases rapidly, showing significant suppression of the rumor.

5.8. Data Comparison

To validate the model’s effectiveness, we compare the simulation results with real data. A public dataset [18] containing 68,625 reposts was selected as the rumor case data. We compare the simulation results of the SIR [7], SEIR [8], SEIRD [9], ISR-WV [18], and SCWIR models with the forwarding data for analysis.
As shown in Figure 15, the SIR model has a simple user classification, but it overlooks the middle stages of rumor propagation, making its prediction of the rumor’s intensity too high. The SEIR model predicts the rumor dissipates too early, presenting an overly idealized view of its spread. The SEIRD model, which takes into account the heavy believers and the lag in rumor propagation, introduces the characteristic of delay in rumor dissipation, but it overlooks the fact that rumors disappear quickly once they lose attention, leading to a slower dissipation prediction. The ISR-WV model, considering multi-channel communication, allows more opportunities for users to spread and debunk rumors, offering a better simulation of rumor transmission, although it tends to be conservative in predicting peak propagation. The SCWIR model proposed in this paper, by considering users’ multiple waiting phases and information timeliness, successfully models the delayed dissipation of rumors. The multiple waiting mechanism captures the herd mentality of users, better fitting the rumor propagation data. Ultimately, due to the effect of information timeliness, the model avoids the issue of prolonged rumor persistence. To quantitatively analyze the model’s fitting performance, we computed the Root Mean Square Error (RMSE), Pearson correlation coefficient, and cosine similarity between the predicted forwarding results of each model and the actual forwarding data. As shown in Table 3, the introduction of multiple waiting mechanisms and information timeliness allows for a better simulation of users’ waiting and observing behaviors in rumor propagation. It also avoids the issue of overly prolonged rumor persistence in the simulation. Therefore, the mechanisms proposed in our model are both effective and reasonable.

6. Conclusions

This paper aims to study rumor propagation. Addressing the issues of missing intermediate transition phases and neglecting the repetitiveness of rumors in existing rumor propagation models, it proposes a new SCWIR rumor propagation model. By considering users’ repeated waiting behaviors, the model simulates the potential dormancy and subsequent resurgence of rumors. It accounts for the possibility of individuals who spread rumors becoming temporarily dormant and then active again, as well as the short-term observation and waiting phase that easily swayed individuals might enter. This paper presents the dynamic equations of the model and, by solving the model’s equilibrium points and basic reproduction number, discusses the local and global stability of the rumor-free and rumor equilibrium points. Finally, numerical simulations analyze the impact of different factors on rumor propagation. The results show that the introduction of a repeated waiting mechanism helps simulate the repetitiveness of rumor propagation. Among rumor suppression strategies, the suppression effects rank from highest to lowest as government intervention, science popularization, and accelerating the decay of rumor value, with government intervention playing a decisive role. Science popularization can reduce the initial heat of rumors at the source. In future work, we will explore the content of rumors, analyze user sentiment, and investigate more effective rumor control strategies.

Author Contributions

H.W.: Proof of theory, experiment, writing. X.Y.: Supervision, writing guidance. S.G.: Funding, review. Z.D. and H.C.: Review manuscripts and provide suggestions. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Yunnan high-tech industry development project (Grant No. 201606), Yunnan provincial major science and technology special plan projects (Grant No. 202103AA080015, 202002AD080001-5), Yunnan Basic Research Project (Grant No. 202001AS070014), and the Talents and Platform Program of Science and Technology of Yunnan (Grant No. 202105AC160018).

Data Availability Statement

The relevant network data can be accessed through the Stanford Large Network Dataset Collection ego-Facebook [EB/OL]. http://snap.stanford.edu/data/ego-Facebook.html.

Acknowledgments

Thanks to the National Natural Science Foundation of Kunming University of Science and Technology for their support.

Conflicts of Interest

All authors declare no conflicts of interest in this paper.

References

  1. Zhu, H.; Yang, X.; Wei, J. Path prediction of information diffusion based on a topic-oriented relationship strength network. Inf. Sci. 2023, 631, 108–119. [Google Scholar] [CrossRef]
  2. Li, W.; Wei, D.; Zhou, X.; Li, S.; Jin, Q. F-SWIR: Rumor Fick-spreading model considering fusion information decay in social networks. Concurr. Comput. Pract. Exp. 2022, 34, e7166. [Google Scholar] [CrossRef]
  3. Yao, Y.; Xiao, X.; Zhang, C.; Dou, C.; Xia, S. Stability analysis of an SDILR model based on rumor recurrence on social media. Phys. A Stat. Mech. Its Appl. 2019, 535, 122236. [Google Scholar] [CrossRef]
  4. Xu, H.; Li, T.; Liu, X.; Liu, W.; Dong, J. Spreading dynamics of an online social rumor model with psychological factors on scale-free networks. Phys. A Stat. Mech. Its Appl. 2019, 525, 234–246. [Google Scholar] [CrossRef]
  5. Zhu, L.; Zheng, W.; Shen, S. Dynamical analysis of a SI epidemic-like propagation model with non-smooth control. Chaos Solitons Fract. 2023, 169, 113273. [Google Scholar] [CrossRef]
  6. Zhu, L.; Yang, F.; Guan, G.; Zhang, Z. Modeling the dynamics of rumor diffusion over complex networks. Inf. Sci. 2021, 562, 240–258. [Google Scholar] [CrossRef]
  7. Ma, X.; Shen, S.; Zhu, L. Complex dynamic analysis of a reaction-diffusion network information propagation model with non-smooth control. Inf. Sci. 2023, 622, 1141–1161. [Google Scholar] [CrossRef]
  8. Wang, C.; Yang, X.; Xu, K.; Ma, J. SEIR-based model for the information spreading over SNS. Acta Electron. Sin. 2014, 11, 2325–2330. [Google Scholar]
  9. Wang, W.; Wang, H.; Yuan, M.; Luo, X.; Li, J. Time-lag rumor propagation model and rumor-refuting strategy of SEIRD under COVID-19. Chin. J. Eng. 2022, 44, 1080–1089. [Google Scholar]
  10. Zhang, Z.; Fang, A.; Cui, L.; Pan, Z.; Zhang, W.; Tan, C.; Wang, C. Towards exploring the influence of community structures on information dissemination in Sina Weibo networks. Discret. Dyn. Nat. Soc. 2021, 2021, 8325302. [Google Scholar] [CrossRef]
  11. Zheng, P.; Huang, Z.; Dou, Y.; Yan, Y. Rumor detection on social media through mining the social circles with high homogeneity. Inf. Sci. 2023, 642, 119083. [Google Scholar] [CrossRef]
  12. Hou, Y.; Meng, F.; Wang, J.; Guan, M.; Zhang, H. Research on competitive public opinion information dissemination model in online social networks considering group structure. Appl. Res. Comput. 2022, 39, 1054–1059. [Google Scholar]
  13. Wang, J.; Wang, Z.; Yu, P.; Xu, Z. The impact of different strategy update mechanisms on information dissemination under hyper network vision. Commun. Nonlinear Sci. Numer. Simul. 2022, 113, 106585. [Google Scholar] [CrossRef]
  14. Zhang, Q.; Li, X.; Du, Y.; Zhu, J. Dynamical analysis of an SE2IR information propagation model in social networks. Discret. Dyn. Nat. Soc. 2021, 2021, 5615096. [Google Scholar] [CrossRef]
  15. Markovich, N.M.; Ryzhov, M.S. Leader Nodes in Communities for Information Spreading. In International Conference on Distributed Computer and Communication Networks; Springer: Cham, Swizerland, 2020; pp. 475–484. [Google Scholar]
  16. Nie, Y.; Pan, L.; Lin, T.; Wang, W. Information spreading on metapopulation networks with heterogeneous contacting. Int. J. Mod. Phys. C 2022, 33, 2250031. [Google Scholar] [CrossRef]
  17. Gong, Y.C.; Wang, M.; Liang, W.; Hu, F.; Zhang, Z.K. UHIR: An effective information dissemination model of online social hypernetworks based on user and information attributes. Inf. Sci. 2023, 644, 119284. [Google Scholar] [CrossRef]
  18. Dong, Y.; Xie, X.; Li, M. An improved ISR-WV rumor propagation model based on multichannels with time delay and pulse vaccination. Chin. Phys. B 2023, 32, 070205. [Google Scholar] [CrossRef]
  19. Liu, Y.; Zhang, P.; Shi, L.; Gong, J. A Survey of Information Dissemination Model, Datasets, and Insight. Mathematics 2023, 11, 3707. [Google Scholar] [CrossRef]
  20. Gao, Y.; Kuang, P. Information propagation based on information value. In Proceedings of the 2021 International Conference on Culture-Oriented Science and Technology (ICCST), Beijing, China, 18–21 November 2021; pp. 310–315. [Google Scholar]
  21. Driessche, V.d.P.; Watmough, J. Reproduction numbers and sub-threshold endemic equilibria for compartmental models of disease transmission. Math. Biosci. 2002, 180, 29–48. [Google Scholar] [CrossRef]
Figure 1. SEIR rumor propagation model.
Figure 1. SEIR rumor propagation model.
Mathematics 13 00312 g001
Figure 2. SCWIR rumor propagation model.
Figure 2. SCWIR rumor propagation model.
Mathematics 13 00312 g002
Figure 3. The improved SCWIR model.
Figure 3. The improved SCWIR model.
Mathematics 13 00312 g003
Figure 4. Visualization of the propagation process.
Figure 4. Visualization of the propagation process.
Mathematics 13 00312 g004
Figure 5. Comparison of models. t represents the time, and p represents the proportion of individuals. (d) The non-intervened SCWIR model differs little from the SEIR model, as it merely reorganizes the member structure, confirming the validity of the multiple waiting mechanism.
Figure 5. Comparison of models. t represents the time, and p represents the proportion of individuals. (d) The non-intervened SCWIR model differs little from the SEIR model, as it merely reorganizes the member structure, confirming the validity of the multiple waiting mechanism.
Mathematics 13 00312 g005
Figure 6. SCWIR model under different networks.
Figure 6. SCWIR model under different networks.
Mathematics 13 00312 g006
Figure 7. Rumor propagation results under different model parameters.
Figure 7. Rumor propagation results under different model parameters.
Mathematics 13 00312 g007
Figure 8. SCWIR model under different information timeliness levels.
Figure 8. SCWIR model under different information timeliness levels.
Mathematics 13 00312 g008
Figure 9. The change in the number of spreaders (I) under different information decay coefficients.
Figure 9. The change in the number of spreaders (I) under different information decay coefficients.
Mathematics 13 00312 g009
Figure 10. SCWIR model with varying levels of government intervention.
Figure 10. SCWIR model with varying levels of government intervention.
Mathematics 13 00312 g010
Figure 11. Changes in the number of spreaders (I) under different debunking intensities and debunking times.
Figure 11. Changes in the number of spreaders (I) under different debunking intensities and debunking times.
Mathematics 13 00312 g011
Figure 12. SCWIR model with varying information popularization rates.
Figure 12. SCWIR model with varying information popularization rates.
Mathematics 13 00312 g012
Figure 13. The change in the number of spreaders (I) under different information popularization rates.
Figure 13. The change in the number of spreaders (I) under different information popularization rates.
Mathematics 13 00312 g013
Figure 14. SCWIR model under the influence of multiple factors.
Figure 14. SCWIR model under the influence of multiple factors.
Mathematics 13 00312 g014
Figure 15. True data and simulation results of various models.
Figure 15. True data and simulation results of various models.
Mathematics 13 00312 g015
Table 1. Parameters definitions of the SCWIR model.
Table 1. Parameters definitions of the SCWIR model.
ParameterDefinition
α 1 Probability of susceptible users engaging in comments.
α 2 Probability of susceptible users adopting a wait-and-see approach.
α 3 Probability of susceptibles spreading
α 4 Probability of susceptibles being immune to the rumor.
β 1 Probability of commenters adopting a wait-and-see approach.
β 3 Probability of commenters spreading the rumor.
β 4 Probability of commenters becoming immune.
γ 1 Probability of waiting individuals engaging in comments.
γ 2 Probability of waiting individuals recovering or becoming immune.
γ 3 Probability of waiting individuals spreading the rumor.
σ 1 Probability of spreaders adopting a wait-and-see approach.
σ 2 Probability of spreaders recovering or becoming immune.
Table 2. Network parameters.
Table 2. Network parameters.
NetworksNWBAHypernetworkFacebook
Nodes1000100010004039
Edges4473855010,31388,234
Average degree8.946017.100020.618043.6910
Clustering factor0.52780.55600.82520.6055
Table 3. Forward prediction experiment comparison results.
Table 3. Forward prediction experiment comparison results.
Model∖IndexRMSEPearson Correlation CoefficientCosine Similarity
SIR0.07630.85010.8065
SEIR0.07540.85930.8172
SEIRD0.07440.86370.8321
ISR-WV0.07310.87110.8695
SCWIR0.06880.89970.8812
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Wu, H.; Yan, X.; Gao, S.; Deng, Z.; Chi, H. Analysis and Control of Rumor Propagation Model Considering Multiple Waiting Phases. Mathematics 2025, 13, 312. https://doi.org/10.3390/math13020312

AMA Style

Wu H, Yan X, Gao S, Deng Z, Chi H. Analysis and Control of Rumor Propagation Model Considering Multiple Waiting Phases. Mathematics. 2025; 13(2):312. https://doi.org/10.3390/math13020312

Chicago/Turabian Style

Wu, Hai, Xin Yan, Shengxiang Gao, Zhongying Deng, and Haiyang Chi. 2025. "Analysis and Control of Rumor Propagation Model Considering Multiple Waiting Phases" Mathematics 13, no. 2: 312. https://doi.org/10.3390/math13020312

APA Style

Wu, H., Yan, X., Gao, S., Deng, Z., & Chi, H. (2025). Analysis and Control of Rumor Propagation Model Considering Multiple Waiting Phases. Mathematics, 13(2), 312. https://doi.org/10.3390/math13020312

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop