Nothing Special   »   [go: up one dir, main page]
Next Article in Journal
Techniques and Algorithms for Hepatic Vessel Skeletonization in Medical Images: A Survey
Previous Article in Journal
Entropy Generation during Head-On Interaction of Premixed Flames with Inert Walls within Turbulent Boundary Layers
You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
Journals
Entropy
Volume 24
Issue 4
10.3390/e24040464
entropy-logo
Submit to this Journal Review for this Journal Propose a Special Issue
► Article Menu

Article Menu

share Share announcement Help format_quote Cite question_answer Discuss in SciProfiles thumb_up
...
Endorse textsms
...
Comment
first_page
settings
Order Article Reprints
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Dynamic Analysis and Optimal Control of Rumor Spreading Model with Recurrence and Individual Behaviors in Heterogeneous Networks

by
Xinru Tong
1,
Haijun Jiang
1,*,
Xiangyong Chen
2,
Shuzhen Yu
1 and
Jiarong Li
1
1
College of Mathematics and System Science, Xinjiang University, Urumqi 830046, China
2
School of Automation and Electrical Engineering, Linyi University, Linyi 276007, China
*
Author to whom correspondence should be addressed.
Entropy 2022, 24(4), 464; https://doi.org/10.3390/e24040464
Submission received: 23 February 2022 / Revised: 19 March 2022 / Accepted: 23 March 2022 / Published: 27 March 2022
(This article belongs to the Section Information Theory, Probability and Statistics)
Browse Figures
Figure 1
<p>Structure of the SHILR rumor spreading process.</p> "> Figure 2
<p>(<b>a</b>–<b>d</b>) The stability of <math display="inline"><semantics> <msub> <mi>E</mi> <mn>0</mn> </msub> </semantics></math> for model (<a href="#FD9-entropy-24-00464" class="html-disp-formula">9</a>) with <math display="inline"><semantics> <mrow> <msub> <mi>R</mi> <mn>0</mn> </msub> <mo>&lt;</mo> <mn>1</mn> </mrow> </semantics></math>.</p> "> Figure 3
<p>(<b>a</b>–<b>d</b>) The stability of <math display="inline"><semantics> <msup> <mi>E</mi> <mo>*</mo> </msup> </semantics></math> for model (<a href="#FD9-entropy-24-00464" class="html-disp-formula">9</a>) with <math display="inline"><semantics> <mrow> <msub> <mi>R</mi> <mn>0</mn> </msub> <mo>&gt;</mo> <mn>1</mn> </mrow> </semantics></math>.</p> "> Figure 4
<p>The densities of (<b>a</b>) <math display="inline"><semantics> <mrow> <msub> <mi>S</mi> <mi>k</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> and (<b>b</b>) <math display="inline"><semantics> <mrow> <msub> <mi>I</mi> <mi>k</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> with different values of <span class="html-italic">k</span>.</p> "> Figure 5
<p><math display="inline"><semantics> <mrow> <msub> <mi>I</mi> <mn>10</mn> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> with optimal control (blue) and without optimal control (red).</p> "> Figure 6
<p>The path of optimal control (<b>a</b>) and control costs (<b>b</b>).</p> "> Figure 7
<p>(<b>a</b>,<b>b</b>) Number of individuals spreading the rumor.</p> "> Figure 8
<p>Number of individuals spreading rumors.</p> ">
Versions Notes

Abstract

:
This paper is devoted to investigating the impact of the recurrence of rumors and individual behaviors and control strategies related to rumor spreading in online social networks. To do this, a novel susceptible-hesitating-infected-latent-recovered (SHILR) rumor propagation model in heterogeneous networks is presented. Firstly, based on the relevant mean-field equations of the model, the threshold value is examined to demonstrate the existence and stability of rumor-free/spreading equilibrium with the help of the algebraic method. Secondly, the global stabilities of the equilibria are analyzed through applying Lyapunov stability theory and LaSalle’s invariance principle. Next, the optimal control is proposed by taking advantage of Pontryagin’s maximum principle for reducing the number of infected individuals with minimum cost. Moreover, some numerical examples are carried out to test the theoretical results. Finally, combined with practice, a model application is presented.

1. Introduction

Rumors are usually interpreted as an unconfirmed statement of events or problems of public interest, which are spread through various channels [1,2]. With widespread internet access and use, people are exposed to a large number of online rumors. For example, on 31 January 2020, a rumor claiming “Shuanghuanglian” oral solution can suppress COVID-19 resulted in some domestic pharmacies to quickly sell out of “Shuanghuanglian”-related products, causing market chaos and bringing a series of negative effects [3]. Therefore, it is very important to explore the dynamics of rumor propagation in order to provide theoretical guidance for curbing rumors.
Since the dynamics of rumor spreading are highly similar to that of infectious epidemics, many scholars draw lessons from the compartmental modeling method in biological infectious diseases. Some scholars consider features of human social behavior as the basis for establishing rumor spreading models and extrapolate laws inherent to rumor spreading. The classic rumor spreading models can be traced back to the DK model [4] proposed by Daley and Kendall in 1965 and the MT model [5] proposed by Maki and Thomson. With these as their foundation, many scholars have studied the dynamics of rumor propagation and created many meaningful rumor propagation models. In particular, Zanettle first introduced complex networks into a rumor propagation model and established a model in small-world networks [6,7]. His research shows that the structure of networks has a dramatic effect on rumor spreading. It is widely known that complex networks are divided into homogeneous networks and heterogeneous networks according to whether the nodes of the network are of the same degree. In addition, a large number of rumor-spreading models have been discussed in homogeneous networks [8,9,10,11,12,13,14,15].
Actually, it is impossible for each individual to have contact with the same number of people. Therefore, propagation of rumors is too complex to simply assume that the number of people contacted by each individual is equal. In real life, everyone has a different number of friends. Those who have good social skills have a greater impact on the spreading of rumors. Thus, it is necessary to study the spread of rumors in heterogeneous networks. Recently, some research of rumor propagation in heterogeneous networks have been published [16,17,18,19,20]. In [17], Hosseini et al. introduced a new dynamic rumor propagation model of malware propagation in heterogeneous networks. Ma et al. proposed a novel rumor spreading model in heterogeneous networks by considering the individuals’ subjective judgment and diverse characteristics [19]. Zhu et al. considered network supervision and network topology, then proposed a novel susceptible-propagating-recovery (SIR) rumor propagation model with tome delay in both homogeneous and heterogeneous networks [20]. These works show that rumor propagation in heterogeneous networks is more interesting and complex. The rumor propagation model in heterogeneous networks could better reflect the real rumor propagation process.
In addition, it is of great practical significance to study the spreading mechanism of rumors in order to better understand and control rumor propagation. To describe the dynamics of rumor propagation more precisely, many scholars have considered various rumor spreading mechanisms, such as counterattack and self-resistance mechanism [21], trust mechanism [22], rational consciousness mechanism [23], latent mechanism [24], media reports mechanism [25], official refutation mechanism [26] and doubt mechanism [27]. It is worth noting that there is the possibility of recurrence in the process of rumor spreading. Yao et al. [28] considered the rumor spreading model with a rumor recurrence mechanism in homogeneous networks. Recurrence refers to the fact that some individuals may cease spreading the rumor at one point in time but resume spreading it after unforeseen circumstances reignite their interest. In this paper, recurrence mechanisms are considered in heterogeneous networks.
Moreover, individual behaviors need to be taken into consideration in modeling, as different people will have different reactions to the same rumor [29]. Actually, if people hear rumors, they usually immediately decide their course of action. That is to say, an ignorant individual generally chooses one of three different behaviors when he hears a rumor. The first option is to believe and spread the rumor and become a spreader; the second option is to hesitate—unsure of whether or not to spread the rumor; the third option is to not spread the rumor, directly becoming a recovered individual. Based on this, individual behaviors are factored into rumor propagation models in heterogeneous networks. Furthermore, in [30,31], the authors think that if the content is more important and ambiguous, the rumor will spread faster. Therefore, on the basis of these research results, a new parameter is introduced to quantify the attractiveness of rumors to people, denoted by m. It could be regarded as the unity of the significance and fuzziness of rumor content. The larger the m, the greater the interested in the rumor.
In view of the negative impact of rumor spread, it is urgent to restrain rumor spreading. Therefore, optimal control is born at the moment. Optimal control is a control to make target index of the given system reach the maximum (or minimum) under the given constraint conditions. Applying optimal control to rumor propagation models usually means that it can cut down the number of rumor infected individuals with minimum control cost. Zhu et al. [32] considered optimal immune control strategy in rumor propagation process and achieved good inhibition effect. Li et al. [33] considered the optimal education strategy and reduce the number of rumor infected individuals effectively. It is well known that excessive control intensity will lead to unnecessary waste of resources while insufficient control intensity could not curb the spreading of rumors. Thus, optimal control is particularly important to restrain rumor propagation. In this paper, an optimal media coverage control strategy is studied.
Motivated by the above analysis, this paper is devoted to investigating the impact of the recurrence of rumors, individual behaviors and the optimal media coverage control strategy for rumor propagation in heterogeneous networks. The main contributions and research work of this paper can be generalized as follows:
(1)
Different from [28], not only is the recurrence mechanism considered, but also individual behaviors and the attractiveness factor are taken into account in our models, which makes the models more general and more practical.
(2)
The optimal media coverage control strategy is proposed based on Pontryagin’s Maximum Principle in order to restrain the propagation of the rumor with the lowest cost.
(3)
A specific heterogeneous network for studying rumor propagation, such as a BA scale-free network, is established. Moreover, a practical example is presented to verify the feasibility of the established model, which makes the proposed model more complex but more practical.
The outline of the rest of the paper is arranged as follows. In Section 2, a novel SHILR model is presented in heterogeneous networks. In Section 3, the global asymptotic stabilities of equilibria are proved. In Section 4, the optimal media coverage control strategy is put forward. In Section 5, several numerical examples are carried out. In Section 6, application of the model with a practical example is provided. Section 7 gives conclusions.

