Next Article in Journal
The Solution of the Extended 16th Hilbert Problem for Some Classes of Piecewise Differential Systems
Previous Article in Journal
A Study on Determining the Optimal Feedback Rate in Distributed Block Diagonalization with Limited Feedback for Dense Cellular Networks
Previous Article in Special Issue
University Campus as a Complex Pedestrian Dynamic Network: A Case Study of Walkability Patterns at Texas Tech University
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Multi-Agent Collaborative Rumor-Debunking Strategies on Virtual-Real Network Layer

1
School of Mechanical and Electrical Engineering, Guangzhou University, Guangzhou 510006, China
2
School of Culture and Creativity, Beijing Normal University-Hong Kong Baptist University United International College, Zhuhai 519000, China
3
School of Public Administraion, Guangzhou University, Guangzhou 510006, China
4
School of Journalism and Communication, Guangzhou University, Guangzhou 510006, China
*
Authors to whom correspondence should be addressed.
Mathematics 2024, 12(3), 462; https://doi.org/10.3390/math12030462
Submission received: 15 December 2023 / Revised: 18 January 2024 / Accepted: 29 January 2024 / Published: 31 January 2024
(This article belongs to the Special Issue Dynamic Complex Networks: Models, Algorithms, and Applications)

Abstract

:
In the era of self-media, the spontaneity and anonymity of information dissemination have led to a surge in rumors, posing significant challenges to cybersecurity. This paper introduces a novel dual-layer V R S H I 1 I 2 R rumor control model for studying collaborative rumor-debunking efforts. Utilizing mathematical modeling and simulation methods, we propose key thresholds for rumor propagation from both theoretical and simulation perspectives, and explore optimal methods for rumor control. Our model is validated with real data from actual cases, confirming its accuracy and the effectiveness. The study shows that without intervention, rumors will spread rapidly. Both constant and dynamically optimized control significantly slow down the spread of rumors. However, dynamic optimization control significantly reduces control costs compared to fixed control schemes. Moreover, we find that controlling only the media layer is insufficient. These findings highlight the importance of meticulous approaches to rumor control in the digital age.

1. Introduction

A rumor is unverified information circulated across communication channels, impacting areas such as epidemic prevention, public policy, social events, medical health, and natural phenomena. In today’s ‘self-media era’, rumor dissemination is faster and more extensive, amplifying its societal harm. Rumor spread can have adverse effects on the online environment and social stability and erode trust in traditional media and government institutions. Effective control of rumors is of paramount importance.
Research on rumor spread predominantly employs mathematical modeling. The study of rumor propagation models can be categorized into three stages: classical offline interpersonal network models, social network models incorporating various influencing factors, and heterogeneous models that integrate network structure and contextual factors.
Classical offline interpersonal network models draw inspiration from epidemic disease spreading due to similarities in mechanisms and dissemination objects [1]. Notable models such as DK [2] and MT [3] have been widely applied to predict rumor spread in small-scale social networks characterized by word-of-mouth communication, laying the theoretical foundation for subsequent rumor propagation models. Regarding social network models that account for diverse influencing factors, researchers have developed isomorphic models from various perspectives. These models consider elements like opinion leaders, repetitive retweeting behaviors [4,5], public biases [6], user experiences [7], multilingual contexts [8], and uncertain propagation environments [9,10] to analyze critical nodes and pathways. In the realm of heterogeneous network rumor propagation models, researchers have devised models that account for the diverse nature of social networks. For instance, Shioda et al. [11] explored the specific effects of strong information correlation on the Twitter platform, while Zhao et al. [12] introduced a novel S E I R rumor propagation model based on scale-free networks.
The inhibitory effect of media on rumor spreading cannot be ignored, Zhao et al. [13] specifically studied the effect of positive and negative media reports on rumor spreading, and they established a new class of S I R rumor-spreading model. In addition, rumor screening and anti-rumor behaviors of the public have also been studied. Xiao et al. [14] proposed a rumor propagation dynamics model based on evolutionary games and anti-rumor information, proving that rumors are not only influenced by anti-rumor information but also by user behaviors and psychological factors. Zhu et al. [15] established a reaction–diffusion rumor propagation model by considering a non-smooth control function to reflect government and media refutation of rumor propagation. Pan et al. [16] comprehensively considered population- and media-debunking mechanisms and established a class of S I D R W rumor propagation model. Zhong et al. [17] similarly considered the population’s refutation behavior of rumor and designed a randomized sedation scheme to suppress rumor propagation. The above models gradually improve the research on rumor propagation in social networks, and to a certain extent, reflect the propagation characteristics of public opinion information, as well as the process of public opinion propagation under external intervention or considering the influence of a person’s own psychology and behavior. The above models have studied the dynamics of rumors from the perspective of public refutation or media rumor debunking alone, but the responses of the public and media to rumors are two-sided, and the two are coupled with each other and work together. However, there is no rumor propagation model that integrates public refutation and media behavior.
Many articles have discussed optimal control [18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33], with Ding, Li, et al. [20] establishing the Controlled Rumor–Truth Spreading Model, which considers the isolation of rumor spreaders and the effects of time. They used the variational method to obtain optimal control quantities and conducted simulations. Conversely, Xupeng Luo, Haijun Jiang, et al. [30] considered the multilingual environment and intervention mechanism, establishing the I2SR rumor propagation model. They obtained optimal control conditions using Pontryagin’s minimum principle. However, none of the above-mentioned articles fully consider media control.
Few works consider the role of the media in guiding the spread of rumors, let alone simultaneously considering the public’s refutation behavior of rumors. Therefore, this paper focuses on the coupled propagation between a virtual layer with media intervention and a social network layer that incorporates public refutation. The main contributions of this paper are as follows:
  • A two-layer V R S H I 1 I 2 R rumor propagation model under the coupling of virtual and real layers is established by comprehensively considering the propagation and clarification of rumors by the media and the propagation and refutation of rumors by the public;
  • We analyze the dynamic behavior of the control model and propose optimal control schemes. Theoretical proofs demonstrate the existence and stability of equilibrium points in the model, along with the expression for the optimal control strategy;
  • Based on real case data, we verify the accuracy of the model and the effectiveness of the collaborative control strategy through simulation experiments. By comparing experimental data, we demonstrate that the cost under the collaborative rumor debunking strategy is significantly lower than that under a single control strategy.
The rest of the paper is organized as follows. Section 2 deals with the modeling and preparation. The establishment of equilibrium points and their stability analysis are studied in Section 3. The optimal control of the model is given in Section 4. In Section 5, the simulation analysis of the model in conjunction with a real case is given.

2. Model Formulation

In the modern era, a large number of social groups acting as media join in the spread of rumors, and their guiding effect is extremely obvious. As the main body of rumor dissemination, a person’s subjective judgment on rumors also has a great influence on rumor dissemination. Considering the above factors, a virtual reality two-layer rumor propagation model is established, where the virtual layer (V) denotes the network constructed by media such as virtual online social network platforms like Facebook, TikTok, etc., which spreads or clarifies the rumors through the form of articles, videos, etc., and the real layer (R) denotes the social network constructed by real human beings, such as friends, family members, colleagues, etc., through language, text messages, etc., which is used to share or refute rumors.

2.1. Establishment of the Virtual Layer (V)

The media in the virtual layer (V) are classified into three types, namely, silent media M 1 (Silent Media), which denotes unpublished media related to the event, rumor-spreading media M 2 (Rumor-spreading Media), which denotes media that spreads rumor-related opinions, and rumor-refuting media M 3 (Rumor-refuting Media), which denotes media that spreads rumor-refuting media. At a certain moment, each type of media may be in one of the above three states, and the specific transition relationship is shown in Figure 1.
Next, we provide a detailed description of the specific dissemination process of the V-layer and its corresponding parameters. First of all, each individual or section of the public can create independently and thus have the nature of media, or can stop creating and withdraw from the dissemination platform. Therefore, there are always inputs and outputs in the V-layer, and we assume that newly registered media enter the V-layer with probability Λ 1 , and existing media exit the V-layer with probability μ 1 . Secondly, the media can not identify the truth of a rumor on first learning about it, so there are two possible transformation states: rumor spreading and rumor refuting. Therefore, we assume that silent media transform into rumor-refuting media with probability ψ 1 , and transform into rumor-spreading media with probability ψ 2 . In addition, rumor-spreading media may change their viewpoints under the influence of positive information from rumor-refuting media, and we assume that the conversion rate is ψ 3 .

2.2. Establishment of the Real Layer (R)

The sections of the public in the Reality (R) layer are classified into five types, namely, Unknowns S (Suspicious), a section of the public that indicates susceptibility to unknown rumors, Information Disseminators H (Hesitate), a section of the public that indicates known information and disseminates information directly without thinking, Rumor Spreaders I 1 (Infective), a section of the public that indicates known information and spreads rumors with a negative attitude, Rumor Debunkers I 2 (Independent), a section of the public that indicates that information is known and spreads disinformation in a positive manner, and Silent R (Reticent), a section of the public that expresses a loss of interest in a topic and no longer makes relevant statements. At a certain moment, each section of the public may be in one of the above five states, and the specific transformation relationship is shown in Figure 2.
Next, we give a detailed description of the specific propagation process of the R layer and its corresponding parameters. Firstly, because the subjective judgment of human beings and the degree of interest in the event will be changed by external influences, the sections of the public will change dynamically over time. Therefore, there are inputs and outputs in the R layer at all times, and we assume that the newly joined unknowns enter the R layer with probability Λ 2 and the already existing sections of the public exit the system with probability μ 2 . Secondly, most rumors do not have the nature of rumors when they are initially spread, but are spread only as information. Therefore, we assume that the unknowns, when exposed to the information, may either disseminate the information directly without thinking or remain silent because they are not interested in the information. Therefore, we assume that the probability that the unknowns will be transformed into information disseminators is α 1 and the probability that they will be transformed into silencers is α 2 . In addition, information disseminators may develop a deterministic attitude towards information after being influenced by rumors spreading in real social networks. Therefore, we assume that the probability that a information disseminator will transform into a rumor spreader is β 1 , the probability that he/she will transform into a rumor debunker is β 3 , and the probability that he/she will transform into a silencer is β 2 . Finally, rumor spreaders may change their negative attitudes or lose interest in rumors over time or for their own reasons after being positively influenced by rumor debunkers in real social networks. Therefore, we assume that the probability of a rumor spreader changing to a rumor debunker is φ 2 and the probability of changing to a silencer is φ 1 .