2. Model Formulation

In this section, a SHILR rumor propagation model in heterogeneous networks is proposed. Considering the total population of N ( t ) and their contacts as complex networks, the concept of complex network is introduced, including nodes, edges and the degree [34] of nodes in networks. Based on complex network theory, rumor propagation in heterogeneous networks is discussed. Nodes represent individuals in social networks. The edges connecting two nodes in networks describe the contacts between individuals. The degree (k) of nodes in networks represents the number of the individuals’ own friends. Assume that the total population ( N ( t ) ) in networks is divided into five categories. Susceptible individuals ( S ( t ) ) mean the people who have not had contact with the rumor. Hesitating individuals ( H ( t ) ) represent the people who hear the rumor but hesitate to spread the rumor. Infected individuals ( I ( t ) ) denote the people who know and believe the rumor and spread it immediately. Latent individuals ( L ( t ) ) represent the people who cease spreading the rumor at the moment but might spread the rumor again. Recovered individuals ( R ( t ) ) denote the people who already know the rumor but do not spread it. Denote the density of susceptible, hesitating, infected, latent and recovered individuals with degree k at time t as S k ( t ) , H k ( t ) , I k ( t ) , L k ( t ) and R k ( t ) , respectively. In addition, it is assumed that the total population is variable over time in this paper. As shown in Figure 1, the rules of the SHILR rumor propagation model can be described as follows:
  • Assume the whole group has a constant immigration rate B, and μ denotes the emigration rate.
  • After a susceptible individual hears the rumor through contact with an infected individual with probability α , he has three possible choices. If he prefers to believe and spread the rumor, he will become an infected individual with probability θ 1 . If he is hesitant about spreading the rumor, he will become a hesitating individual with probability θ 2 . If he does not spread the rumor, he will develop into a recovered individual with probability ( 1 − θ 1 − θ 2 ) .
  • After a period of time, the hesitating individual is infected with probability β . The hesitating individual becomes an infected individual with probability m β (m represents the attractiveness of rumor), and he becomes a recovered individual with probability ( 1 − m ) β .
  • As for infected individuals, they will turn into latent state when the rumor is found to be fabricated. Latent state is a particular state in which some individuals may totally lose their interest in rumor propagation and then become recovered individuals with probability η , but other individuals may regain their interest in rumor propagation as a result of unforeseen events, meaning they become infected individuals again with probability φ .
Remark 1.
From Figure 1, it is noticeable that the rules of rumor propagation considered in this paper differ from the previous articles [8,9,10,11,12,13,14,15,16,17,18,19,20]. The different behaviors of susceptible individuals and the attractiveness of rumors are discussed.
Thus, with the assistance of the heterogeneous mean-field method [35,36], the dynamics of the SHILR rumor propagation model in heterogeneous networks with rumor recurrence and individual behaviors is presented:
d S k ( t ) d t = B − α k S k ( t ) Θ ( t ) − μ S k ( t ) , d H k ( t ) d t = θ 2 α k S k ( t ) Θ ( t ) − ( β + μ ) H k ( t ) , d I k ( t ) d t = θ 1 α k S k ( t ) Θ ( t ) + m β H k ( t ) − ( γ + μ ) I k ( t ) + φ L k ( t ) , d L k ( t ) d t = γ I k ( t ) − ( φ + η + μ ) L k ( t ) , d R k ( t ) d t = ( 1 − m ) β H k ( t ) + ( 1 − θ 1 − θ 2 ) α k S k ( t ) Θ ( t ) + η L k ( t ) − μ R k ( t ) ,
with the initial conditions
S k ( 0 ) > 0 , H k ( 0 ) > 0 , I k ( 0 ) > 0 , L k ( 0 ) > 0 , R k ( 0 ) > 0 , k = 1 , 2 , ⋯ , n .
Denote the total population density with degree k at time t as N k ( t ) . Thus
N k ( t ) = S k ( t ) + H k ( t ) + I k ( t ) + L k ( t ) + R k ( t ) .
Assume that B , μ , m > 0 and α , β , γ , φ , η , θ 1 , θ 2 , ( 1 − θ 1 − θ 2 ) ∈ ( 0 , 1 ) . Θ ( t ) represents the probability that the neighbor of a node with degree k is infected at time t, which is described as
Θ ( t ) = ∑ i = 1 n p ( i | k ) I i ( t ) , i = 1 , 2 , ⋯ , n .
Here, p ( i | k ) is the conditional probability that a node with degree k is connected to a node with degree i. In this paper, degree-uncorrelated networks [37] are implemented, in which the conditional probability can be written as p ( i | k ) = i p ( i ) 〈 k 〉 , where 〈 k 〉 = ∑ k = 1 n k p ( k ) is the average degree and p ( i ) is the degree distribution. Hence, substituting p ( i | k ) into Θ ( t ) , one can obtain
Θ ( t ) = 1 〈 k 〉 ∑ i = 1 n i p ( i ) I i ( t ) .
Remark 2.
In degree-uncorrelated networks, the existence of an edge between any two nodes is independent of the degree of these two nodes. That is to say, if the degree of the two endpoints of an edge randomly selected in a network is completely random, the network is a degree-uncorrelated network, otherwise it is a degree-correlated network. Thus, it can be seen that social networks are a degree-uncorrelated network. Actually, in real social networks, whether two person can become friends or not has nothing to do with the number of friends each of them has. Therefore, only degree-uncorrelated networks are considered in this paper.
Remark 3.
It is noticed that there is a big difference between heterogeneous networks and homogeneous networks. The degree of each node in homogeneous networks is the same, while it is different in heterogeneous networks. Actually, it is impossible for each person to have contact with the same number of individuals. In real life, everyone has a different number of friends. Those with good social skills have a greater impact on the spreading of rumors. Therefore, it is more reasonable to introduce heterogeneous networks to describe the rumor spreading process.
Remark 4.
In [38,39], rumor propagation models with a hesitation mechanism in heterogeneous networks were proposed. Compared with [38,39], in addition to a hesitation factor, individual behavior and a recurrence mechanism were also considered, which makes the model more general and more practical.

3. The Basic Reproduction Number and the Analysis of Equilibria

In this section, the dynamics of SHILR rumor propagation in social networks will be analyzed. Because the first four equations are independent of the last one, one can consider the following system for simplification:
d S k ( t ) d t = B − α k S k ( t ) Θ ( t ) − μ S k ( t ) , d H k ( t ) d t = θ 2 α k S k ( t ) Θ ( t ) − ( β + μ ) H k ( t ) , d I k ( t ) d t = θ 1 α k S k ( t ) Θ ( t ) + m β H k ( t ) − ( γ + μ ) I k ( t ) + φ L k ( t ) , d L k ( t ) d t = γ I k ( t ) − ( φ + η + μ ) L k ( t ) .
Obviously, system (4) has a rumor-free equilibrium:
E 0 = { B μ , 0 , 0 , 0 , ⋯ , B μ , 0 , 0 , 0 } .
Furthermore, whether or not there is a rumor-spreading equilibrium in the system (4) will be discussed.
Define R 0 = 〈 k 2 〉 〈 k 〉 a 3 ( a 1 θ 1 + m β θ 2 ) α B μ a 1 ( a 2 a 3 − φ γ ) , which is the basic reproduction number determined later.
Lemma 1.
When R 0 > 1 , the system (4) has a unique rumor-spreading equilibrium E * = { S 1 * , H 1 * , I 1 * , L 1 * , ⋯ , S n * , H n * , I n * , L n * } .
Proof of Lemma 1. 
Assume that E * = ( S k * , H k * , I k * , L k * ) ( k = 1 , 2 , ⋯ , n ) is the rumor-spreading equilibrium, thus, the following equations hold:
B − α k S k * Θ * − μ S k * = 0 , θ 2 α k S k * Θ * − ( β + μ ) H k * = 0 , θ 1 α k S k * Θ * + m β H k * − ( γ + μ ) I k * + φ L k * = 0 , γ I k * − ( φ + η + μ ) L k * = 0 .
□
By solving (5), there exists:
S k * = B α k Θ * + μ , H k * = θ 2 α k S k * Θ * β + μ , I k * = a 3 ( a 1 θ 1 + m β θ 2 ) α k Θ * a 1 ( a 2 a 3 − φ γ ) B α k Θ * + μ , L k * = γ I k * φ + η + μ ,
where a 1 = β + μ , a 2 = γ + μ , a 3 = φ + η + μ . Based on (3), one can get the self-consistency equation as follows:
Θ * = 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k * = 1 〈 k 〉 ∑ k = 1 n k p ( k ) a 3 ( a 1 θ 1 + m β θ 2 ) α k Θ * a 1 ( a 2 a 3 − φ γ ) B α k Θ * + μ .
Now, construct the following auxiliary function:
f ( Θ * ) = 1 − 1 〈 k 〉 ∑ k = 1 n k p ( k ) a 3 ( a 1 θ 1 + m β θ 2 ) α k a 1 ( a 2 a 3 − φ γ ) B α k Θ * + μ .
It is clear that Θ * f ( Θ * ) = 0 and there is a rumor-free equilibrium E 0 of system (4). In the following, the case of f ( Θ * ) = 0 with Θ * ≠ 0 is discussed.
Clearly, based on the definition of f ( Θ * ) , one can get:
d f ( Θ * ) d Θ * = 1 〈 k 〉 ∑ k = 1 n k p ( k ) a 3 ( a 1 θ 1 + m β θ 2 ) α k a 1 ( a 2 a 3 − φ γ ) α k B ( α k Θ * + μ ) 2 > 0 ,
f ( 1 ) = 1 − 1 〈 k 〉 ∑ k = 1 n k p ( k ) a 3 ( a 1 θ 1 + m β θ 2 ) α k a 1 ( a 2 a 3 − φ γ ) B α k + μ .
Since 0 < Θ * < 1 , one can obtain:
a 3 ( a 1 θ 1 + m β θ 2 ) α k Θ * a 1 ( a 2 a 3 − φ γ ) B α k + μ < a 3 ( a 1 θ 1 + m β θ 2 ) α k Θ * a 1 ( a 2 a 3 − φ γ ) B α k Θ * + μ = I k * < 1 .
Therefore, a 3 ( a 1 θ 1 + m β θ 2 ) α k Θ * a 1 ( a 2 a 3 − φ γ ) B α k + μ < 1 for all Θ * ∈ ( 0 , 1 ) .
Let g ( Θ * ) = a 3 ( a 1 θ 1 + m β θ 2 ) α k Θ * a 1 ( a 2 a 3 − φ γ ) B α k + μ , based on continuity of f ( Θ * ) , one can get:
lim Θ * → 1 g ( Θ * ) = a 3 ( a 1 θ 1 + m β θ 2 ) α k a 1 ( a 2 a 3 − φ γ ) B α k + μ < 1 .
Therefore, f ( 1 ) = 1 − 1 〈 k 〉 ∑ k = 1 n k p ( k ) a 3 ( a 1 θ 1 + m β θ 2 ) α k a 1 ( a 2 a 3 − φ γ ) B α k + μ > 0 . Since d f ( Θ * ) d Θ * > 0 for all Θ * and f ( 1 ) > 0 , the above indicates that f ( Θ * ) = 0 has a unique positive solution only when lim Θ * → 0 + f ( Θ * ) < 0 . Based on 〈 k 2 〉 = ∑ k = 1 n k 2 p ( k ) , thus:
f ( 0 ) = 1 − 1 〈 k 〉 ∑ k = 1 n k p ( k ) a 3 ( a 1 θ 1 + m β θ 2 ) α k a 1 ( a 2 a 3 − φ γ ) B μ = 1 − 1 〈 k 〉 ∑ k = 1 n k 2 p ( k ) a 3 ( a 1 θ 1 + m β θ 2 ) α a 1 ( a 2 a 3 − φ γ ) B μ = 1 − 〈 k 2 〉 〈 k 〉 a 3 ( a 1 θ 1 + m β θ 2 ) α B μ a 1 ( a 2 a 3 − φ γ ) ,
that is
〈 k 2 〉 〈 k 〉 a 3 ( a 1 θ 1 + m β θ 2 ) α B μ a 1 ( a 2 a 3 − φ γ ) > 1 .
Therefore, the basic reproduction number is defined as follows:
R 0 = 〈 k 2 〉 〈 k 〉 a 3 ( a 1 θ 1 + m β θ 2 ) α B μ a 1 ( a 2 a 3 − φ γ ) .
Thus, a unique positive solution exists if and only if R 0 > 1 . In other words, when R 0 > 1 , only one positive equilibrium E * = { S 1 * , H 1 * , I 1 * , L 1 * , ⋯ , S n * , H n * , I n * , L n * } of system (4) exists. The proof is completed.
Remark 5.
In this paper, the existence and uniqueness of positive solutions of the model are investigated to obtain the expression of basic reproduction number R 0 . It is known that R 0 is a threshold condition to measure whether or not rumors spread. In other words, when R 0 > 1 , there will be a rumor-spreading equilibrium. Therefore, one can deduce the basic reproductive number R 0 of the model by exploring the existence and uniqueness conditions of the rumor-spreading equilibrium. The expression of basic reproduction number R 0 obtained by this method is the same as the one by the next generation matrix [40].
Based on (3), system (4) can be written as the following equivalent systems:
d S k ( t ) d t = B − α k S k ( t ) 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k ( t ) − μ S k ( t ) , d H k ( t ) d t = θ 2 α k S k ( t ) 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k ( t ) − ( β + μ ) H k ( t ) , d I k ( t ) d t = θ 1 α k S k ( t ) 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k ( t ) + m β H k ( t ) − ( γ + μ ) I k ( t ) + φ L k ( t ) , d L k ( t ) d t = γ I k ( t ) − ( φ + η + μ ) L k ( t ) .
Theorem 1.
For system (9), the rumor-free equilibrium E 0 = { B μ , 0 , 0 , 0 , ⋯ , B μ , 0 , 0 , 0 } is globally asymptotically stable if R 0 < 1 .
Proof of Theorem 1. 
Construct the Lyapunov function W 1 ( t ) as:
W 1 ( t ) = ∑ k = 1 n k p ( k ) Υ k ( t ) ,
where Υ k ( t ) = m β H k ( t ) + a 1 I k ( t ) + a 1 φ a 3 L k ( t ) .
d Υ k ( t ) d t = m β d H k ( t ) d t + a 1 d I k ( t ) d t + a 1 φ a 3 d L k ( t ) d t = m β θ 2 α k S k ( t ) 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k ( t ) − a 1 H k ( t ) + a 1 φ a 3 γ I k ( t ) − a 3 L k ( t ) + a 1 θ 1 α k S k ( t ) 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k ( t ) + m β H k ( t ) − a 2 I k ( t ) + φ L k ( t ) = m β θ 2 α S k ( t ) I k ( t ) 〈 k 2 〉 〈 k 〉 − a 1 m β H k ( t ) + a 1 θ 1 α S k ( t ) I k ( t ) 〈 k 2 〉 〈 k 〉 + a 1 m β H k ( t ) − a 1 a 2 I k ( t ) + a 1 φ L k ( t ) + a 1 φ γ a 3 I k ( t ) − a 1 φ L k ( t ) = m β θ 2 α S k ( t ) I k ( t ) 〈 k 2 〉 〈 k 〉 + a 1 θ 1 α S k ( t ) I k ( t ) 〈 k 2 〉 〈 k 〉 − a 1 a 2 I k ( t ) + a 1 φ γ a 3 I k ( t ) = a 3 ( m β θ 2 + θ 1 a 1 ) α S k ( t ) 〈 k 2 〉 〈 k 〉 − a 1 ( a 2 a 3 − φ γ ) a 3 I k ( t ) ≤ a 3 ( m β θ 2 + θ 1 a 1 ) α B 〈 k 2 〉 〈 k 〉 μ a 3 − a 1 ( a 2 a 3 − φ γ ) a 3 I k ( t ) = ( R 0 − 1 ) a 1 ( a 2 a 3 − φ γ ) a 3 I k ( t ) .
It is equivalent to the following:
d W 1 ( t ) d t = ∑ k = 1 n k p ( k ) ( R 0 − 1 ) a 1 ( a 2 a 3 − φ γ ) a 3 I k ( t ) .
As mentioned above in (11), d W 1 ( t ) d t ≤ 0 when R 0 < 1 . d W 1 ( t ) d t = 0 equivalently implies that S k ( t ) = B μ , H k ( t ) = 0 , I k ( t ) = 0 , L k ( t ) = 0 . Thus, in view of LaSalle’s Invariance Principle [41], one can get lim t → ∞ S k ( t ) = B μ , lim t → ∞ H k ( t ) = 0 , lim t → ∞ I k ( t ) = 0 , lim t → ∞ L k ( t ) = 0 . Thus, E 0 of system (9) is globally asymptotically stable when R 0 < 1 . □
Theorem 2.
The rumor-spreading equilibrium E * = { S 1 * , H 1 * , I 1 * , L 1 * , ⋯ , S n * , H n * , I n * , L n * } of system (9) is globally asymptotically stable if R 0 > 1 for the system (9).
Proof of Theorem 2.
Construct the Lyapunov function W 2 ( t ) as:
W 2 ( t ) = ∑ k = 1 n k p ( k ) V k ( t ) .
Denote
V k ( t ) = ( m β θ 2 + a 1 θ 1 ) S k * g S k ( t ) S k * + m β H k * g H k ( t ) H k * + a 1 I k * g I k ( t ) I k * + a 1 φ a 3 L k * g L k ( t ) L k * ,
where g ( n ) = n − 1 − ln n ≥ g ( 1 ) = 0 , for any n > 0 . Let
x = S k ( t ) S k * , y = H k ( t ) H k * , z = I k ( t ) I k * , u = L k ( t ) L k * .
Then, substituting the rumor-spreading equilibrium into (9), one can obtain:
B − α k S k * 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k * − μ S k * = 0 , θ 2 α k S k * 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k * − ( β + μ ) H k * = 0 , θ 1 α k S k * 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k * + m β H k * − ( γ + μ ) I k * + φ L k * = 0 , γ I k * − ( φ + η + μ ) L k * = 0 .
According to (9) and (12), one can get:
d V k ( t ) d t = ( m β θ 2 + a 1 θ 1 ) 1 − S k * S k ( t ) d S k ( t ) d t + m β 1 − H k * H k ( t ) d H k ( t ) d t + a 1 1 − I k * I k ( t ) d I k ( t ) d t + a 1 φ a 3 1 − L k * L k ( t ) d L k ( t ) d t = ( m β θ 2 + a 1 θ 1 ) 1 − S k * S k ( t ) B − α k S k ( t ) 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k ( t ) − μ S k ( t ) + m β 1 − H k * H k ( t ) θ 2 α k S k ( t ) 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k ( t ) − ( β + μ ) H k ( t ) + a 1 1 − I k * I k ( t ) ( θ 1 α k S k ( t ) 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k ( t ) + m β H ( t ) − ( γ + μ ) I k ( t ) + φ L k ( t ) ) + a 1 φ a 3 1 − L k * L k ( t ) γ I k ( t ) − ( φ + η + μ ) L k ( t ) = ( m β θ 2 + a 1 θ 1 ) 1 − S k * S k ( t ) ( α k S k * ( t ) 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k * ( t ) + μ S k * ( t ) − α k S k ( t ) × 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k ( t ) − μ S k ( t ) ) + m β 1 − H k * H k ( t ) ( θ 2 α k S k ( t ) 1 〈 k 〉 ∑ k = 1 n k p ( k ) × I k ( t ) − θ 2 α k S k * 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k * H k * H k ( t ) ) + a 1 1 − I k * I k ( t ) ( θ 1 α k S k ( t ) 1 〈 k 〉 × ∑ k = 1 n k p ( k ) I k ( t ) + m β H k ( t ) + φ L k ( t ) − θ 1 α k S k * 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k * + m β H k * + φ L k * I k * I k ( t ) ) + a 1 φ a 3 1 − L k * L k ( t ) a 3 L k * I k * I k ( t ) − a 3 L k ( t ) = ( m β θ 2 + a 1 θ 1 ) ( 1 − 1 x ) α k S k * 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k * ( 1 − x z ) + ( m β θ 2 + a 1 θ 1 ) ( 1 − 1 x ) μ S k * ( 1 − x ) + m β ( 1 − 1 y ) θ 2 α k S k * 1 〈 k 〉 ∑ k = 1 n k p ( k ) × I k * ( x z − y ) + a 1 ( 1 − 1 z ) θ 1 α k S k * 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k * ( x z − z ) + a 1 ( 1 − 1 z ) × m β H k * ( y − z ) + a 1 ( 1 − 1 z ) φ L k * ( u − z ) + a 1 φ a 3 ( 1 − 1 u ) a 3 L k * ( z − u ) = ( m β θ 2 + a 1 θ 1 ) ( 1 − 1 x − x z + z ) α k S k * 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k * + ( m β θ 2 + a 1 θ 1 ) ( 1 − 1 x − x + 1 ) μ S k * + m β θ 2 α k S k * 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k * × ( 1 − x z y + x z − y ) + a 1 θ 1 α k S k * 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k * ( x z − z − x + 1 ) + a 1 m β H k * ( y − z − y z + 1 ) + a 1 φ L k * ( u − z − u z + 1 ) + a 1 φ L k * ( z − u − z u + 1 ) = 2 ( m β θ 2 + a 1 θ 1 ) α k S k * 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k * + 2 ( m β θ 2 + a 1 θ 1 ) μ S k * + a 1 m β H k * + 2 a 1 φ L k * − μ S k * ( m β θ 2 + a 1 θ 1 ) + a 1 θ 1 α k S k * 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k * x − μ S k * ( m β θ 2 + a 1 θ 1 ) + ( a 1 θ 1 + m β θ 2 ) α k S k * 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k * 1 x + a 1 m β H k * − m β θ 2 α k S k * 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k * y + [ m β θ 2 α k S k * 1 〈 k 〉 ∑ k = 1 n k p ( k ) × I k * − a 1 m β H k * ] z − m β θ 2 α k S k * 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k * x z y − a 1 m β H k * y z − a 1 φ L k * u z − a 1 φ L k * z u = m β θ 2 α k k S k * 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k * ( 2 − 1 x − y + z − x z y ) + a 1 θ 1 α k S k * 1 〈 k 〉 ∑ k = 1 n k p ( k ) × I k * ( 2 − x − 1 x ) + μ S k * ( m β θ 2 + a 1 θ 1 ) ( 2 − x − 1 x ) + a 1 m β H k * ( 1 + y − z − y z ) + a 1 φ L k * ( 2 − u z − z u ) .
According to the second equation of (12), one can know:
m β θ 2 α k S k * 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k * = a 1 m β H k * , i . e . , m β θ 2 α 〈 k 2 〉 〈 k 〉 S k * I k * = a 1 m β H k * ,
then
d V k ( t ) d t = m β θ 2 α 〈 k 2 〉 〈 k 〉 S k * I k * ( 3 − 1 x − x z y − y z ) + a 1 θ 1 α 〈 k 2 〉 〈 k 〉 S k * I k * ( 2 − x − 1 x ) + μ S k * ( m β θ 2 + a 1 θ 1 ) ( 2 − x − 1 x ) + a 1 φ L k * ( 2 − u z − z u ) .
It is equivalent to:
d W 2 ( t ) d t = ∑ k = 1 n k p ( k ) [ m β θ 2 α 〈 k 2 〉 〈 k 〉 S k * I k * ( 3 − 1 x − x z y − y z ) + a 1 θ 1 α 〈 k 2 〉 〈 k 〉 S k * I k * ( 2 − x − 1 x ) + μ S k * ( m β θ 2 + a 1 θ 1 ) ( 2 − x − 1 x ) + a 1 φ L k * ( 2 − u z − z u ) ] .
It is worth noting that the inequality between an arithmetic mean and a geometric mean is as follows:
x 1 + x 2 + ⋯ + x n n ≥ x 1 x 2 ⋯ x n n .
As mentioned above in (13), d W 2 ( t ) d t ≤ 0 . d W 2 ( t ) d t = 0 equivalently implies that S k ( t ) = S k * , H k ( t ) = H k * , I k ( t ) = I k * , L k ( t ) = L k * . Thus, in view of LaSalle’s Invariance Principle, E * is globally asymptotically stable when R 0 > 1 . □
Remark 6.
Compared to [28], besides the heterogeneous network under consideration, a stricter proof about the global asymptotic stabilities of rumor-free and rumor-spreading equilibria are given by constructing the Lyapunov function and using LaSalle’s Invariance Principle in this paper.