2.3. The Coupling between the Virtual Layer and Real Layer

Based on the above propagation criteria, the following kinetic equations for this V R S H I 1 I 2 R model are obtained:
d M 1 ( t ) d t = Λ 1 ( δ 1 I 1 ( t ) + ψ 1 M 3 ( t ) + ψ 2 M 2 ( t ) + δ 2 I 2 ( t ) + μ 1 ) M 1 ( t ) , d M 2 ( t ) d t = δ 1 M 1 ( t ) I 1 ( t ) + ( ψ 2 M 1 ( t ) ψ 3 M 3 ( t ) δ 3 I 2 ( t ) μ 1 ) M 2 ( t ) , d M 3 ( t ) d t = δ 2 M 1 ( t ) I 2 ( t ) + δ 3 M 2 ( t ) I 2 ( t ) + ( ψ 1 M 1 ( t ) + ψ 3 M 2 ( t ) μ 1 ) M 3 ( t ) , d S ( t ) d t = Λ 2 ( α 1 H ( t ) + α 2 + η 3 M 3 ( t ) + μ 2 ) S ( t ) , d H ( t ) d t = ( α 1 S ( t ) θ M 2 ( t ) η 1 M 3 ( t ) β 1 I 1 ( t ) β 2 β 3 I 2 ( t ) μ 2 ) H ( t ) , d I 1 ( t ) d t = θ H ( t ) M 2 ( t ) + ( β 1 H ( t ) η 2 M 3 ( t ) φ 2 I 2 ( t ) φ 1 μ 2 ) I 1 ( t ) , d I 2 ( t ) d t = β 3 H ( t ) I 2 ( t ) + φ 2 I 1 ( t ) I 2 ( t ) μ 2 I 2 ( t ) , d R ( t ) d t = α 2 S ( t ) + β 2 H ( t ) + φ 1 I 1 ( t ) + ( η 1 H ( t ) + η 2 I 1 ( t ) + η 3 S ( t ) ) M 3 ( t ) μ 2 R ( t ) .
The specific transformational relationships of the model are shown in Figure 3.
Based on the above analysis, the state transitions in social networks under virtual reality are obtained. The parameters in the model and the meanings of their representations are shown in Table 1.
Remark 1.
In Dong et al. [18], a two-layer X Y Z I S R model of rumor propagation considering media intervention was developed. The difference between the model developed in this paper and [18] is that the role of public refutation is also considered, which makes the developed model more complex but more practical.
The initial values of the model satisfy: M 1 ( t ) 0 M 2 ( t ) 0 M 3 ( t ) 0 S 0 , H 0 I 1 ( t ) 0 I 2 ( t ) 0 R 0
Let
N 1 ( t ) = M 1 ( t ) + M 2 ( t ) + M 3 ( t ) .
From model (1) and Equation (2), we can obtain:
d N 1 ( t ) d t = d M 1 ( t ) d t + d M 2 ( t ) d t + d M 3 ( t ) d t = Λ 1 μ 1 N 1 ( t ) .
And: lim t N 1 ( t ) = Λ 1 μ 1 .
Let
N 2 ( t ) = S ( t ) + H ( t ) + I 1 ( t ) + I 2 ( t ) + R ( t ) .
From model (1) and Equation (4), we can obtain:
d N 2 ( t ) d t = d S ( t ) d t + d H ( t ) d t + d I 1 ( t ) d t + d I 2 ( t ) d t + d R ( t ) d t = Λ 2 μ 2 N 2 ( t ) .
And: lim t N 2 ( t ) = Λ 2 μ 2 .
Therefore, the dynamics of the model will be discussed in the following areas: Ω = M 1 ( t ) , M 2 ( t ) , M 3 ( t ) , S ( t ) , H ( t ) , I 1 ( t ) , l 2 ( t ) , R ( t ) R + M 1 ( t ) + M 2 ( t ) + M 3 ( t ) Λ 1 μ 1 , S ( t ) + H ( t ) + I 1 ( t ) + I 2 ( t ) + R ( t ) Λ 2 μ 2 } .

3. Dynamic Analysis

In this section, we analyze the existence and stability of equilibrium points to understand the impact of collaborative rumor-debunking strategies on the dynamics of multiple rumor propagation.

3.1. Existence of Equilibrium Points

In order to calculate the equilibrium points of model (1), we need to solve the following system of equations,
Λ 1 ( δ 1 I 1 ( t ) + ψ 1 M 3 ( t ) + ψ 2 M 2 ( t ) + δ 2 I 2 ( t ) + μ 1 ) M 1 ( t ) = 0 , δ 1 M 1 ( t ) I 1 ( t ) + ( ψ 2 M 1 ( t ) ψ 3 M 3 ( t ) δ 3 I 2 ( t ) μ 1 ) M 2 ( t ) = 0 , δ 2 M 1 ( t ) I 2 ( t ) + δ 3 M 2 ( t ) I 2 ( t ) + ( ψ 1 M 1 ( t ) + ψ 3 M 2 ( t ) μ 1 ) M 3 ( t ) = 0 , Λ 2 ( α 1 H ( t ) + α 2 + η 3 M 3 ( t ) + μ 2 ) S ( t ) = 0 , ( α 1 S ( t ) θ M 2 ( t ) η 1 M 3 ( t ) β 1 I 1 ( t ) β 2 β 3 I 2 ( t ) μ 2 ) H ( t ) = 0 , θ H ( t ) M 2 ( t ) + ( β 1 H ( t ) η 2 M 3 ( t ) φ 2 I 2 ( t ) φ 1 μ 2 ) I 1 ( t ) = 0 , ( β 3 H ( t ) + φ 2 I 1 ( t ) μ 2 ) I 2 ( t ) = 0 , α 2 S ( t ) + β 2 H ( t ) + φ 1 I 1 ( t ) + ( η 1 H ( t ) + η 2 I 1 ( t ) + η 3 S ( t ) ) M 3 ( t ) μ 2 R ( t ) = 0 .
Through calculating, model (1) exists five equilibrium points as follows:
(1)
E 0 = M 1 0 , 0 , 0 , S 0 , 0 , 0 , 0 , R 0 , M 1 0 = Λ 1 μ 1 , S 0 = Λ 2 μ 2 + α 2 , R 0 = α 2 Λ 2 μ 2 ( μ 2 + α 2 ) .
(2)
E 1 = M 1 1 , 0 , 0 , S 1 , H 1 , 0 , 0 , R 1 , M 1 1 = Λ 1 μ 1 , S 1 = β 2 + μ 2 α 1 , H 1 = α 1 Λ 2 α 2 β 2 μ 2 ( α 2 + β 2 + μ 2 ) α 1 ( β 2 + μ 2 ) , R 1 = α 2 β 2 α 1 + Λ 2 β 2 μ 2 ( β 2 + μ 2 ) .
(3)
E 2 = M 1 2 , 0 , M 3 2 , S 2 , 0 , 0 , 0 , R 2 , M 1 2 = μ 1 ψ 1 , M 3 2 = Λ 1 ψ 1 μ 1 2 μ 1 ψ 1 , S 2 = Λ 2 μ 1 ψ 1 η 3 Λ 1 ψ 1 μ 1 2 + μ 1 ψ 1 μ 2 + α 2 , R 2 = Λ 2 η 2 Λ 1 ψ 1 μ 1 2 + α 2 μ 1 ψ 1 η 2 η 3 Λ 1 ψ 1 μ 1 2 + μ 1 μ 2 ψ 1 μ 2 + α 2 .
(4)
E 3 = M 1 3 , 0 , M 3 3 , S 3 , H 3 , 0 , 0 , R 3 , M 1 3 = μ 1 ψ 1 , M 3 3 = Λ 1 ψ 1 μ 1 2 μ 1 ψ 1 , S 3 = μ 1 ψ 1 ( β 2 + μ 2 ) + η 1 ( Λ 1 ψ 1 μ 1 2 ) α 1 μ 1 ψ 1 , H 3 = Λ 2 μ 1 ψ 1 μ 1 ψ 1 ( β 2 + μ 2 ) + η 1 ( Λ 1 ψ 1 μ 1 2 ) μ 1 ψ 1 ( μ 2 + α 2 ) + η 3 ( Λ 1 ψ 1 μ 1 2 ) α 1 μ 1 ψ 1 , R 3 = ψ 1 μ 1 μ 2 ( α 2 β 2 ) + μ 2 ( η 3 η 1 ) Λ 1 ψ 1 μ 1 2 α 1 μ 1 μ 2 ψ 1 + Λ 2 β 2 μ 1 ψ 1 + η 1 Λ 2 ( Λ 1 ψ 1 μ 1 2 ) μ 1 μ 2 ψ 1 ( β 2 + μ 2 ) + η 1 μ 2 ( Λ 1 ψ 1 μ 1 2 ) .
(5)
E 4 = ( M 1 * , M 2 * , M 3 * , S * , H * , I 1 * , I 2 * , R * ) w h e r e M 1 * , M 2 * , M 3 * , S * , H * , I 1 * , I 2 * , R * > 0 .
Remark 2.
In comparison to rumor propagation models [4,5,8,12], our control model (1) has added three equilibrium points E 1 , E 2 , E 3 . In particular, the appearance of equilibrium point E 1 is caused by the hesitation mechanism, while the appearance of equilibrium points E 2 and E 3 is the result of the propagation and refutation of the the virtual layer.

3.2. Stability Analysis of Equilibrium Points