4. Optimal Control

In this section, an optimal control problem for system (9) is proposed in order to reduce the number of infected individuals with minimum cost. The control strategy mentioned in this paper is media coverage. It is widely known that rumor propagation often stems from the lack of circulation of true information. When there is a lack of authoritative information, rumors are easy to spread widely. Therefore, official media coverage adopted by government departments is particularly important. The media can conduct in-depth reports and sort out the truth of the matter through various channels such as television, newspapers and the internet, so that the public can recognize and identify false news. In this way, the effect of controlling the spread of rumors is ultimately achieved. Let U k ( t ) represent the strength to control rumors through the use of media coverage. This measure can decrease the number of latent individuals who become infected individuals, reducing the probability that rumors recur. With the help of Pontryagin’s Maximum Principle [42], a Lebesgue-square integrable control function U k ( t ) ∈ Δ is introduced, where Δ = { U k ( t ) | 0 ≤ U k ( t ) ≤ 1 , t ∈ [ 0 , T ] , k = 1 , 2 , ⋯ , n } . Δ denotes the set of feasible controls and T is the ending time. Then, model (9) after adding the control mechanism is given as follows:
d S k ( t ) d t = B − α k S k ( t ) 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k ( t ) − μ S k ( t ) + φ U k ( t ) L k ( t ) , d H k ( t ) d t = θ 2 α k S k ( t ) 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k ( t ) − ( β + μ ) H k ( t ) , d I k ( t ) d t = θ 1 α k S k ( t ) 1 〈 k 〉 ∑ k = 1 n k p ( k ) I k ( t ) + m β H k ( t ) − ( γ + μ ) I k ( t ) + φ ( 1 − U k ( t ) ) L k ( t ) , d L k ( t ) d t = γ I k ( t ) − ( φ + η + μ ) L k ( t ) .
Defining the objective function as follows:
J ( U ( t ) ) = ∫ 0 T ∑ k = 1 n B 1 I k ( t ) + B 2 U k 2 ( t ) d t ,
where B 1 is the positive balancing coefficient of infected individual density I k ( t ) , and B 2 is the positive weight coefficient of control costs. In addition, U ( t ) = ( U 1 ( t ) , U 2 ( t ) , ⋯ , U n ( t ) ) . From [43], for the objective function (15) subject to model (14), there exists an optimal control U * ( t ) = ( U 1 * ( t ) , U 2 * ( t ) , ⋯ , U n * ( t ) ) ∈ Δ such that J ( U * ( t ) ) = min J ( U ( t ) ) . Therefore, this optimal control problem can be solved with the help of Pontryagin’s Maximum Principle. Define the Lagrangian as:
L ( I k ( t ) , U ( t ) ) = ∑ k = 1 n B 1 I k ( t ) + B 2 U k 2 ( t ) .
In addition, Hamiltonian function can be defined as:
Q ( S k ( t ) , H k ( t ) , I k ( t ) , L k ( t ) , U ( t ) , λ j ( t ) ) = ∑ k = 1 n Q k ( S k ( t ) , H k ( t ) , I k ( t ) , L k ( t ) , U ( t ) , λ j k ( t ) ) = L ( I k ( t ) , U ( t ) ) + ∑ k = 1 n λ 1 k ( t ) d S k ( t ) d t + λ 2 k ( t ) d H k ( t ) d t + λ 3 k ( t ) d I k ( t ) d t + λ 4 k ( t ) d L k ( t ) d t ,
where j = 1 , 2 , 3 , 4 .   λ j k ( t ) is a Lagrange multiplier with k = 1 , 2 , ⋯ , n . After the above analysis, one can draw the following conclusions.
Theorem 3.
The optimal control problems (14) and (15) admit an optimal solution ( S ^ k ( t ) , H ^ k ( t ) , I ^ k ( t ) , L ^ k ( t ) ) accompanied by the optimal control U k * ( t ) on (0,T) for k = 1 , 2 , ⋯ , n .
The optimal media report control strategy U k * ( t ) is computed by:
U k * ( t ) = max { min { 1 , ( λ 3 k ( t ) − λ 1 k ( t ) ) φ L k ( t ) 2 B 2 } , 0 } , k = 1 , 2 , ⋯ , n .
where the adjoint function λ j k ( t ) ( j = 1 , 2 , 3 , 4 , k = 1 , 2 , ⋯ , n . ) satisfying:
d λ 1 k ( t ) d t = λ 1 k ( t ) α k ∑ k = 1 n k p ( k ) 1 〈 k 〉 I ^ k ( t ) + μ λ 1 k ( t ) − λ 2 k ( t ) θ 2 α k ∑ k = 1 n k p ( k ) 1 〈 k 〉 I ^ k ( t ) − λ 3 k ( t ) θ 1 α k ∑ k = 1 n k p ( k ) 1 〈 k 〉 I ^ k ( t ) , d λ 2 k ( t ) d t = ( β + μ ) λ 2 k ( t ) − m β λ 3 k ( t ) , d λ 3 k ( t ) d t = − B 1 + λ 1 k ( t ) α k k ( t ) k p ( k ) 〈 k 〉 S ^ k ( t ) − λ 2 k ( t ) θ 2 α k k p ( k ) 〈 k 〉 S ^ k ( t ) ) − λ 3 k ( t ) θ 1 α k k p ( k ) 〈 k 〉 S ^ k ( t ) + ( μ + γ ) λ 3 k ( t ) − γ λ 4 k ( t ) , d λ 4 k ( t ) d t = ( λ 3 k ( t ) − λ 1 k ( t ) ) φ U k * ( t ) − φ λ 3 k ( t ) + λ 4 k ( t ) ( φ + η + μ ) .
The transversality conditions are λ j k ( T ) = 0 , j = 1 , 2 , 3 , 4 .
Proof of Theorem 3. 
By the optimal conditions, one can obtain
∂ Q ∂ U k | S k ( t ) = S k * , H k ( t ) = H k * , I k ( t ) = I k * , L k ( t ) = L k * = 2 B 2 U k * ( t ) + λ 1 k ( t ) φ L k ( t ) − λ 3 k ( t ) φ L k ( t ) = 0 .
Thus, U k * ( t ) = ( λ 3 k ( t ) − λ 1 k ( t ) ) φ L k ( t ) 2 B 2 .
Considering the properties of Hamiltonian functions and the range of the control variable, one obtains:
U k * ( t ) = 0 , if ( λ 3 k ( t ) − λ 1 k ( t ) ) φ L k ( t ) 2 B 2 ≤ 0 ( λ 3 k ( t ) − λ 1 k ( t ) ) φ L k ( t ) 2 B 2 , if 0 ≤ ( λ 3 k ( t ) − λ 1 k ( t ) ) φ L k ( t ) 2 B 2 ≤ 1 1 , if ( λ 3 k ( t ) − λ 1 k ( t ) ) φ L k ( t ) 2 B 2 > 1 .
Therefore, the optimal control is obtained as follows:
U k * ( t ) = max { min { 1 , ( λ 3 k ( t ) − λ 1 k ( t ) ) φ L k ( t ) 2 B 2 } , 0 } , k = 1 , 2 , ⋯ , n .
□

5. Numerical Simulations

In this section, several numerical examples are given to test the correctness of the above theoretical results. Our studies are performed in a BA scale-free network with a power law degree distribution: p ( k ) = 2 l ( l + 1 ) k ( k + 1 ) ( k + 2 ) ∝ 2 l 2 k − 3 , where l is the minimum degree of the addressed network. Select the maximum degree of the nodes in the networks as 100. The calculation shows that 〈 k 〉 = ∑ k = 1 n k p ( k ) = 3.27 .
In order to study the role of basic reproduction number R 0 on rumor propagation, we chose two sets of parameter values to explore the process of rumor propagation when the basic reproduction number R 0 < 1 and R 0 > 1 .
Firstly, take n = 100 , B = 0.02 , α = 0.2 , β = 0.1 , γ = 0.16 , μ = 0.02 , θ 1 = 0.15 , θ 2 = 0.2 , η = 0.2 , φ = 0.1 , m = 0.02 . After simple calculation, we can get R 0 = 0.7484 < 1 . Based on Theorem 1, the rumor-free equilibrium E 0 is globally asymptotically stable as depicted in Figure 2. Figure 2a,b shows the evolution of ( S k ( t ) , H k ( t ) , I k ( t ) , L k ( t ) , R k ( t ) ) with degree taking from 1 to 50. Thus, we can draw a conclusion that even with different values for k, rumors will die out eventually and the density of infected individuals will converge to zero when R 0 < 1 . Figure 2c,d is drawn by fixing the degree k = 50 and keeping other parameter values the same as in Figure 2a,b. The evolution of ( H 50 ( t ) , I 50 ( t ) , L 50 ( t ) ) under different initial values shows that the rumor will die out eventually. It should be noted that all state trajectories converge to rumor-free equilibrium E 0 , so rumor-free equilibrium E 0 is globally asymptotically stable.
Secondly, take n = 100 , B = 0.02 , α = 0.35 , β = 0.1 , γ = 0.2 , μ = 0.02 , θ 1 = 0.3 , θ 2 = 0.2 , η = 0.2 , φ = 0.1 , m = 0.4 , which results in R 0 = 2.5852 > 1 . Based on Theorem 2, the rumor-spreading equilibrium E * is globally asymptotically stable as depicted in Figure 3. Figure 3a,b shows the evolution of ( S k ( t ) , H k ( t ) , I k ( t ) , L k ( t ) , R k ( t ) ) with degree taking from 1 to 50. These two pictures show that with regard to different values for k, rumors will continue to prevail and the density of all state individuals will converge to E * when R 0 > 1 . Furthermore, with the increase of degree k, the peak density and the final scale of rumor infected individuals also increase. In real life, everyone has a different number of friends. Those with good social skills have a greater impact on the spread of rumors, which is more realistic. Additionally, Figure 3c,d is drawn by fixing the degree k = 50 and keeping other parameter values the same as Figure 3a,b. The evolution of ( H 50 ( t ) , I 50 ( t ) , L 50 ( t ) ) under different initial values shows that the rumor will continue to prevail. Note that all state trajectories converge to rumor-spreading equilibrium E * , so rumor-spreading equilibrium E * is globally asymptotically stable.
In the following, the effect of degree k on rumor propagation is studied. Choose B = 0.02 , α = 0.35 , β = 0.1 , γ = 0.2 , μ = 0.02 , θ 1 = 0.3 , θ 2 = 0.2 , η = 0.2 , φ = 0.1 , m = 0.4 . Fix the set of parameter values of R 0 > 1 except degree k changes from 1 to 5. In this case, the rumor will continue spreading. The plots in Figure 4 show that the peak density of S k ( t ) decreases with increasing k and the peak density of I k ( t ) increases with increasing k. This means the degree of the network will affect the maximum scale of rumor spread. The greater the degree of the network, the larger the scale of rumor spreading. Generally speaking, degree k is conducive to the rumor propagation.
Considering the controlled system (14), the parameters are shown as following. Choose n = 100 , B = 0.02 ,   α = 0.35 ,   β = 0.1 ,   γ = 0.2 ,   μ = 0.02 ,   θ 1 = 0.3 ,   θ 2 = 0.2 ,   η = 0.2 ,   φ = 0.18 , m = 0.4 , B 1 = 5 ,   B 2 = 0.2 , which leads to rumor propagation. In order to study the influence of optimal control on system (14), we simulate the trajectories of system (14) with and without optimal control, as shown in Figure 5. Through observation, we find that the density of rumor infected individuals under optimal control is lower than that of rumor infected individuals without optimal control. In other words, the density of infected individuals decreases under optimal control. Therefore, we can draw the conclusion that the optimal control strategy proposed in this paper can effectively suppress the spread of rumors.
The trajectories of optimal control and control cost over time are shown in Figure 6a,b, respectively. It can be seen in Figure 6a that the control intensity is larger at the initial time, and the control intensity gradually decreases to 0. This means that it is easier to control rumor propagation later after high control investment in the early stage. In other words, in the process of rumor propagation, the control intensity will gradually decrease. It can be seen in Figure 6b that control consumption J ( t ) reaches the maximum value at t = 10 , which is in line with the actual situation. In actuality, total control consumption will increase with the increase of control time.