In model (1), it is evident that the equilibrium points E 0 , E 1 , E 2 , and E 3 are all points without rumor spreaders. Therefore, we can collectively refer to them as Rumor-Free Equilibrium Points (RFEP). By proving the stability of these Rumor-Free Equilibrium Points, we can assess the control effectiveness of collaborative debunking strategies.
Theorem 1.
The RFEP E 0 of model (1) is asymptotically stable for R 0 < 1 and unstable for R 0 > 1.
Proof. 
Due to the local stability of the RFEP, E 0 is related to the eigenvalues of the corresponding Jacobian matrix J( E 0 ), and the Jacobian matrix at the E 0 rumor-free equilibrium is as follows:
J ( E 0 ) = μ 1 ψ 2 Λ 1 μ 1 ψ 1 Λ 1 μ 1 0 0 δ 1 Λ 1 μ 1 δ 2 Λ 1 μ 1 0 0 ψ 2 Λ 1 μ 1 2 μ 1 0 0 0 δ 1 Λ 1 μ 4 0 0 0 0 ψ 1 Λ 2 μ 1 2 μ 1 0 0 0 δ 2 Λ 1 μ 1 0 0 0 η 3 Λ 2 μ 2 + α 2 α 2 μ 2 α 1 Λ 2 μ 2 + α 2 0 0 0 0 0 0 0 α 1 Λ 2 ( μ 2 + α 2 ) ( β 2 + μ 2 ) μ 2 + α 2 0 0 0 0 0 0 0 0 φ 1 μ 2 0 0 0 0 0 0 0 0 μ 2 0 0 0 η 3 Λ 2 μ 2 + α 2 α 2 β 2 φ 1 0 μ 2 .
By a simple calculation, the characteristic equation of J ( E 0 ) is obtained according to | λ E J ( E 0 ) |
( λ + μ 1 ) ( λ + μ 1 2 ψ 2 Λ 1 μ 1 ) ( λ + μ 1 2 ψ 1 Λ 1 μ 1 ) ( λ + α 2 + μ 2 ) ( λ + ( μ 2 + α 2 ) ( β 2 + μ 2 ) α 1 Λ 2 μ 2 + α 2 ) ( λ + φ 1 + μ 2 ) ( λ + μ 2 ) 2 = 0 .
The characteristic roots of the equation thus obtained are:
λ 01 = μ 1 , λ 02 = ψ 2 Λ 1 μ 1 2 μ 1 , λ 03 = ψ 1 Λ 1 μ 1 2 μ 1 , λ 04 = α 2 μ 2 , λ 05 = α 1 Λ 2 ( μ 2 + α 2 ) ( β 2 + μ 2 ) μ 2 + α 2 , λ 06 = φ 1 μ 2 , λ 07 = λ 08 = μ 2 .
Eight eigenvalues are obtained. To render them all negative, additional constraints on λ 02 , λ 03 , λ 05 are necessary. This is achieved by rearranging terms such that all unknown parameters appear to the left of the ‘less than’ sign, with the right side being 1. This entire left-hand side of the resulting inequality is termed the thresholds R 01 , R 02 , R 03 :
R 01 = ψ 2 Λ 1 μ 1 2 , R 02 = ψ 1 Λ 1 μ 1 2 , R 03 = α 1 Λ 2 ( μ 2 + α 2 ) ( β 2 + μ 2 ) .
This shows that there are negative real parts only when λ satisfy R 0 = m a x { R 01 , R 02 , R 03 } , and R 0 < 1 . By the Hartman–Grobman Theorem, it can be judged that E 0 is asymptotically stable for R 0 < 1 and unstable for R 0 > 1 . □
Theorem 2.
The RFEP E 1 of model (1) is asymptotically stable for R 1 < 1 and unstable for R 1 > 1.
Proof. 
Due to the local stability of the RFEP, E 1 is related to the eigenvalues of the corresponding Jacobian matrix J( E 1 ), and the Jacobian matrix at the E 1 rumor-free equilibrium is as follows:
J ( E 1 ) = μ 1 ψ 2 Λ 1 μ 1 ψ 1 Λ 1 μ 1 0 0 δ 1 Λ 1 μ 1 δ 2 Λ 1 μ 1 0 0 ψ 2 Λ 1 μ 1 2 μ 1 0 0 0 δ 1 Λ 1 μ 1 0 0 0 0 ψ 1 Λ 1 μ 1 2 μ 1 0 0 0 δ 2 Λ 1 μ 1 0 0 0 η 3 ( β 2 + μ 2 ) a 1 α 1 Λ 2 β 2 + μ 2 β 2 μ 2 0 0 0 0 A 0 A 1 A 2 0 A 3 A 4 0 0 A 5 0 0 0 A 6 0 0 0 0 0 0 0 0 A 7 0 0 0 A 8 α 2 β 2 φ 1 0 μ 2 ,
where
A 0 = θ α 1 Λ 2 α 2 β 2 μ 2 ( α 2 + β 2 + μ 2 ) α 1 ( β 2 + μ 2 ) , A 1 = η 1 α 1 Λ 2 α 2 β 2 μ 2 ( α 2 + β 2 + μ 2 ) α 1 ( β 2 + μ 2 ) , A 2 = α 1 Λ 2 α 2 β 2 μ 2 ( α 2 + β 2 + μ 2 ) β 2 + μ 2 , A 3 = β 1 α 1 Λ 2 α 2 β 2 μ 2 ( α 2 + β 2 + μ 2 ) α 1 ( β 2 + μ 2 ) , A 4 = η 3 α 1 Λ 2 α 2 β 2 μ 2 ( α 2 + β 2 + μ 2 ) α 1 ( β 2 + μ 2 ) , A 5 = θ α 1 Λ 2 α 2 β 2 μ 2 ( α 2 + β 2 + μ 2 ) α 1 ( β 2 + μ 2 ) , A 6 = β 1 α 1 Λ 2 α 2 β 2 μ 2 ( α 2 + β 2 + μ 2 ) α 1 ( β 2 + μ 2 ) φ 1 μ 2 , A 7 = β 3 α 1 Λ 2 α 2 β 2 μ 2 ( α 2 + β 2 + μ 2 ) α 1 ( β 2 + μ 2 ) μ 2 , A 8 = η 1 α 1 Λ 2 α 2 β 2 μ 2 ( α 2 + β 2 + μ 2 ) α 1 ( β 2 + μ 2 ) + η 3 ( β 2 + μ 2 ) α 1 .
By a simple calculation, the characteristic equation of J ( E 1 ) is obtained according to | λ E J ( E 1 ) |
( λ + μ 1 ) ( λ + μ 1 2 ψ 2 Λ 1 μ 1 ) ( λ + μ 1 2 ψ 1 Λ 1 μ 1 ) λ + α 1 Λ 2 β 2 + μ 2 λ ( λ A 6 ) ( λ A 7 ) ( λ + μ 2 ) = 0 .
The characteristic roots of the equation thus obtained are:
  • λ 11 = μ 1 , λ 12 = ψ 2 Λ 1 μ 1 2 μ 1 , λ 13 = ψ 1 Λ 1 μ 1 2 μ 1 , λ 14 = α 1 Λ 2 β 2 + μ 2 , λ 15 = 0 ,
  • λ 16 = β 1 α 1 Λ 2 α 2 β 2 μ 2 ( α 2 + β 2 + μ 2 ) α 1 ( β 2 + μ 2 ) φ 1 μ 2 , λ 17 = β 3 α 1 Λ 2 α 2 β 2 μ 2 ( α 2 + β 2 + μ 2 ) α 1 ( β 2 + μ 2 ) μ 2 , λ 18 = μ 2 .
Through calculation and employing the same method as in Theorem 1, we have determined the threshold value: R 11 = ψ 2 Λ 1 μ 1 2 R 12 = ψ 1 Λ 1 μ 1 2 R 13 = β 1 α 1 Λ 2 α 2 β 2 μ 2 ( α 2 + β 2 + μ 2 ) α 1 ( β 2 + μ 2 ) ( φ 1 + μ 2 ) R 14 = β 1 α 1 Λ 2 α 2 β 2 μ 2 ( α 2 + β 2 + μ 2 ) α 1 μ 2 ( β 2 + μ 2 ) . This shows that there are negative real parts only when λ satisfy R 1 = m a x { R 11 , R 12 , R 13 , R 14 } , and R 1 < 1 . Furthermore, when R 1 > 1 , λ has at least one positive real part. Therefore, it can be judged that E 1 is asymptotically stable for R 1 < 1 and unstable for R 1 > 1 . □
Theorem 3.
The RFEP E 2 of model (1) is asymptotically stable for R 2 < 1 and unstable for R 2 > 1.
Proof. 
Due to the local stability of the RFEP, E 2 is related to the eigenvalues of the corresponding Jacobian matrix J( E 2 ), and the Jacobian matrix at the E 2 rumor-free equilibrium is as follows:
J ( E 2 ) = Λ 1 ψ 1 μ 1 ψ 2 μ 1 λ 1 μ 1 0 0 δ 1 μ 1 ψ 1 δ 2 μ 2 ψ 1 0 0 B 0 0 0 0 δ 1 μ 1 ψ 1 0 0 Λ 1 ψ 1 μ 1 2 μ 1 μ Λ 1 ψ 1 μ 1 2 μ 1 ψ 1 0 0 0 0 δ 2 μ 1 ψ 1 0 0 0 B 1 B 2 B 3 0 0 0 0 0 0 0 B 4 0 0 0 0 0 0 0 0 B 5 0 0 0 0 0 0 0 0 μ 2 0 0 0 B 6 B 7 B 8 B 9 0 μ 2 ,
where
  • B 0 = ( ψ 2 ψ 1 ) μ 1 2 ψ 3 ( Λ 1 ψ 1 μ 1 2 ) μ 1 ψ 1 , B 1 = η 3 Λ 2 μ 1 ψ 1 η 3 ( Λ 1 ψ 1 μ 1 2 ) + μ 1 ψ 1 ( μ 2 + α 2 ) ,
  • B 2 = η 3 Λ 1 ψ 1 μ 1 2 μ 1 ψ 1 ( μ 2 + α 2 ) μ 1 ψ 1 , B 3 = α 1 Λ 2 μ 1 ψ 1 η 3 Λ 1 ψ 1 μ 1 2 + μ 1 ψ 1 ( μ 2 + α 2 ) ,
  • B 4 = α 1 Λ 2 μ 1 ψ 1 η 3 ( Λ 1 ψ 1 μ 1 2 ) + μ 1 λ 1 ( μ 2 + α 2 ) η 1 ( Λ 1 ψ 1 μ 1 2 ) μ 1 ψ 1 β 2 μ 2 ,
  • B 5 = η 2 ( Λ 1 ψ 1 μ 1 2 ) μ 1 ψ 1 φ 1 μ 2 , B 6 = η 3 Λ 2 μ 1 ψ 1 η 3 ( Λ 1 ψ 1 μ 1 2 ) + μ 1 ψ 1 ( μ 2 + α 2 ) ,
  • B 7 = η 3 ( Λ 1 ψ 1 μ 1 2 ) μ 1 ψ 1 + α 2 , B 8 = η 1 ( Λ 1 ψ 1 μ 1 2 ) μ 1 ψ 1 + β 2 , B 9 = η 2 ( Λ 1 ψ 1 μ 1 2 ) μ 1 ψ 1 + φ 1 .
By a simple calculation, the characteristic equation of J ( E 2 ) is obtained according to | λ E J ( E 2 ) |
λ + Λ 1 ψ 1 μ 1 ( λ B 0 ) λ ( λ B 2 ) ( λ B 4 ) ( λ B 5 ) ( λ + μ 2 ) 2 = 0 .
The characteristic roots of the equation thus obtained are:
λ 21 = Λ 1 ψ 1 μ 1 , λ 22 = ( ψ 2 ψ 1 ) μ 1 2 ψ 3 ( Λ 1 ψ 1 μ 1 2 ) μ 1 ψ 1 , λ 23 = 0 ,
λ 24 = η 3 ( Λ 1 ψ 1 μ 1 2 ) μ 1 ψ 1 ( μ 2 + α 2 ) μ 1 ψ 1 , λ 25 = α 1 Λ 2 μ 1 ψ 1 η 3 ( Λ 1 ψ 1 μ 1 2 ) + μ 1 ψ 1 ( μ 2 + α 2 ) η 1 ( Λ 1 ψ 1 μ 1 2 ) μ 1 ψ 1 β 2 μ 2 ,
λ 26 = η 2 ( Λ 1 ψ 1 μ 1 2 ) μ 1 ψ 1 φ 1 μ 2 , λ 27 = λ 28 = μ 2 .
Through calculation and employing the same method as in Theorem 1, we have determined the threshold value: R 21 = ( ψ 2 ψ 1 ) μ 1 2 Ψ 3 ( Λ 1 ψ 1 μ 1 2 ) R 22 = α 1 Λ 2 μ 1 ψ 1 [ η 3 ( Λ 1 ψ 1 μ 1 2 ) + μ 1 ψ 1 ( μ 2 + α 2 ) ] η 1 ( Λ 1 ψ 1 μ 1 2 ) μ 1 ψ 1 + β 2 + μ 2 .
This shows that there are negative real parts only when λ satisfy R 2 = m a x { R 21 , R 22 } , and R 2 < 1 . Furthermore, when R 2 > 1 , λ has at least one positive real part. Therefore, it can be judged that E 2 is asymptotically stable for R 2 < 1 and unstable for R 2 > 1 . □
Theorem 4.
The RFEP E 3 of model (1) is asymptotically stable for R 3 < 1 and unstable for R 3 > 1.
Proof. 
Due to the local stability of the RFEP, E 3 is related to the eigenvalues of the corresponding Jacobian matrix J( E 3 ), and the Jacobian matrix at the E 3 rumor-free equilibrium is as follows:
J ( E 3 ) = Λ 1 ψ 1 μ 1 ψ 2 μ 1 ψ 1 μ 1 0 0 δ 1 μ 1 ψ 1 δ 2 μ 1 ψ 1 0 0 C 0 0 0 0 δ 1 μ 1 ψ 1 0 0 A 1 u 1 μ 1 2 μ 1 ψ 3 Λ 1 u 1 μ 1 2 μ 1 ψ 1 0 0 0 0 δ 2 μ 1 ψ 1 0 0 0 C 1 C 2 C 3 0 0 0 0 C 4 C 5 C 6 0 C 7 C 8 0 0 C 9 0 0 0 C 10 0 0 0 0 0 0 0 0 C 11 0 0 0 C 12 C 13 β 2 + η 1 ( Λ 1 ψ 1 μ 1 2 ) μ 1 ψ 1 φ 1 + η 1 ( Λ 1 ψ 1 μ 1 2 ) μ 1 ψ 1 0 μ 2 ,
where
  • C 0 = μ 1 2 ( ψ 2 ψ 1 + ψ 3 ) ψ 3 Λ 1 ψ 1 μ 1 ψ 1 , C 1 = η 3 μ 1 ψ 1 ( β 2 + μ 2 ) η 1 η 3 ( Λ 1 ψ 1 μ 1 2 ) α 1 μ 1 ψ 1
  • C 2 = α 1 Λ 2 μ 1 ψ 1 μ 1 ψ 1 ( β 2 + μ 2 ) + η 1 ( Λ 1 ψ 1 μ 1 2 ) , C 3 = μ 1 ψ 1 ( β 2 + μ 2 ) η 1 ( Λ 1 ψ 1 μ 1 2 ) μ 1 ψ 1 ,
  • C 4 = θ Λ 2 μ 1 ψ 1 μ 1 ψ 1 ( β 2 + μ 2 ) + η 1 ( Λ 1 ψ 1 μ 1 2 ) + θ μ 1 ψ 1 ( μ 2 + a 2 ) + θ η 3 ( Λ 1 ψ 1 μ 1 2 ) α 1 μ 1 ψ 1 ,
  • C 5 = η 1 Λ 2 μ 1 ψ 1 μ 1 ψ 1 ( β 2 + μ 2 ) + η 1 ( Λ 1 ψ 1 μ 1 2 ) + μ 1 ψ 1 η 1 ( μ 2 + α 2 ) + η 1 η 2 ( Λ 1 ψ 1 μ 1 2 ) α 1 μ 1 ψ 1
  • C 6 = α 1 Λ 2 μ 1 ψ 1 μ 1 ψ 1 ( β 2 + μ 2 ) + η 1 ( Λ 1 ψ 1 μ 1 2 ) μ 1 ψ 1 ( μ 2 + α 2 ) + η 3 ( Λ 1 ψ 1 μ 1 2 ) μ 1 ψ 1
  • C 7 = β 1 Λ 2 μ 1 ψ 1 μ 1 ψ 1 ( β 2 + μ 2 ) + η 1 ( Λ 1 ψ 1 μ 1 2 ) + β 1 μ 1 ψ 1 ( μ 2 + α 2 ) + β 1 η 3 ( Λ 1 ψ 1 μ 1 2 ) α 1 μ 1 ψ 1 ,
  • C 8 = β 3 Λ 2 μ 1 ψ 1 μ 1 ψ 1 ( β 2 + μ 2 ) + η 1 ( Λ 1 ψ 1 μ 1 2 ) + β 3 μ 1 ψ 1 ( μ 2 + α 2 ) + β 3 η 3 ( Λ 1 ψ 1 μ 1 2 ) α 1 μ 1 ψ 1
  • C 9 = θ Λ 2 μ 1 ψ 1 μ 1 ψ 1 ( β 2 + μ 2 ) + η 1 ( Λ 1 ψ 1 μ 1 2 ) θ μ 1 ψ 1 ( μ 2 + α 2 ) + θ η 3 ( Λ 1 ψ 1 μ 1 2 ) α 1 μ 1 ψ 1
  • C 10 = β 1 Λ 2 μ 1 ψ 1 μ 1 ψ 1 ( β 2 + μ 2 ) + η 1 ( Λ 1 ψ 1 μ 1 2 ) β 1 ( μ 2 + α 2 ) + α 1 ( Λ 1 ψ 1 μ 1 2 ) α 1 ( β 3 η 3 α 1 η 2 ) ( Λ 1 ψ 1 μ 1 2 ) α 1 μ 1 ψ 1
  • C 11 = β 3 Λ 2 μ 1 ψ 1 μ 1 ψ 1 ( β 2 + μ 2 ) + η 1 ( Λ 1 ψ 1 μ 1 2 ) β 3 μ 1 ψ 1 ( μ 2 + α 2 ) + β 3 η 3 ( Λ 1 ψ 1 μ 1 2 ) α 1 μ 1 ψ 1 μ 2 ,
  • C 12 = η 1 Λ 2 μ 1 ψ 1 μ 1 ψ 1 ( β 2 + μ 2 ) + η 1 ( Λ 1 ψ 1 μ 1 2 ) + η 3 ( β 2 + μ 2 ) η 1 ( μ 2 + α 2 ) α 1 , C 13 = α 2 + η 3 ( Λ 1 ψ 1 μ 1 2 ) μ 1 ψ 1 .