6. Model Application

In this section, a practical example is used to verify the validity of the theoretical results.
This paper uses the actual data supplied in Hu and Zhao [44], which presents a rumor about haze. Relevant data about the number of people spreading rumors over time is shown in Table 1. In particular, it is assumed that the rumor is spread without rumor recurrence.
In Figure 7, we fit the established model (4) with the real rumor propagation example. In Figure 7a, we take α = 0.95 ,   β = 0.1 ,   γ = 0.16 , μ = 0.002 ,   θ 1 = 0.85 ,   θ 2 = 0.02 , η = 0.7 , φ = 0.1 ,   m = 0.02 . It is found that the data fitting effect is better from the 20th hour of rumor spreading. In the early stage of rumor propagation, the established models obviously peak earlier than the rumor in the practical example. The reason for this may be time delay in rumor propagation, we simulate the case where time delay is equal to three in Figure 7b. Time delay can not only prolong the outbreak time of rumors, but can also reduce the peak of rumors.
Remark 7.
The numerical fitting results of real cases indicate that time delay has a great impact on the spread of rumors. Time delay not only can prolong the outbreak time of rumors, but also reduce the peak density of I ( t ) . Therefore, it is necessary to take time delay into account in future research.
From Table 1, it is found that when T = 20 h, the rumor quickly vanished with the intervention of the media. Therefore, we apply the control proposed in system (14) at T = 20 h to reveal the evolution of rumor individual density. The densities of rumor-spreading individuals can be seen in Figure 8. Obviously, the path with control is highly consistent with the actual data. Therefore, the control strategy is effective.
Remark 8.
This paper studies the dynamics of rumor propagation in heterogeneous networks. In fact, there are many factors to be taken into consideration, such as reaction–diffusion in space [45], time delays [46] and so on. In addition, it is helpful for us to consider several novel rumor propagation mechanisms to understand rumor propagation. Recently, Zhu et al. discussed individuals’ dynamic friendship in [47], and Liu et al. considered competitive information dissemination in [48]. These works have broadened our research perspective. There is an expectation to implement more laws to control rumor propagation so as to better control rumors. Therefore, it is necessary to take the above factors into consideration in future work.