By a simple calculation, the characteristic equation of J ( E 3 ) is obtained according to | λ E J ( E 3 ) |
λ + Λ 1 ψ 1 μ 1 ( λ C 0 ) ( λ C 2 ) ( λ C 10 ) ( λ C 11 ) ( λ + μ 2 ) λ 2 = 0 .
The characteristic roots of the equation thus obtained are:
λ 31 = Λ 1 ψ 1 μ 1 , λ 32 = μ 1 2 ( ψ 2 ψ 1 + ψ 3 ) ψ 3 Λ 1 ψ 1 μ 1 ψ 1 , λ 33 = 0 , λ 34 = α 1 Λ 2 μ 1 ψ 1 μ 1 ψ 1 ( β 2 + μ 2 ) + η 1 ( Λ 1 ψ 1 μ 1 2 ) ,
λ 35 = 0 , λ 36 = β 1 Λ 2 μ 1 ψ 1 μ 1 ψ 1 ( β 2 + μ 2 ) + η 1 ( Λ 1 ψ 1 μ 1 2 ) β 1 ( μ 2 + α 2 ) + α 1 ( Λ 1 ψ 1 μ 1 2 ) α 1 ( β 3 η 3 α 1 η 2 ) ( Λ 1 ψ 1 μ 1 2 ) α 1 μ 1 ψ 1 ,
λ 37 = β 3 Λ 2 μ 1 ψ 1 μ 1 ψ 1 ( β 2 + μ 2 ) + η 1 ( Λ 1 ψ 1 μ 1 2 ) β 3 μ 1 ψ 1 ( μ 2 + α 2 ) + β 3 η 3 ( Λ 1 ψ 1 μ 1 2 ) α 1 μ 1 ψ 1 μ 2 , λ 38 = μ 2 .
Through calculation and employing the same method as in Theorem 1, we have determined the threshold value: R 31 = μ 1 2 ( ψ 2 ψ 1 + ψ 3 ) ψ 3 Λ 1 ψ 1 ,
R 32 = β 1 Λ 2 α 1 μ 1 2 ψ 1 2 [ μ 1 ψ 1 ( β 2 + μ 2 ) + η 1 ( Λ 1 ψ 1 μ 1 2 ) ] [ β 1 ( μ 2 + α 2 ) + α 1 ( Λ 1 ψ 1 μ 1 2 ) ( β 3 η 3 α 1 η 2 ) ( Λ 1 ψ 1 μ 1 2 ) ] ,
R 33 = β 3 Λ 2 α 1 μ 1 2 ψ 1 2 [ μ 1 ψ 1 ( β 2 + μ 2 ) + η 1 ( Λ 1 ψ 1 μ 1 2 ) ] [ β 3 μ 1 ψ 1 ( μ 2 + α 2 ) + β 3 η 3 ( Λ 1 ψ 1 μ 1 2 ) + α 1 μ 1 ψ 1 μ 2 ] .
This shows that there are negative real parts only when λ satisfy R 3 = m a x { R 31 , R 32 , R 33 } , and R 3 < 1 . Furthermore, when R 3 > 1 , λ has at least one positive real part. Therefore, it can be judged that E 3 is asymptotically stable for R 3 < 1 and unstable for R 3 > 1 . □
Remark 3.
Theorems 1–4 establish criteria for the stability of the four equilibrium points. When λ = m a x { λ 0 , λ 1 , λ 2 , λ 3 } < 0 and R = m a x { R 1 , R 2 , R 3 } < 1, at least one equilibrium point among the four is stable, indicating that rumors naturally fade away without the need for intervention strategies. However, when λ > 0 and R > 1, rumors persist in spreading, necessitating the implementation of control strategies. Furthermore, upon comparing these four criteria, it becomes evident that λ 3 < λ 1 and R 3 < R 1 . From this perspective, we can conclude that collaborative debunking strategies reduce the original spreading threshold R 0 of the traditional rumor propagation model. Consequently, collaborative debunking strategies play a significant inhibitory role in the context of rumor propagation.

4. Optimal Control Problems

By incorporating an optimal control approach, the spread of rumors over an expected period of time can be effectively controlled at minimal cost. In the model, we add three control variable, u 1 , u 2 , and u 3 . The control variable u 1 represents efforts to curb the spread of rumors, including measures such as imposing bans on sections of the public spreading rumors and prohibiting large-scale gathering of people offline to spread rumors. The expression ( 1 u 1 ) represents the level of ability of rumor spreaders to convert information disseminators into rumor spreaders by spreading rumors, and reduces the ability of rumor spreaders to guide rumor spreading by adding controls. The control variables u 2 , u 3 denote the control and clarification of rumors, including measures such as the government strengthening the supervision of platforms and urging the clarification of rumors, the rumor-dispelling media seizing cyberspace to enhance the power of public opinion guidance, and the implementation of measures such as criticizing, educating, and severely punishing sections of the public that spread rumors and cause serious social harm.
Therefore, the control model with the specific control intensities mentioned above can be described as:
d M 1 ( t ) = Λ 1 ( δ 1 I 1 ( t ) + ψ 1 M 3 ( t ) + ψ 2 M 2 ( t ) + δ 2 I 2 ( t ) + μ 1 ) M 1 ( t ) dt , d M 2 ( t ) = δ 1 M 1 ( t ) I 1 ( t ) + ( ψ 2 M 1 ( t ) ψ 3 M 3 ( t ) δ 3 I 2 ( t ) ( μ 1 + u 2 ( t ) ) ) M 2 ( t ) d t , d M 3 ( t ) = δ 2 M 1 ( t ) I 2 ( t ) + δ 3 M 2 ( t ) I 2 ( t ) + ( ψ 1 M 1 ( t ) + ψ 3 M 2 ( t ) μ 1 ) M 3 ( t ) d t , d S ( t ) = [ Λ 2 ( α 1 H ( t ) + α 2 + η 3 M 3 ( t ) + μ 2 ) S ( t ) ] d t , d H ( t ) = ( α 1 S ( t ) θ M 2 ( t ) η 1 M 3 ( t ) β 1 1 u 1 ( t ) I 1 ( t ) β 2 β 3 I 2 ( t ) μ 2 ) H ( t ) d t , d I 1 ( t ) = θ H ( t ) M 2 ( t ) + ( β 1 ( 1 u 1 ( t ) ) H ( t ) η 2 M 3 ( t ) φ 2 I 2 ( t ) φ 1 ( μ 2 + u 3 ( t ) ) ) I 1 ( t ) d t , d I 2 ( t ) = [ ( β 3 H ( t ) + φ 2 I 1 ( t ) μ 2 ) I 2 ( t ) ] d t , d R ( t ) = [ α 2 S ( t ) + β 2 H ( t ) + φ 1 I 1 ( t ) + ( η 1 H ( t ) + η 2 I 1 ( t ) + η 3 S ( t ) ) M 3 ( t ) μ 2 R ( t ) ] d t ,
with initial condition as in the following M 1 ( 0 ) > 0 M 2 ( 0 ) > 0 M 3 ( 0 ) > 0 S ( 0 ) > 0 H ( 0 ) > 0 I 1 ( 0 ) > 0 I 2 ( 0 ) > 0 R ( 0 ) > 0 .
We define vectors:
x ( t ) = [ x 1 ( t ) , x 2 ( t ) , x 3 ( t ) , x 4 ( t ) , x 5 ( t ) , x 6 ( t ) , x 7 ( t ) , x 8 ( t ) ] T , u ( t ) = [ u 1 ( t ) , u 2 ( t ) , u 3 ( t ) ] T .
And there is: dx ( t ) = f x ( t ) , u ( t ) dt .
The objective function is:
J ( u ) = 1 2 t 0 t f ( A 1 M 2 ( t ) + A 2 I 1 ( t ) + B 1 2 u 1 ( t ) 2 + B 2 2 u 2 ( t ) 2 + B 3 2 u 3 ( t ) 2 ) d t ,
where B 1 , B 2 , and B 3 are cost coefficients for optimal control, t 0 is the start time, and t f is the end time. Our goal is to find an optimal control quantity u * ( t ) = ( u 1 * ( t ) , u 2 * ( t ) , u 3 * ( t ) ) that minimizes the value of J ( u ) .
The Hamiltonian function of the control problem can be described as: H = A 1 M 2 ( t ) + A 2 I 1 ( t ) + B 1 2 u 1 ( t ) 2 + B 2 2 u 2 ( t ) 2 + B 3 2 u 3 ( t ) 2 + λ 1 ( t ) [ Λ 1 δ 1 M 1 ( t ) I 1 ( t ) ψ 1 M 1 ( t ) M 3 ( t ) ψ 2 M 1 ( t ) M 2 ( t ) δ 2 M 1 ( t ) I 2 ( t ) μ 1 M 1 ( t ) ] + λ 2 ( t ) [ ψ 2 M 1 ( t ) M 2 ( t ) + δ 1 M 1 ( t ) I 1 ( t ) ψ 3 M 2 ( t ) M 3 ( t ) δ 3 M 2 ( t ) I 2 ( t ) ( μ 1 + u 2 ( t ) ) M 2 ( t ) ] + λ 3 ( t ) ψ 1 M 1 ( t ) M 3 ( t ) + ψ 3 M 2 ( t ) M 3 ( t ) + δ 2 M 1 ( t ) I 2 ( t ) + δ 3 M 2 ( t ) I 2 ( t ) μ 1 M 3 ( t ) + λ 4 ( t ) [ Λ 2 α 1 S ( t ) H ( t ) α 2 S ( t ) η 3 S ( t ) M 3 ( t ) μ 2 S ( t ) ] + λ 5 ( t ) [ α 1 S ( t ) H ( t ) θ H ( t ) M 2 ( t ) η 1 H ( t ) M 3 ( t ) β 1 ( 1 u 1 ( t ) ) H ( t ) I 1 ( t ) β 2 H ( t ) β 3 H ( t ) I 2 ( t ) μ 2 H ( t ) ] + λ 6 ( t ) [ β 1 ( 1 u 1 ( t ) ) H ( t ) I 1 ( t ) + θ H ( t ) M 2 ( t ) η 2 I 1 ( t ) M 3 ( t ) φ 2 I 1 ( t ) I 2 ( t ) φ 1 I 1 ( t ) μ 2 I 1 ( t ) u 3 ( t ) I 1 ( t ) ] + λ 7 ( t ) [ β 3 H ( t ) I 2 ( t ) + φ 2 I 1 ( t ) I 2 ( t ) μ 2 I 2 ( t ) ] + λ 8 ( t ) [ α 2 S ( t ) + β 2 H ( t ) + φ 1 I 1 ( t ) + η 1 H ( t ) M 3 ( t ) + η 2 I 1 ( t ) M 3 ( t ) + η 3 S ( t ) M 3 ( t ) μ 2 R ( t ) ] , where λ i ( i = 1 , 2 , , 8 ) denotes the concomitant function. Based on the above discussion, we reach the following conclusions. Optimal control problems allow for a unique optimal solution u 1 * ( t ) , u 2 * , u 3 * , where t ranges from [ t 0 , t f ] . Furthermore, there are conditions for: H u 1 = 0 , H u 2 = 0 , H u 3 = 0 .
H u 1 = B 1 u 1 + λ 5 β 1 H I 1 λ 6 β 1 H I 1 , H u 2 = B 2 u 2 λ 2 M 2 , H u 2 = B 3 u 3 λ 6 I 1 .
Thus, we obtain the optimal immune control strategy as:
u 1 * ( t ) = m i n m a x λ 6 β 1 H I 1 λ 5 β 1 H I 1 B 1 , 1 , u 2 * ( t ) = m i n m a x λ 2 M 2 B 2 , 1 μ 1 , u 3 * ( t ) = m i n m a x λ 6 I 1 B 3 , 1 μ 2 .
The transverse condition is λ ( t f ) = 0 . The corresponding covariance function λ ( t ) satisfies the auxiliary equation: λ i ˙ = H x i . Therefore, we obtain:
  • λ 1 ˙ = H x 1 = λ 1 ( δ 1 I 1 + ψ 1 M 3 + ψ 2 M 2 + δ 2 I 2 + μ 1 ) λ 2 ( ψ 2 M 2 + δ 1 I 1 ) λ 3 ( ψ 1 M 3 + δ 2 I 2 ) ,
  • λ 2 ˙ = H x 2 = A 1 + λ 1 ψ 2 M 1 λ 2 ( ψ 2 M 1 ψ 3 M 3 δ 3 I 2 μ 1 u 2 ) λ 3 ( ψ 3 M 3 + δ 3 I 2 ) + λ 5 θ H λ 6 θ H ,
  • λ 3 ˙ = H x 3 = λ 1 ψ 1 M 1 + λ 2 ψ 3 M 2 λ 3 ( ψ 1 M 1 + ψ 3 M 2 μ 1 ) + λ 4 η 3 S + λ 5 η 1 H + λ 6 η 2 I 1 λ 8 ( η 1 H + η 2 I 1 + η 3 S ) ,
  • λ 4 ˙ = H x 4 = λ 4 ( α 1 H + α 2 + η 3 M 3 + μ 2 ) λ 5 α 1 H λ 8 ( α 2 + η 3 M 3 ) ,
  • λ ˙ 5 = H x 5 = λ 4 α 1 S λ 5 [ α 1 S θ M 2 η 1 M 3 β 1 ( 1 u 1 ) I 1 β 2 β 3 I 2 μ 2 ] λ 6 [ β 1 ( 1 u 1 ) I 1 + θ M 2 ] λ 7 β 3 I 2 λ 8 ( β 2 + η 1 M 3 ) ,
  • λ 6 ˙ = H x 6 = A 2 + λ 1 δ 1 M 1 λ 2 δ 1 M 1 + λ 5 β 1 ( 1 u 1 ) H λ 6 ( β 1 ( 1 u 1 ) H η 2 M 3 φ 2 I 2 φ 1 μ 2 u 3 ) λ 7 φ 2 I 2 λ 8 ( φ 1 + η 2 M 3 ) ,
  • λ ˙ 7 = H x 7 = λ 1 δ 2 M 1 + λ 2 δ 3 M 2 λ 3 ( δ 2 M 1 + δ 3 M 2 ) + λ 5 β 3 H + λ 6 φ 2 I 1 λ 7 ( β 3 H + φ 2 I 1 μ 2 ) ,
  • λ 8 ˙ = H x 8 = λ 8 μ 2 .