7. Conclusions

In this paper, a novel rumor spreading model with consideration of recurrence, individual behavior and an optimal media coverage control strategy is proposed in heterogeneous networks (e.g., BA scale-free network). The dynamics of the model are explored with the help of the mean field equation. Some useful conclusions are drawn in order to ensure globally asymptotically stable rumor-free equilibrium and rumor-spreading equilibrium in heterogeneous networks with Lyapunov method and LaSalle’s Invariance Principle. In addition, optimal control is acquired by taking advantage of Pontryagin’s Maximum Principle. The results are checked through a number of experiments. Moreover, based on practice, a model application is presented to explain the rationality of the established model and the proposed optimal control. Furthermore, in the future, we will research the dynamics of the SHILR model with time delays and age structure, which is more complicated but more realistic.

Author Contributions

Conceptualization, X.T. and H.J.; methodology, X.T. and X.C.; software, X.T.; validation, X.T., H.J., X.C., S.Y. and J.L.; writing—original draft preparation, X.T.; writing—review and editing, X.T., S.Y. and J.L.; supervision, H.J.; project administration, H.J.; funding acquisition, H.J. All authors have read and agreed to the published version of the manuscript.

Funding

This study was supported in part by the National Natural Science Foundation of China under Grant no. U1703262, 62163035, 12026235 and 62173175 and in part by the Tianshan Innovation Team Program under Grant no. 2020D14017, Graduate Innovation Program of Xinjiang Uygur Autonomous Region under Grant no. XJ2021G019 and Xinjiang Key Laboratory of Applied Mathematics XJDX1401.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

References

  1. Peterson, W.; Gist, N. Rumor and public opinion. Am. J. Econ. Sociol. 1951, 57, 159–167. [Google Scholar] [CrossRef]
  2. Chierichetti, F.; Lattanzi, S.; Panconesi, A. Rumor spreading in social networks. Lect. Notes Comput. Sci. 2011, 412, 2602–2610. [Google Scholar] [CrossRef] [Green Version]
  3. Galam, S. Modelling rumors: The no plane pentagon French hoax case. Physica A 2003, 320, 571–580. [Google Scholar] [CrossRef] [Green Version]
  4. Daley, D.; Kendall, D. Epidemics and rumours. Nature 1964, 204, 1118. [Google Scholar] [CrossRef]
  5. Maki, D.; Thompson, M. Mathematical Models and Applications, with Emphasis on the Social, Life, and Management Sciences; Prentice-Hall: Englewood Cliffs, NJ, USA, 1973. [Google Scholar]
  6. Zanette, D. Critical behavior of propagation on small-world networks. Phys. Rev. E 2001, 64, 050901. [Google Scholar] [CrossRef] [Green Version]
  7. Zanette, D. Dynamics of rumor propagation on small-world networks. Phys. Rev. E 2002, 64, 041908. [Google Scholar] [CrossRef] [Green Version]
  8. Chen, G. ILSCR rumor spreading model to discuss the control of rumor spreading in emergency. Physica A 2019, 522, 88–97. [Google Scholar] [CrossRef]
  9. Yang, A.; Huang, X.; Cai, X.; Zhu, X.; Lu, L. ILSR rumor spreading model with degree in complex network. Physica A 2019, 531, 121807. [Google Scholar] [CrossRef]
  10. Tian, Y.; Ding, X. Rumor spreading model with considering debunking behavior in emergencies. Appl. Math. Comput. 2019, 363, 124599. [Google Scholar] [CrossRef]
  11. He, Z.; Cai, Z.; Yu, J.; Wang, X.; Sun, Y.; Li, Y. Cost-efficient strategies for restraining rumor spreading in mobile social networks. IEEE Trans. Veh. Technol. 2017, 66, 2789–2800. [Google Scholar] [CrossRef]
  12. Lu, P. Heterogeneity, judgment and social trust of agents in rumor spreading. Appl. Math. Comput. 2019, 350, 447–461. [Google Scholar] [CrossRef]
  13. Liu, W.; Wu, X.; Yang, W.; Zhu, X.; Zhong, S. Modeling cyber rumor spreading over mobile social networks: A compartment approach. Appl. Math. Comput. 2019, 359, 374–385. [Google Scholar] [CrossRef]
  14. Wang, Z.; Liang, J.; Nie, H.; Zhao, H. A 3SI3R model for the propagation of two rumors with mutual promotion. Adv. Differ. Equ. 2020, 109, 1–19. [Google Scholar] [CrossRef]
  15. Jain, A.; Dhar, J.; Gupta, V. Rumor model on homogeneous social network incorporating delay in expert intervention and government action. Commun. Nonlinear Sci. 2020, 84, 105189. [Google Scholar] [CrossRef]
  16. Liu, Y.; Xu, S.; Tourassi, G. Detecting rumors through modeling information propagation networks in a social media environment. IEEE Trans. Comput. Soc. Syst. 2017, 3, 46–62. [Google Scholar] [CrossRef] [Green Version]
  17. Hosseini, S.; Azgomi, M. The dynamics of an SEIRS-QV malware propagation model in heterogeneous networks. Physica A 2018, 512, 803–817. [Google Scholar] [CrossRef]
  18. Liu, Q.; Li, T.; Sun, M. The analysis of an SEIR rumor propagation model on heterogeneous network. Physica A 2017, 469, 372–380. [Google Scholar] [CrossRef]
  19. Ma, J.; Zhu, H. Rumor diffusion in heterogeneous networks by considering the individuals subjective judgment and diverse characteristics. Physica A 2018, 499, 276–287. [Google Scholar] [CrossRef]
  20. Zhu, L.; Liu, W.; Zhang, Z. Delay differential equations modeling of rumor propagation in both homogeneous and heterogeneous networks with a forced silence function. Appl. Math. Comput. 2020, 370, 124925. [Google Scholar] [CrossRef]
  21. Zan, Y.; Wu, J. SICR rumor spreading model in complex networks, counterattack and self-resistance. Physica A 2014, 405, 159–170. [Google Scholar] [CrossRef]
  22. Wang, Y.; Yang, X. Rumor spreading model with trust mechanism in complex social networks. Commun. Theor. Phys. 2013, 59, 510–516. [Google Scholar] [CrossRef]
  23. Xia, L.; Jiang, G. Rumor spreading model considering hesitating mechanism in complex social network. Physica A 2015, 437, 295–303. [Google Scholar] [CrossRef]
  24. Al-Tuwairqi, S.; Al-Sheikh, S.; Al-Amoudi, R. Qualitative analysis of a rumor transmission model with incubation mechanism. Open Access Libr. J. 2015, 11, 1–12. [Google Scholar] [CrossRef]
  25. Zhao, L.; Cui, H.; Qiu, X. SIR rumor spreading model in the new media age. Physica A 2013, 4, 995–1003. [Google Scholar] [CrossRef]
  26. Zhang, N.; Huang, H.; Su, B. Dynamic 8-state ICSAR rumor propagation model considering official rumor refutation. Physica A 2014, 415, 333–346. [Google Scholar] [CrossRef]
  27. Wang, C.; Dai, Z. Various breathers and rogue waves for the coupled long-wave-short-wave system. Adv. Differ. Equ. 2014, 87, 1–10. [Google Scholar] [CrossRef] [Green Version]
  28. Yao, Y.; Xiao, X.; Zhang, C. Stability analysis of an SDILR model based on rumor recurrence on social media. Physica A 2019, 535, 122–236. [Google Scholar] [CrossRef]
  29. Hu, Y.; Pan, Q.; Hou, W.; He, M. Rumor spreading model with the different attitudes towards rumors. Physica A 2003, 502, 31–344. [Google Scholar] [CrossRef]
  30. Allport, G.; Postman, L. The Psychology of Rumor; Henry Holt: New York, NY, USA, 1947. [Google Scholar]
  31. Allport, G.; Postman, L. An analysis of rumor. Public Opin. Q. 1947, 10, 501–517. [Google Scholar] [CrossRef]
  32. Zhu, L.; Zhao, H. Dynamical behaviours and control measures of rumour-spreading model with consideration of network topology. Int. J. Syst. Sci. 2017, 48, 2046–2078. [Google Scholar] [CrossRef]
  33. Li, J.; Jiang, H.; Mei, X.; Hu, C.; Zhang, G. Dynamical analysis of rumor spreading model in 337 multi-lingual environment and heterogeneous complex networks. Inf. Sci. 2020, 536, 391–408. [Google Scholar] [CrossRef]
  34. Jacob, R.; Harikrishnan, K.; Misra, R.; Ambika, G. Measure for degree heterogeneity in complex networks and its application to recurrence network analysis. R. Soc. Open Sci. 2017, 4, 160757. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  35. Yang, S.; Jiang, H.; Hu, C. Dynamics of the rumor-spreading model with hesitation mechanism in heterogeneous networks and bilingual environment. Adv. Differ. Equ. 2020, 2020, 628. [Google Scholar] [CrossRef]
  36. Xia, C.; Liu, Z.; Chen, Z.; Sun, S.; Yuan, Z. Epidemic spreading behavior in local-world evolving networks. Prog. Nat. Sci. 2008, 18, 763–768. [Google Scholar] [CrossRef]
  37. Barthélemy, M.; Barrat, A.; Pastor-Satorras, R.; Vespignani, A. Dynamical patterns of epidemic outbreaks in complex heterogeneous networks. J. Theor. Biol. 2005, 235, 275–288. [Google Scholar] [CrossRef] [Green Version]
  38. Liu, X.; Li, T.; Tian, M. Rumor spreading of a SEIR model in complex social networks with hesitating mechanism. Adv. Differ. Equ. 2018, 391, 1–24. [Google Scholar] [CrossRef] [Green Version]
  39. Wan, C.; Li, T.; Sun, Z. Global stability of a SEIR rumor spreading model with demographics on scale-free networks. Adv. Differ. Equ. 2017, 253, 1–15. [Google Scholar] [CrossRef] [Green Version]
  40. Driessche, P.; Watmough, J. Reproduction numbers and subthreshold endemic equilibria for compartmental models of disease transmission. Math. Biosci. 2002, 180, 29–48. [Google Scholar] [CrossRef]
  41. Lasalle, J. The Stability of Dynamical Systems; Society for Industrial and Applied Mathematics: Philadelphia, PA, USA, 1976. [Google Scholar]
  42. Lenhart, S.; Workman, J. Optimal Control Applied to Biological Models; CRC Press: Boca Raton, FL, USA, 2007. [Google Scholar]
  43. Fleming, W.; Rishel, R. Deterministic and Stochastic Optimal Control; Springer: New York, NY, USA, 1975. [Google Scholar]
  44. Hu, M.; Zhao, H. The Establishment, Analysis and Controlling of the Rumors Spreading Model on Networks. Bachelor Thesis, Nanjing University of Aeronautics and Astronautics, Nanjing, China, 2018. [Google Scholar]
  45. Zhu, L.; Wang, X.; Zhang, Z.; Lei, C. Spatial dynamics and optimization method for a rumor propagation model in both homogeneous and heterogeneous environment. Nonlinear Dyn. 2021, 105, 3791–3817. [Google Scholar] [CrossRef]
  46. Zhu, L.; Zhou, M.; Zhang, Z. Dynamical analysis and control strategies of rumor spreading models in both homogeneous and heterogeneous networks. J. Nonlinear Sci. 2020, 30, 2545–2576. [Google Scholar] [CrossRef]
  47. Zhu, H.; Ma, J. Analysis of SHIR rumor propagation in random heterogeneous networks with dynamic friendships. Physica A 2019, 513, 257–271. [Google Scholar] [CrossRef]
  48. Liu, Y.; Diao, S.; Zhu, Y.; Liu, Q. SHIR competitive information diffusion model for online social media. Physica A 2016, 461, 543–553. [Google Scholar] [CrossRef]