5. Numerical Simulaton

In this section, we will verify the accuracy of the model, the dynamic behavior of the model, and the effectiveness of the optimal control strategy through simulation experiments.

5.1. Real Data Fitting

In this study, we take the data relating to the “Hu Xinyu disappearance case” obtained from “Baidu Index” as an example. By fitting the system parameters of the model (1) (with specific parameter values as listed in the 6th column of Table 2) in the ratio of 4:1, we obtain simulation curves for rumor spreaders I1 based on the model, as shown by the red curve in Figure 4. Upon comparison with the real data represented by orange scattered points in Figure 4, it is evident that the trends of the two datasets are consistent. Therefore, model (1) can effectively predict real rumor propagation behavior.

5.2. Stability of Equilibrium Points

In order to verify the stability of the different equilibrium points in Section 3, we performed numerical simulations for each equilibrium point using the system parameters in Table 2.
Based on the data in Table 2, we can generate the following simulation plots.
From the plots in Figure 5, Figure 6, Figure 7, Figure 8 and Figure 9, we can conclude that at each equilibrium point, the system can eventually converge to a constant value. Therefore, the stability of each equilibrium point derived in Section 3 can be proved.

5.3. Optimal Control

In Section 4, we added three control quantities u 1 , u 2 , and u 3 to the system. In order to investigate what effects these control quantities have on the system state and other control quantities, the simulation values are given here to introduce the following nine cases:
  • Case 1: When the added control quantities u 1 = 0 , u 2 = 0 , and u 3 = 0 , we get Figure 9;
  • Case 2: When the added control quantities u 1 = u 1 a v e , u 2 = u 2 a v e , and u 3 = u 3 a v e , we get Figure 10;
  • Case 3: When the added control quantities u 1 = 0.2857 , u 2 = 0.0037 , and u 3 = 0 , we get Figure 11;
  • Case 4: When the added control quantities u 1 = 0.2857 , u 2 = 0 , and u 3 = 0.8554 , we get Figure 12;
  • Case 5: When the added control quantities u 1 = 0 , u 2 = 0.0037 , and u 3 = 0.8554 , we get Figure 13;
  • Case 6: When the added control quantities u 1 = 0.2857 , u 2 = 0 , and u 3 = 0 , we get Figure 14;
  • Case 7: When the added control quantities u 1 = 0 , u 2 = 0.0037 , and u 3 = 0 , we get Figure 15;
  • Case 8: When the added control quantity u 1 = 0 , u 2 = 0 , and u 3 = 0.8554 , we get Figure 16;
  • Case 9: When the added control quantities u 1 = u 1 * , u 2 = u 2 * , and u 3 = u 3 * , we get Figure 17.
Remark 4.
The average of the optimal values of each control quantity can be obtained by simulation as: u 1 a v e = 0.4661 , u 2 a v e = 0.3177 , u 3 a v e = 0.5875 .
According to Table 3, we can obtain the statistical graphs of the various components of the control strategy optimization metrics under different cases shown in Figure 18. We use the control strategy optimization metric to measure the control capability of each control case. That is, the cases with different controls added (Cases 2–9) are compared with the case without controls added (Case 1) to find the corresponding ratio. Thus, it can be concluded that the larger the ratio, the better the control method.
From Case 1, it is evident that, in the absence of any control measures applied to the system, rumors exhibit an initial burst of eruption, spreading rapidly. Contrasting Case 2 and Case 9, the optimal control strategy indicates that imposing robust control during the initial eruption phase and subsequently reducing the control intensity after the rumor subsides is more effective than maintaining a constant control throughout. The optimal control strategy has a 98.83% reduction compared to the constant control strategies. Importantly, the dynamic optimal control approach (Case 9) significantly elevates the level of rumor management.
Moreover, we can clearly derive from the statistics shown in Figure 18 that Case 7 has the lowest total control indicator compared to the other control cases, and thus, we can conclude that the control of the media layer alone does not curb the spread of rumors very well.

6. Conclusions

In this paper, we establish a two-layer rumor propagation model that considers the impact of the virtual layer on the external orientation of the real layer and the reciprocal influence of the real layer on the virtual one. Additionally, we incorporate the combined effect of rumor debunking by the media and the public and propose a mechanism for this collaborative effort. Utilizing this novel model, we analyze the existence and stability of various equilibrium points, theoretically substantiate the stability of these points through linearization methods, and deduce the threshold value of the rumor propagation process by calculation. This threshold delineates the suppression of rumor spreading under the collaborative efforts of the media and the public. Furthermore, we implement three different control measures into the model, reflecting pragmatic control methods, and calculate the specific expression of the optimal control. Finally, to verify the accuracy of the above analysis of equilibrium point theory and to study the suppression effect of different control measures on rumor spreading, we render a visualization of the optimization indices of the control strategy under different control scenarios through simulation.
Our findings reveal that while solitary debunking endeavors by either the media or the public can suppress the spread of rumors, a collaborative debunking approach by both can more effectively inhibit the spread of rumors. Specifically, our simulation experiments demonstrate that the cost of the non-cooperative constant control strategy is the lowest at 20.7491 (case 4), while the cost for the cooperative constant control strategy is 14.9430. However, the cost for the optimal control strategy is significantly lower at 0.1745 (case 9), representing a 98.83% reduction compared to the constant control strategies. These results offer more effective methods and strategies for preventing and intervening in the spread of rumors.

Author Contributions

Conceptualization, X.Z., Y.Z. and Y.P.; methodology, X.Z. and Y.Z.; software, Y.Z. and Y.X.; validation, X.Z., Y.Z. and J.X.; formal analysis, Y.P., J.X. and Y.X.; investigation, Y.P., J.X. and Y.X.; resources, X.Z., Y.Z. and Y.P.; data curation, Y.P., J.X. and Y.X.; writing—original draft preparation, Y.Z. and J.X.; writing—review and editing, X.Z., Y.Z., J.X., Y.X. and Y.P.; visualization, Y.Z., Y.X. and Y.P.; supervision, X.Z., Y.X. and Y.P.; project administration, X.Z., Y.P. and Y.X.; funding acquisition, Y.X. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Social Science Fund of China, project No. 21BSH023.

Data Availability Statement

No data were used to support this study.

Conflicts of Interest

The authors declare no conflicts of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript; or in the decision to publish the results.

References

  1. Kermack, W.O.; McKendrick, A.G. A contribution to the mathematical theory of epidemics. R. Soc. 1927, 115, 0950–1207. [Google Scholar] [CrossRef]
  2. Dietz, K. Epidemics and rumors: A survey. J. R. Stat. Soc. Ser. 1967, 130, 505–528. [Google Scholar] [CrossRef]
  3. Goffman, W.; Newill, V. Generalization of epidemic theory. Nature 1964, 204, 225–228. [Google Scholar] [CrossRef] [PubMed]
  4. Yin, F.L.; Xia, X.Y.; Zhang, X.J.; Zhang, M.J.; Lv, J.H.; Wu, J.H. Modelling the dynamic emotional information propagation and guiding the public sentiment in the Chinese Sinamicroblog. Appl. Math. Comput. 2021, 396, 125884. [Google Scholar] [CrossRef]
  5. Lin, F.; Wu, Z.L.; Shao, X.Y.; Tang, X.Y.; Liang, T.Y.; Wu, J.H. Topic-a cluster of relevant messages-propagation dynamics: A modeling study of the impact of user repeated forwarding behavior. Appl. Math. Comput. 2022, 127, 107819. [Google Scholar] [CrossRef]
  6. Roshani, F.; Naimi, Y. Effects of degree-biased transmission rate and nonlinear infectivity on rumor spreading in complex social networks. Phys. Rev. E 2012, 85, 036109. [Google Scholar] [CrossRef] [PubMed]
  7. Ding, X.J.; Li, M.Y.; Tian, Y.; Jiang, M. RBOTUE: Rumor Blocking Considering Outbreak Threshold and User Experience. IEEE Trans. Eng. Manag. 2022. early access. [Google Scholar] [CrossRef]
  8. Li, J.R.; Jiang, H.J.; Yu, Z.Y. Dynamical analysis of rumor spreading model in homogeneous complex networks. Appl. Math. Comput. 2019, 359, 374–385. [Google Scholar] [CrossRef]
  9. Chen, X.; Zhao, L. The optimal event-triggered impulsive control of a stochastic rumor spreading model incorporating time delay using the particle swarm optimization algorithm. J. Frankl. Inst. 2023, 360, 4695–4718. [Google Scholar] [CrossRef]
  10. Huo, L.; Dong, Y. Dynamics and near-optimal control in a stochastic rumor propagation model incorporating media coverage and Lévy noise. Chin. Phys. B 2022, 31, 030202. [Google Scholar] [CrossRef]
  11. Shioda, S.; Nakajima, Y. Information spread across social network services with users’ information indifference behavior. IEEE Comput. Sci. Electron. Eng. Conf. 2019. [Google Scholar] [CrossRef]
  12. Zhao, D.; Sun, J.; Tan, J.W.; Dong, Y. An extended SEIR model considering homepage effect for the information propagation of online social networks. Phys. A Stat. Mech. Appl. 2018, 512, 1019–1031. [Google Scholar] [CrossRef]
  13. Zhao, M.; Chen, W.X.; Song, Q.K. A Modeling Study of Rumor Propagation Considering the Effects of Media Coverage. Appl. Math. Mech. 2018, 12, 1400–1410. [Google Scholar] [CrossRef]
  14. Xiao, Y.P.; Chen, D.Q.; Wei, S.H.; Li, Q.; Wang, H.H.; Xu, M. Rumor propagation dynamic model based on evolutionary game and anti-rumor. Nonlinear Dyn. 2019, 95, 523–539. [Google Scholar] [CrossRef]
  15. Ke, Y.; Zhu, L.; Wu, P. Dynamics of a reaction-diffusion rumor propagation model with non-smooth control. Appl. Math. Comput. 2022, 435, 127478. [Google Scholar] [CrossRef]
  16. Pan, W.; Yan, W.; Hu, Y. Dynamic analysis of a SIDRW rumor propagation model considering the effect of media reports and rumor refuters. Nonlinear Dyn. 2023, 111, 3925–3936. [Google Scholar] [CrossRef]
  17. Zhong, X.; Yang, Y.; Deng, F. Rumor Propagation Control with Anti-Rumor Mechanism and Intermittent Control Strategies. IEEE Trans. Comput. Soc. Syst. 2023. early access. [Google Scholar] [CrossRef]
  18. Dong, Y.; Huo, L.; Zhao, L. An improved two-layer model for rumor propagation considering time delay and event-triggered impulsive control strategy. Chaos Solitons Fractals 2022, 164, 112711. [Google Scholar] [CrossRef]
  19. Liu, G.; Tan, Z.; Liang, Z.; Chen, H.; Zhong, X. Fractional Optimal Control for malware Propagation in the Internet of Underwater Things. IEEE Internet Things J. 2021. early access. [Google Scholar] [CrossRef]
  20. Ding, L.; Hu, P.; Guan, Z.; Li, T. An Efficient Hybrid Control Strategy for Restraining Rumor Spreading. IEEE Trans. Syst. Man Cybern. Syst. 2021, 51, 2168–2216. [Google Scholar] [CrossRef]
  21. Yang, Y.; Liu, G.; Liang, Z.; Chen, H.; Zhu, L. Hybrid control for malware propagation in rechargeable WUSN and WASN: From knowledge-driven to data-driven. Chaos Solitons Fractals 2023, 173, 113703. [Google Scholar] [CrossRef]
  22. Zhong, X.; Luo, C.; Dong, X.; Bai, D.; Liu, G.; Xie, Y.; Peng, Y. Stochastic Stabilization of Dual-Layer Rumor Propagation Model with Multiple Channels and Rumor-Detection Mechanism. Entropy 2023, 25, 1192. [Google Scholar] [CrossRef] [PubMed]
  23. Guo, H.; Yan, X. Dynamic modeling and simulation of rumor propagation based on the double refutation mechanism. Inf. Sci. 2023, 630, 385–402. [Google Scholar] [CrossRef]
  24. Li, J.; Jiang, H.; Mei, X.; Hu, C.; Zhang, G. Dynamical analysis of rumor spreading model in multi-lingual environment and heterogeneous complex networks. Inf. Sci. 2020, 536, 391–408. [Google Scholar] [CrossRef]
  25. 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]
  26. Mei, X.; Zhang, Z.; Jiang, H. Dynamical Analysis of Hyper-ILSR Rumor Propagation Model with Saturation Incidence Rate. Entropy 2023, 25, 805. [Google Scholar] [CrossRef] [PubMed]
  27. Zhang, Z.; Mei, X.; Jiang, H.; Luo, X.; Xia, Y. Dynamical analysis of Hyper-SIR rumor spreading model. Appl. Math. Comput. 2023, 446, 127887. [Google Scholar] [CrossRef]
  28. Chen, J.; Ma, H.; Yang, S. SEIOR Rumor Propagation Model Considering Hesitating Mechanism and Different Rumor-Refuting Ways in Complex Networks. Mathematics 2023, 11, 283. [Google Scholar] [CrossRef]
  29. Ding, H.; Xie, L. Simulating rumor spreading and rebuttal strategy with rebuttal forgetting: An agent-based modeling approach. Phys. A 2023, 612, 128488. [Google Scholar] [CrossRef]
  30. Luo, X.; Jiang, H.; Chen, S.; Li, J. Stability and optimal control for delayed rumor-spreading model with nonlinear incidence over heterogeneous networks. Chin. Phys. B 2023, 32, 058702. [Google Scholar] [CrossRef]
  31. Zeng, L.; Tang, M.; Liu, Y. The impacts of the individual activity and attractiveness correlation on spreading dynamics in time-varying networks. Commun. Nonlinear Sci. Numer. Simul. 2023, 122, 107233. [Google Scholar] [CrossRef]
  32. Jin, T.; Zhu, Y.; Shu, Y.; Cao, J.; Yan, H.; Jiang, D. Uncertain optimal control problem with the first hitting time objective and application to a portfolio selection model. J. Intell. Fuzzy Syst. 2023, 44, 1585–1599. [Google Scholar] [CrossRef]
  33. Zhu, Y.; Qian, P.; Su, F.; Xu, J. WeChat users’ debunking strategies in response to COVID-19 conspiracy theories: A mixed-methods study. Sage J. Home 2022, 28, 1060–1082. [Google Scholar] [CrossRef]