Entropy 24 00464 g001 550
Figure 1. Structure of the SHILR rumor spreading process.
Figure 1. Structure of the SHILR rumor spreading process.
Entropy 24 00464 g001
Entropy 24 00464 g002 550
Figure 2. (a–d) The stability of E 0 for model (9) with R 0 < 1 .
Figure 2. (a–d) The stability of E 0 for model (9) with R 0 < 1 .
Entropy 24 00464 g002
Entropy 24 00464 g003 550
Figure 3. (a–d) The stability of E * for model (9) with R 0 > 1 .
Figure 3. (a–d) The stability of E * for model (9) with R 0 > 1 .
Entropy 24 00464 g003
Entropy 24 00464 g004 550
Figure 4. The densities of (a) S k ( t ) and (b) I k ( t ) with different values of k.
Figure 4. The densities of (a) S k ( t ) and (b) I k ( t ) with different values of k.
Entropy 24 00464 g004
Entropy 24 00464 g005 550
Figure 5. I 10 ( t ) with optimal control (blue) and without optimal control (red).
Figure 5. I 10 ( t ) with optimal control (blue) and without optimal control (red).
Entropy 24 00464 g005
Entropy 24 00464 g006 550
Figure 6. The path of optimal control (a) and control costs (b).
Figure 6. The path of optimal control (a) and control costs (b).
Entropy 24 00464 g006
Entropy 24 00464 g007 550
Figure 7. (a,b) Number of individuals spreading the rumor.
Figure 7. (a,b) Number of individuals spreading the rumor.
Entropy 24 00464 g007
Entropy 24 00464 g008 550
Figure 8. Number of individuals spreading rumors.
Figure 8. Number of individuals spreading rumors.
Entropy 24 00464 g008
Table
Table 1. Number of individuals spreading the rumor.
Table 1. Number of individuals spreading the rumor.
Time1 h2 h3 h4 h5 h6 h7 h8 h9 h10 h
Number21093167603464368361511480662
Time11 h12 h13 h14 h15 h16 h17 h18 h19 h20 h
Number6355176758891221413557573745396
Time21 h22 h23 h24 h25 h26 h27 h28 h29 h30 h
Number32226218475624338232412
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Tong, X.; Jiang, H.; Chen, X.; Yu, S.; Li, J. Dynamic Analysis and Optimal Control of Rumor Spreading Model with Recurrence and Individual Behaviors in Heterogeneous Networks. Entropy 2022, 24, 464. https://doi.org/10.3390/e24040464

AMA Style

Tong X, Jiang H, Chen X, Yu S, Li J. Dynamic Analysis and Optimal Control of Rumor Spreading Model with Recurrence and Individual Behaviors in Heterogeneous Networks. Entropy. 2022; 24(4):464. https://doi.org/10.3390/e24040464

Chicago/Turabian Style

Tong, Xinru, Haijun Jiang, Xiangyong Chen, Shuzhen Yu, and Jiarong Li. 2022. "Dynamic Analysis and Optimal Control of Rumor Spreading Model with Recurrence and Individual Behaviors in Heterogeneous Networks" Entropy 24, no. 4: 464. https://doi.org/10.3390/e24040464

APA Style

Tong, X., Jiang, H., Chen, X., Yu, S., & Li, J. (2022). Dynamic Analysis and Optimal Control of Rumor Spreading Model with Recurrence and Individual Behaviors in Heterogeneous Networks. Entropy, 24(4), 464. https://doi.org/10.3390/e24040464

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