Figure 1. Relationships between Media in Virtual layer V.
Figure 1. Relationships between Media in Virtual layer V.
Mathematics 12 00462 g001
Figure 2. Relationships between sections of the public in Reality layer R.
Figure 2. Relationships between sections of the public in Reality layer R.
Mathematics 12 00462 g002
Figure 3. V R S H I 1 I 2 R transformation relationships.
Figure 3. V R S H I 1 I 2 R transformation relationships.
Mathematics 12 00462 g003
Figure 4. Graph of rumor spreader curves for E 4 and scatter fit to real data.
Figure 4. Graph of rumor spreader curves for E 4 and scatter fit to real data.
Mathematics 12 00462 g004
Figure 5. Based on the second column of Table 2, we can calculate that R 01 = 0.6 , R 02 = 0.2 , R 03 = 0.72 . Thus, R 0 = 0.72 < 1. From Theorem 1, the system can be balanced to the equilibrium point E 0 . As Figure 5 shows, the simulation results also indicate that the system can be balanced to the point E 0 = M 1 0 , 0 , 0 , S 0 , 0 , 0 , 0 , R 0 .
Figure 5. Based on the second column of Table 2, we can calculate that R 01 = 0.6 , R 02 = 0.2 , R 03 = 0.72 . Thus, R 0 = 0.72 < 1. From Theorem 1, the system can be balanced to the equilibrium point E 0 . As Figure 5 shows, the simulation results also indicate that the system can be balanced to the point E 0 = M 1 0 , 0 , 0 , S 0 , 0 , 0 , 0 , R 0 .
Mathematics 12 00462 g005
Figure 6. Based on the third column of Table 2, we can calculate that R 11 = 0.6 , R 12 = 0.2 , R 13 = 0.42 , R 14 = 0.42 . Thus, R 1 = 0.6 < 1. From Theorem 2, the system can be balanced to the equilibrium point E 1 . As Figure 6 shows, the simulation results also indicate that the system can be balanced to the point E 1 = M 1 1 , 0 , 0 , S 1 , H 1 , 0 , 0 , R 1 .
Figure 6. Based on the third column of Table 2, we can calculate that R 11 = 0.6 , R 12 = 0.2 , R 13 = 0.42 , R 14 = 0.42 . Thus, R 1 = 0.6 < 1. From Theorem 2, the system can be balanced to the equilibrium point E 1 . As Figure 6 shows, the simulation results also indicate that the system can be balanced to the point E 1 = M 1 1 , 0 , 0 , S 1 , H 1 , 0 , 0 , R 1 .
Mathematics 12 00462 g006
Figure 7. Based on the forth column of Table 2, we can calculate that R 21 = 0 , R 22 = 0.86 . Thus, R 2 = 0.86 < 1. From Theorem 3, the system can be balanced to the equilibrium point E 2 . As Figure 7 shows, the simulation results also indicate that the system can be balanced to the point E 2 = M 1 2 , 0 , M 3 2 , S 2 , 0 , 0 , 0 , R 2 .
Figure 7. Based on the forth column of Table 2, we can calculate that R 21 = 0 , R 22 = 0.86 . Thus, R 2 = 0.86 < 1. From Theorem 3, the system can be balanced to the equilibrium point E 2 . As Figure 7 shows, the simulation results also indicate that the system can be balanced to the point E 2 = M 1 2 , 0 , M 3 2 , S 2 , 0 , 0 , 0 , R 2 .
Mathematics 12 00462 g007
Figure 8. Based on the fifth column of Table 2, we can calculate that R 31 = 0.06 , R 32 = 0.0014 , R 33 = 0.27 . Thus, R 3 = 0.27 < 1. From Theorem 4, the system can be balanced to the equilibrium point E 3 . As Figure 8 shows, the simulation results also indicate that the system can be balanced to the point E 3 = ( M 1 3 , 0 , M 3 3 , S 3 , H 3 , 0 , 0 , R 3 ) .
Figure 8. Based on the fifth column of Table 2, we can calculate that R 31 = 0.06 , R 32 = 0.0014 , R 33 = 0.27 . Thus, R 3 = 0.27 < 1. From Theorem 4, the system can be balanced to the equilibrium point E 3 . As Figure 8 shows, the simulation results also indicate that the system can be balanced to the point E 3 = ( M 1 3 , 0 , M 3 3 , S 3 , H 3 , 0 , 0 , R 3 ) .
Mathematics 12 00462 g008
Figure 9. Based on the sixth column of Table 2, we can calculate that R 03 = 62.74 , R 14 = 15.59 , R 22 = 13.34 , R 31 = 5 . From Figure 9, we can obtain that the system cannot reach the rumor-free equilibrium point (neither I1 nor M2 eventually converge to 0) when R < 1 is not satisfied. However, each section of the public eventually converges to a number that is not 0, which we call the local equilibrium point E 4 = ( M 1 * , M 2 * , M 3 * , S * , H * , I 1 * , I 2 * , R * ) .
Figure 9. Based on the sixth column of Table 2, we can calculate that R 03 = 62.74 , R 14 = 15.59 , R 22 = 13.34 , R 31 = 5 . From Figure 9, we can obtain that the system cannot reach the rumor-free equilibrium point (neither I1 nor M2 eventually converge to 0) when R < 1 is not satisfied. However, each section of the public eventually converges to a number that is not 0, which we call the local equilibrium point E 4 = ( M 1 * , M 2 * , M 3 * , S * , H * , I 1 * , I 2 * , R * ) .
Mathematics 12 00462 g009
Figure 10. State change diagrams and control variable diagrams for case 2.
Figure 10. State change diagrams and control variable diagrams for case 2.
Mathematics 12 00462 g010
Figure 11. State change diagrams and control variable diagrams for case 3.
Figure 11. State change diagrams and control variable diagrams for case 3.
Mathematics 12 00462 g011
Figure 12. State change diagrams and control variable diagrams for case 4.
Figure 12. State change diagrams and control variable diagrams for case 4.
Mathematics 12 00462 g012
Figure 13. State change diagrams and control variable diagrams for case 5.
Figure 13. State change diagrams and control variable diagrams for case 5.
Mathematics 12 00462 g013
Figure 14. State change diagrams and control variable diagrams for case 6.
Figure 14. State change diagrams and control variable diagrams for case 6.
Mathematics 12 00462 g014
Figure 15. State change diagrams and control variable diagrams for case 7.
Figure 15. State change diagrams and control variable diagrams for case 7.
Mathematics 12 00462 g015
Figure 16. State change diagrams and control variable diagrams for case 8.
Figure 16. State change diagrams and control variable diagrams for case 8.
Mathematics 12 00462 g016
Figure 17. State change diagrams and control variable diagrams for case 9.
Figure 17. State change diagrams and control variable diagrams for case 9.
Mathematics 12 00462 g017
Figure 18. Statistical graphs of control strategy optimization metrics of the various components in the objective function under different cases. (a) Control strategy optimization metrics plot for the M 2 part. (b) Control strategy optimization metrics plot for the I 1 part. (c) Control strategy optimization metrics plot for the sum of the components.
Figure 18. Statistical graphs of control strategy optimization metrics of the various components in the objective function under different cases. (a) Control strategy optimization metrics plot for the M 2 part. (b) Control strategy optimization metrics plot for the I 1 part. (c) Control strategy optimization metrics plot for the sum of the components.
Mathematics 12 00462 g018
Table 1. Parameters and implications in the V R S H I 1 I 2 R model.
Table 1. Parameters and implications in the V R S H I 1 I 2 R model.
ParametersDescriptionRealm
α 1 Probability of converting an unknown into a
disseminator of information.
[0,1]
α 2 Probability that an unknown is converted to a silent.[0,1]
β 1 Probability that an information disseminator is
converted to a rumor spreader.
[0,1]
β 2 Probability of converting information
disseminators into silencers.
[0,1]
β 3 Probability that an information disseminator is
converted into a rumor debunker.
[0,1]
φ 1 Probability of conversion of a rumor spreader into a silencer.[0,1]
φ 2 Probability that a rumor spreader is converted
to a rumor debunker.
[0,1]
ψ 1 Probability of silent media converting to rumor-refuting media.[0,1]
ψ 2 Probability of conversion of silent media
to rumor-spreading media.
[0,1]
ψ 3 Probability of rumor-spreading media converting
to rumor-refuting media.
[0,1]
θ The role of rumor-spreading media in orienting
information disseminators.
[0,1]
η 1 The role of rumor-refuting media in orienting
information disseminators.
[0,1]
η 2 The role of rumor-refuting media in orienting rumor spreaders.[0,1]
η 3 The role of rumor-refuting media in orienting the unknowns.[0,1]
δ 1 The role of rumor spreaders in orienting silent media.[0,1]
δ 2 The role of rumor debunkers
in orienting silent media.
[0,1]
δ 3 The role of rumor debunkers in orienting
rumor-spreading media.
[0,1]
Λ 1 V-Layer input rate[0,1]
μ 1 V-layer output rate[0,1]
Λ 2 R-Layer input rate[0,1]
μ 2 R-layer output rate[0,1]
Table 2. Simulation parameters for each equilibrium point.
Table 2. Simulation parameters for each equilibrium point.
ParameterValues in E 0 Values in E 1 Values in E 2 Values in E 3 Values in E 4
Λ 1 88888
Λ 2 8080808080
μ 1 0.20.20.20.20.2
μ 2 0.10.10.10.10.1
α 1 0.00010.000240.00020.00030.008
α 2 0.010.080.0010.0070.001
β 1 0.0010.0010.0010.0010.002
β 2 0.0010.0010.0010.0090.001
β 3 0.0010.0010.0010.0010.0001
φ 1 0.0010.0010.0010.0010.001
φ 2 0.0010.0010.0010.0010.001
ψ 1 0.0010.0010.0090.0090.001
ψ 2 0.0030.0030.0090.0010.001
ψ 3 0.0010.0010.0090.0090.001
θ 0.0010.0010.0010.0010.001
η 1 0.0060.0010.0020.0020.002
η 2 0.0010.0010.0010.0010.001
η 3 0.0010.0010.0020.0020.002
σ 1 0.0010.0010.0010.0010.001
σ 2 0.0010.0010.0010.0010.005
σ 3 0.0010.0010.0010.0010.001
Table 3. Simulation values under different controls.
Table 3. Simulation values under different controls.
- A 1 M 2 A 2 I 1 B 1 2 u 1 2 B 2 2 u 2 2 B 3 2 u 3 2 J sum
Case 16.89203598.80003605.7
Case 20.02733.49068.69001.00931.725814.9430
Case 33.14331273.23.26500.000101279.6
Case 40.414913.41073.265003.658520.7491
Case 50.437426.151300.00013.658530.2474
Case 63.17941277.83.2650001284.2
Case 76.83903592.500.000103599.3
Case 80.452826.7827003.658530.8941
Case 90.013  10.1732  1 1.0833 × 10 35 4.0625 × 10 36 2.7083 × 10 37 0.1745  1
1 The data bolded and highlighted in green is the smallest value in each column of data.
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

Zhong, X.; Zheng, Y.; Xie, J.; Xie, Y.; Peng, Y. Multi-Agent Collaborative Rumor-Debunking Strategies on Virtual-Real Network Layer. Mathematics 2024, 12, 462. https://doi.org/10.3390/math12030462

AMA Style

Zhong X, Zheng Y, Xie J, Xie Y, Peng Y. Multi-Agent Collaborative Rumor-Debunking Strategies on Virtual-Real Network Layer. Mathematics. 2024; 12(3):462. https://doi.org/10.3390/math12030462

Chicago/Turabian Style

Zhong, Xiaojing, Yawen Zheng, Junxian Xie, Ying Xie, and Yuqing Peng. 2024. "Multi-Agent Collaborative Rumor-Debunking Strategies on Virtual-Real Network Layer" Mathematics 12, no. 3: 462. https://doi.org/10.3390/math12030462

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