Skip to main content

ORIGINAL RESEARCH article

Front. Phys., 31 October 2023
Sec. Social Physics
This article is part of the Research Topic Compartmental Models for Social Interactions View all 6 articles

Competitive information propagation considering local-global prevalence on multi-layer interconnected networks

Li Cao
Li Cao1*Haibo ZhaoHaibo Zhao2Xiaoying WangXiaoying Wang1Xuming AnXuming An3
  • 1School of Business Administration, Shandong Women’s University, Ji’nan, Shandong, China
  • 2Shandong Internet Emergency Command Center, Committee Network Information Office of Shandong Provincial Party, Ji’nan, Shandong, China
  • 3Department of Industrial Engineering, Tsinghua University, Beijing, China

The popularity of online social networks (OSNs) promotes the co-propagation of multiple types of information. And there exist inevitably competitive interactions between these information, which will significantly affect the spreading trend of each information. Besides, the coupled topology of multi-layer interconnects exhibited in OSNs will also increase the research complexity of information propagation dynamics. To effectively address these challenges, we propose a novel competitive information propagation model on multi-layer interconnected networks, where the tendency of an individual to become a positive or negative spreader depends on the weighted consideration of local and global prevalence. Then the basic reproduction number is calculated via next-generation matrix method. And under the critical conditions of the basic reproduction number, the asymptotic stability of information-free and information-endemic equilibria is theoretically proven through Lyapunov stability theory. Besides, an optimal control problem involving two heterogeneous controls is formulated, aiming at achieving the best suppression performance of negative information with the minimum control cost. According to Cesari theorem and Pontryagin minimum principle, the existence and analytical formulation of optimal solutions are derived. Extensive numerical experiments are conducted to prove the correctness of our theoretical results, and evaluate the effectiveness of our proposed control strategies. This study can provide useful insights into the modeling and control of multiple information propagation considering multi-layer network topology and individual adaptive behavior.

1 Introduction

With the continuous development of modern technology, online social networks (OSNs) have gradually become essential mediums for people to exchange opinions, which contributes to large-scale information propagation in different forms including rumor, awareness, influence and so on. It is well-known that the ubiquitous information propagation will significantly affect human daily life in turn. In particular, the spread of positive influence involving a certain city will help it absorb more talents and accelerate its productivity [13]. The awareness propagation about COVID-19 protection may save many human lives and reduce unnecessary economic losses [47]. And the rumor spreading about side effects of vaccine therapy can decrease the vaccination rates and hinder the effectiveness of disease interventions [810]. Therefore, exploring the dynamical process of information propagation is of great practical significance and has attracted much attention from the academic community. A large number of related work has followed on the mathematical modeling of information propagation dynamics, employing classical SIS, SIR and other derivative models. For example, Yu et al. [11] established an ignorance-discussant-spreader-remover rumor spreading model, and analyzed the local asymptotic stability of four equilibria. Yin et al. [12] took into account the emotion categories and choices of user communities on OSNs, and constructed an emotion-based susceptible-forwarding-immune propagation dynamic model to investigate the evolution process of emotional information and guide public sentiment. Zhu et al. [13] proposed a novel susceptible-latent-breaking-recovered propagation model to explore the dynamic behavior of industrial viruses in the SCADA system.

However, a considerable amount of previous work assumes that only single information propagates on OSNs, which is far beyond the practical case. In view of the individuals’ differences including nationality, ethnicity, education and personality, their opinions towards a specific event is generally diverged into two opposite sides, which can be considered as positive information and negative information. Typically, different groups of people always have different evaluations on a city, where local residents tend to prefer good evaluations, while nonresidents may make bad evaluations due to their terrible experiences. Then good evaluations promote the spread of positive influences, and bad evaluations lead to the spread of negative influences [1416]. The effectiveness of COVID-19 prevention measures, such as vaccination and physical distancing, also simultaneously spreads through the crowd in dual forms of rumor and truth [1721]. In particular, the government will disclose the truth about the effectiveness of prevention measures, and the supporters may actively promote the spread of truth. However, some opponents inevitably worry about the side effects of prevention measures and spread rumors. More attention should be paid to the spreading process of competitive information, so that the interaction between multiple information can more truly reflect the complexity of information propagation on OSNs. On the other hand, OSNs also form a multi-layer structure due to the clustering nature of the population, and the coupling between any layers will significantly affect the dynamic trend and steady-state prevalence of information propagation compared to single-layer networks. Antonopoulos et al. [22] studied the opinion dynamics over multiplex networks with heterogeneous confidence thresholds and general initial opinion distributions. Through probability analysis, they derived the analytical expressions for the critical thresholds of confidence bound considering certain regularity conditions of the networks, which reveals the significant impacts of structural multiplexity and initial distribution on the critical thresholds. Furthermore, their numerical simulations also explored the consensus behavior of agents in diverse network topologies. Yin et al. [23] constructed an environment-based susceptible-forwarding-immune model of information propagation on multi-platform networks, which reflects the complexity of actual social network topologies and the interaction between various social platforms. They also parameterized the model using COVID-19 data, and conducted the parameter sensitivity analysis. Wang et al. [24] investigated the multi-lingual SIR dynamic process of rumor spreading, which regarded each language community as a layer, and establish the rumor cross-transmitted mechanism in different lingual environments. Both the basic reproduction number and the stability of the rumor-free/endemic equilibrium were systematically discussed. These studies reveal many new characteristics how multi-layer network topologies intervene information propagation trend. However, although lots of work has separately investigated the potential effects of multiple information coexistence and multi-layer network topology, the attempts to synthesize the two aspects may reveal more interesting conclusions, which have not been well explored. Therefore, in order to more comprehensively explore the information propagation dynamics on OSNs, an improved model taking both the multiple information interaction and multi-layer interconnected networks needs to be further developed and analyzed.

Actually, individuals in OSNs are not only the carriers of information propagation, but also take certain adaptive behaviors according to the information prevalence. The herd behavior that individuals tend to follow others when making decisions is one of the most common social behaviors, and has recently attracted substantial attention from the research community [2528]. However, to the best of our knowledge, there is few work to introduce individual herd behavior into the multiple information propagation on multi-layer networks, where herd behavior may change the mechanism of state transition and thus determine the dominance relationship between multiple information. Under the framework of multiple information propagation, each individual may consider both the local situation of its neighbors and the global situation of all individuals before deciding which type of information to spread. This adaptive herd behavior will affect the coupling characteristics between multiple information, and interfere with the evolution trend and prevalence of various information. Therefore, the consideration of individual herd decision-making behavior will also improve our understanding of information propagation dynamics.

One of the primary purposes for modeling information propagation is to control the spreading processes of interest. There are two main streams of control strategies, namely, heuristic control and optimal control [2933]. Heuristic control strategy employs the real-time information prevalence to construct adaptive control function, aiming to effectively suppress/promote the specific information spreading, while optimal control strategy constructs the adaptive control function to maximize/minimize a well-designed objective function. Lin et al. [34] established a novel SWIR model with uncertain mental state to describe the spreading process of fraudulent information, and further formulated an optimal problem of two synergistic control strategies to minimize the total cost constraint involving individual losses and control resource consumption. Li et al. [35] proposed a multifactor-based information model considering information content and node characteristics, and also constructed an efficient heuristic algorithm of seed nodes selection to solve the targeted influence maximization problem. Wang et al. [36] proposed a novel computational model to present the temporal dynamics of the positive and negative information spread, and devised a nonlinear feedback control mechanism to perform three synergetic intervention strategies with minimal system expenses. During multiple information propagation, our control strategies are aimed at promoting the diffusion of positive information and suppressing the outbreak of negative information. Due to the resource limitations in reality, decision-makers always attempt to achieve the most powerful suppress performance of negative information with the lowest control intensity, which forms a trade-off between control cost and propagation cost. This trade-off can be formulated as an optimization problem, and the corresponding optimal solutions need to be further discussed, which can provide theoretical guidance and reference significance for practical resource scheduling.

Motivated by the above analysis, we aim to develop a novel framework that can integrate competitive information propagation, multi-layer interconnected networks and individual adaptive behavior. Our main contributions are summarized as follows.

• We propose a novel competitive information propagation model on multi-layer interconnected networks. This model can not only efficiently describe the competing phenomenon of positive and negative information coexistence in the real world, but also analyze the correlation between information propagation and multi-layer topology in OSNs;

• We construct a novel compartmental model with individual herd behavior towards information propagation, where the individual’s inclination to be a positive or negative spreader depends on a weighted balance between global and local information prevalence. This consideration reflects the coupled characteristics of individual response and information propagation, that is, individuals generally take adaptive behavior towards the received information, and this behavior may further affect the trend of information propagation;

• We analytically deduce the basic reproduction number R0 of our proposed model, and respectively discuss the stability of information-free equilibrium and information-endemic equilibrium using Lyapunov theorem, that is, when R0<1, our dynamic system will converge to a stable information-free equilibrium; when R0>1, our dynamic system will also converge to a stable information-endemic equilibrium;

• We design two heterogeneous controls to suppress the prevalence of negative information. Considering the cost constraints in reality, we construct an optimization problem involving a trade-off between the negative propagation cost and the control cost. To solve the optimization problem, we further discuss the existence, the analytic formulation and the uniqueness of the optimal solution.

The rest of this paper is organized as follows. In Section 2, a competitive information propagation model is formulated within the framework of multi-layer interconnected network. Stability analysis of information-free and information-endemic equilibria is carried out in Section 3. The formulation of optimal control problem is conducted to discuss the existence, analytic formulation and uniqueness of the optimal solution in Section 4. Extensive numerical simulations are conducted to verify our presented theoretical results in Section 5. Some conclusions are drawn in Section 6.

2 Model formulation and Preliminaries

In this section, we formulate a spreading model SIAIBHR of competitive negative and positive information on multi-layer interconnected networks.

For simplicity, we here consider a two-layer interconnected network and denote them as layers 1 and 2 respectively, whose relevant conclusions can be easily generalized to the other cases of multi-layer networks with more layers. These two layers can be depicted as different countries, cities or communities in the real world. The individuals on two respective layers belong to different groups. Each individual has both the neighbors within the same layer and the acquaintances within other layer, which contributes to the intra-layer and inter-layer edges. Then denote the intra-layer average degree of the layer 1 and 2 as k1 and k2 respectively. And the inter-layer average degree from layer 1 to layer 2 is also denoted as k12, and the similar definition holds for k21. The diagram of multi-layer interconnected networks is shown in Figure 1A.

FIGURE 1
www.frontiersin.org

FIGURE 1. The schematic diagram of (A) multi-layer interconnected networks and (B) state transition mechanism.

During the spreading dynamics SIAIBHR, all individuals are divided into five status compartments: Susceptible (S), Infected by positive information (IA), Infected by negative information (IB), Hesitate (H) and Recovered (R). Specifically, S state represents an individual who is unknown to any type of information but potentially infected via its intra-layer or inter-layer edges; IA state represents a spreader who is infected with positive information; IB state represents a spreader who is infected with negative information; H state represents an individual who has received two types of information but is hesitant to become which one; R state represents an individual who has no interest in spreading either positive or negative information. We further define the state density of S, IA, IB, H, R in layer 1 and 2 at time t as S1(t), S2(t), I1A(t), I2A(t), I2B(t), I2B(t), H1(t), H2(t), R1(t), R2(t), respectively.

Considering that the dynamic process of information propagation has the same time scale as the evolution of involved population numbers, we introduce the birth and mortality rates of population dynamics. And the birth rate and mortality rate of our dynamics are presented as ξ and δ respectively. Denote R+5 the nonnegative cone and its lower dimensional face. Thus, we can study the SIAIBHR model in the following feasible region

Ω=Sit,IiAt,IiBt,Hit,RitR+5Sit+IiAt+IiBt+Hit+Ritξδ.(2.1)

The birth rate will increase the quantitative basis of susceptible individuals, which can potentially raise the infection risk in the population and promote the information prevalence. And the opposite condition holds for the mortality rate. The relative size of birth and mortality rates determines the evolutionary trend of population numbers. In real life, both birth and mortality rates have two meanings: 1) For the birth rate, on the one hand, it refers to natural birth rate, which means that the initial population can give birth to newborns and these newborns can participate in the information propagation; on the other hand, it also refers to immigrated birth rate, which means that the external population may move to the regions where the initial population is located due to work, education and tourism. After their immigration, they can also participate in the information propagation. 2) For mortality rate, on the one hand, it refers to natural mortality rate, which means that some individuals in the initial population will die due to accidents and old age, and these deaths may be excluded for the information propagation; on the other hand, it also refers to emigration mortality rate, which means that some initial individuals may move to other regions for diverse reasons, and their emigration makes them no longer involved in the information propagation. Taking the propagation process in layer 1 as an example, the state transition mechanism of SIAIBHR model can be described as.

• Some newborn individuals will be filled into the network with birth rate ξ to participate in the information propagation process. Without loss of generality, these newborn individuals are assumed to be susceptible; Individuals in all five compartments are removed from the network with mortality rate δ;

• Individuals in S status may become infectious spreader of positive/negative information associating with their intra-layer infected neighbors in I1A (I1B) at infection rate λ1 (λ2). They can also be infected by their inter-layer acquaintances in I2A (I2B) at decay infection rate κλ1 (κλ2), κ < 1;

• Individuals in I1A state may become hesitate ones after receiving the negative information from their neighbors (acquaintances) in I1B (I2B) state at transmission rate θ1 (κθ1); similarly, individuals in I1B state also may become hesitate ones after receiving the positive information from their neighbors (acquaintances) in I1A (I2A) state at transmission rate θ2 (κθ2);

• Individuals in H status may tend to be the spreaders of positive (negative) information with transmission rate ε1A (ε1B), which is driven by the weighted balance between the global and local prevalence scale of positive (negative) information;

• Individuals in I1A, I1B, H status may lose spreading interest at recovered rate μ, and be removed in the propagation processes of negative/positive information.

The similar state transition mechanism holds for layer 2. The state transition diagram of SIAIBHR model is shown in Figure 1B.

The dynamic evolution of information propagation for layers 1 and 2 can be derived as

dS1tdt=ξk1λ1S1tI1Atk1λ2S1tI1Btk12κλ1S1tI2Atk12κλ2S1tI2BtδS1tdI1Atdt=k1λ1S1tI1At+k12κλ1S1tI2At+ε1AtH1tk1θ1I1AtI1Btk12κθ1I1AtI2Btδ+μI1AtdI1Btdt=k1λ2S1tI1Bt+k12κλ2S1tI2Bt+ε1BtH1tk1θ2I1BtI1Atk12κθ2I1BtI2Atδ+μI1BtdH1tdt=k1θ1I1AtI1Bt+k12κθ1I1AtI2Bt+k1θ2I1BtI1At+k12κθ2I1BtI2Atε1At+ε1Bt+δ+μH1t(2.2)
dS2tdt=ξk2λ1S2tI2Atk2λ2S2tI2Btk21κλ1S2tI1Atk21κλ2S2tI1BtδS2tdI2Atdt=k2λ1S2tI2At+k21κλ1S2tI1At+ε2AtH2tk2θ1I2AtI2Btk21κθ1I2AtI1Btδ+μI2AtdI2Btdt=k2λ2S2tI2Bt+k21κλ2S2tI1Bt+ε2BtH2tk2θ2I2BtI2Atk21κθ2I2BtI1Atδ+μI2BtdH2tdt=k2θ1I2AtI2Bt+k21κθ1I2AtI1Bt+k2θ2I2BtI2At+k21κθ2I2BtI1Atε2At+ε2Bt+δ+μH2t(2.3)

where

ε1At=β1ω1I1At+1ω112I1At+I2At,ε1Bt=β1ω1I1Bt+1ω112I1Bt+I2Bt,(2.4)
ε2At=β2ω2I2At+1ω212I1At+I2At,ε2Bt=β2ω2I2Bt+1ω212I1Bt+I2Bt.(2.5)

For Eqs 2.4, 2.5, the local information prevalence is equivalent to the density of information spreaders in the layer where individuals reside, while the global information prevalence is defined as the average density of information spreaders in two layers. ω1 and ω2 are the weighted coefficients of local prevalence of negative/positive information in layer 1 and 2. β1, β2 are the scaling factors. Without loss of generality, we set β1 = β2 = 1 here.

3 Basic reproduction number and stability analysis

In this section, we firstly study the basic reproduction number of dynamical systems (2.2) and (2.3) through the next-generation matrix method [37]. Secondly, the existence and stability of information-free equilibrium and information-endemic equilibrium are discussed by means of analysis technique, Routh-Hurwitz judgment, Lyapunov method and LaSalle’s invariance principle.

In order to facilitate the calculation of the basic reproduction number, denote

Xt=I1At,I2At,I1Bt,I2Bt,H1t,H2t,S1t,S2tT.(3.1)

Then we can rewrite the dynamical systems (2.2) and (2.3) as

dXtdt=FXtVXt(3.2)

where

F=k1λ1S1tI1At+k12κλ1S1tI2Atk2λ1S2tI2At+k21κλ1S2tI1Atk1λ2S1tI1Bt+k12κλ2S1tI2Btk2λ2S2tI2Bt+k21κλ2S2tI1Bt0000,(3.3)
V=k1θ1I1AtI1Bt+k12κθ1I1AtI2Bt+δ+μI1Atε1AtH1tk2θ1I2AtI2Bt+k21κθ1I2AtI1Bt+δ+μI2Atε2AtH2tk1θ2I1BtI1At+k12κθ2I1BtI2At+δ+μI1Btε1BtH1tk2θ2I2BtI2At+k21κθ2I2BtI1At+δ+μI2Btε2BtH2tε1At+ε1Bt+δ+μH1tθ1+θ2k1I1AtI1Btκk12θ1I1AtI2Bt+θ2I1BtI2Atε2At+ε2Bt+δ+μH2tθ1+θ2k2I2AtI2Btκk21θ1I2AtI1Bt+θ2I2BtI1Atk1S1tλ1I1At+λ2I1Bt+κk12S1tλ1I2At+λ2I2Bt+δS1tξk2S2tλ1I2At+λ2I2Bt+κk21S2tλ1I1At+λ2I1Bt+δS2tξ(3.4)

Obviously, there exists an information-free equilibrium E0=X()=0,0,0,0,0,0,ξδ,ξδ. Furthermore, the Jacobian matrices of F(X) and V(X) at E0 are

DFE0=F000,DVE0=V0J1J2,(3.5)

where

F=k1λ1ξδk12κλ1ξδ00k21κλ1ξδk2λ1ξδ0000k1λ2ξδk12κλ2ξδ00k21κλ2ξδk2λ2ξδ,V=δ+μ0000δ+μ0000δ+μ0000δ+μ.(3.6)

Therefore, the next-generation matrix can be calculated as

Γ=FV1=k1λ1ξδδ+μk12κλ1ξδδ+μ00k21κλ1ξδδ+μk2λ1ξδδ+μ0000k1λ2ξδδ+μk12κλ2ξδδ+μ00k21κλ2ξδδ+μk2λ2ξδδ+μ.(3.7)

The basic reproduction number R0 is defined as the spectral radius of matrix Γ,namely,

R0=ρΓ=ρFV1=ξmaxλ1,λ22δδ+μk1+k2+k1k22+4κ2k12k21.(3.8)

Combined the above analysis, the stability properties of the information-free equilibrium E0 and information-endemic equilibrium E* are given in the following theorems.

3.1 Stability analysis of information-free equilibrium

With R0<1, our dynamical system will converge to the information-free equilibrium E0=0,0,0,0,0,0,ξδ,ξδ when reaching a steady state. Next, we provide theorems 3.1 and 3.2 to prove its stability.

Theorem 3.1. For the dynamical systems (2.2) and (2.3), the information-free equilibrium E0 is locally asymptotically stable if R0<1 and unstable if R0>1.

Proof: The local stability of the information-free equilibrium E0 of the dynamical systems (2.2) and (2.3) is determined by the eigenvalues of the corresponding Jacobian matrix JE0. From the dynamic evolution of SIAIBHR, we can obtain

JE0=k1λ1ξδδ+μk12κλ1ξδ000000k21κλ1ξδk2λ1ξδδ+μ00000000k1λ2ξδδ+μk12κλ2ξδ000000k21κλ2ξδk2λ2ξδδ+μ00000000δ+μ00000000δ+μ00k1λ1ξδk12κλ1ξδk1λ2ξδk12κλ2ξδ00δ0k21κλ1ξδk2λ1ξδk21κλ2ξδk2λ2ξδ000δ.(3.9)

Then the eigenvalues of JE0 can be provided as

u1,2=δ,u3,4=12δk1+k2±k1k22+4κ2k12k12ξλ12δδ+μ,u5,6=δ+μ,u7,8=12δk1+k2±k1k22+4κ2k12k12ξλ22δδ+μ.

Furthermore, we can derive the maximum eigenvalue

umax=12δk1+k2+k1k22+4κ2k12k12ξmaxλ1,λ22δδ+μ=R01δ+μ(3.10)

Thus, it is obvious that as long as R0<1, all eigenvalues u1, u2, u3, u4, u5, u6, u7, u8 have negative real parts. Otherwise, at least one eigenvalue owns a positive real part. In conclusion, the information-free equilibrium E0 is locally asymptotically stable for R0<1, and unstable for R0>1.

Next, we investigate the global stability of the information-free equilibrium E0.

Theorem 3.2. The information-free equilibrium E0 of the dynamical systems (2.2) and (2.3) is globally asymptotically stable if R0<1.

Proof: Construct the following Lyapunov function

Vt=expΞt0t2ξδ+μδ+κk12+k21dx>0,(3.11)

where Ξ(t)=i=12IiA(t)+IiB(t)+Hi(t), and dΞ(t)dt=dI1A(t)dt+dI1B(t)dt+dI2A(t)dt+dI2B(t)dt+dH1(t)dt+dH2(t)dt.

The derivative of V(t) towards t can be calculated as

dVtdt=VtdΞtdt2ξδ+μδκk12+k21=VtS1tk1λ1I1At+λ2I1Bt+κk12λ1I2At+λ2I2Bt+VtS2tk2λ1I2At+λ2I2Bt+κk21λ1I1At+λ2I1BtVtδ+μI1At+I1Bt+I2At+I2Bt+H1t+H2t+2ξδ+μδ+κk12+k21Vtξmaxλ1,λ2δk1+κk21I1At+I1Bt+k2+κk12I2At+I2BtVt2δ+μΞt+κk12+k21Vtξmaxλ1,λ2δk1+k2Ξt+κk21I1At+I1Bt+κk12I2At+I2BtVt2δ+μΞt+κk12+k21Vtξmaxλ1,λ2δk1+k2+k1k22+4κ2k12k212δ+μΞt=Vt2δ+μR01Ξt

Significantly, dV(t)dt0 if R0<1. Besides, dV(t)dt=0 if and only if Ξ(t) = 0, namely, IiA(t)=IiB(t)=Hi(t)=0.Based on LaSalle’s invariance principle, it can be concluded that the information-free equilibrium E0 is globally asymptotically stable if R0<1.

3.2 Stability analysis of information-endemic equilibrium

When R0>1, the system will deviate from the information-free equilibrium E0, and point to an endemic equilibrium. We define information-endemic equilibrium E*=I1A*,I2A*,I1B*,I2B*,H1*,H2*, then dynamical system (2.2) satisfies the following conditions

ξ=k1λ1S1*I1A*+k1λ2S1*I1B*+k12κλ1S1*I2A*+k12κλ2S1*I2B*+δS1*δ+μI1A*=k1λ1S1*I1A*+k12κλ1S1*I2A*+ε1A*H1*k1θ1I1A*I1B*k12κθ1I1A*I2B*δ+μI1B*=k1λ2S1*I1B*+k12κλ2S1*I2B*+ε1B*H1*k1θ2I1B*I1A*k12κθ2I1B*I2A*δ+μH1*=k1θ1I1A*I1B*+k12κθ1I1A*I2B*+k1θ2I1B*I1A*+k12κθ2I1B*I2A*ε1A*+ε1B*H1*(3.12)

with the similar condition holding for system (2.3).

Theorem 3.3. The information-endemic equilibrium E* of the dynamical systems (2.2) and (2.3) is globally asymptotically stable if R0>1.

Proof: Construct the following Lyapunov function

Vt=V1t+V2t,(3.13)

for the dynamical system (2.2) in layer 1, we define

V1t=expc1S1*gS1tS1*+c2I1A*gI1AtI1A*+c3I1B*gI1BtI1B*+c4H1*gH1tH1*0tΘudu>0,(3.14)

where g(x) = x − 1 − ln xg (1) = 0, and

Θu=c1c2k1λ1S1*I1A*+c2θ1+c3θ2k1I1A*I1B*+c2k12κθ1I1A*I2B*gI1AuI1A*+c1c3k1λ2S1*I1B*+c2θ1+c3θ2k1I1A*I1B*+c3k12κθ2I1B*I2A*gI1BuI1B*+c41ω12I2A*H1*+I2B*H1*gH1uH1*+c1k12κλ1S1*I2A*+c41ω12I2A*H1*+c3k12κθ2I1B*I2A*gI2AuI2A*+c1k12κλ2S1*I2B*+c41ω12I2B*H1*+c2k12κθ1I1A*I2B*gI2BuI2B*.(3.15)

Furthermore, we define

q1=S1tS1*,x1=I1AtI1A*,y1=I1BtI1B*,z1=H1tH1*,(3.16)
V1St=c1S1*gS1tS1*,V1At=c2I1A*gI1AtI1A*,V1Bt=c3I1B*gI1BtI1B*,V1Ht=c4H1*gH1tH1*.(3.17)

Then, we can obtain

V1t=expV1St+V1At+V1Bt+V1Ht0tΘudu=expc1S1*gq1+c2I1A*gx1+c3I1B*gy1+c4H1*gz10tΘudu.(3.18)

The derivative of V1(t) towards t can be calculated as

dV1tdt=V1tdV1Stdt+dV1Atdt+dV1Btdt+dV1HtdtΘt,(3.19)

where

dV1Stdt=c111q1k1λ1S1*I1A*1q1x1+k1λ2S1*I1B*1q1y1+k12κλ1S1*I2A*1q1x2+k12κλ2S1*I2B*1q1y2+δS1*1q1,(3.20)
dV1Atdt=c211x1k1λ1S1*I1A*q1x1x1+k12κλ1S1*I2A*q1x2x1+1+ω12I1A*H1*x1z1x1+1ω12I2A*H1*x2z1x1k1θ1I1A*I1B*x1y1x1k12κθ1I1A*I2B*x1y2x1,(3.21)
dV1Btdt=c311y1k1λ2S1*I1B*q1y1y1+k12κλ2S1*I2B*q1y2y1+1+ω12I1B*H1*y1z1y1+1ω12I2B*H1*y2z1y1k1θ2I1B*I1A*y1x1y1k12κθ2I1B*I2A*y1x2y1,(3.22)
dV1Htdt=c411z1k1θ1I1A*I1B*x1y1z1+k12κθ1I1A*I2B*x1y2z11+ω12I1A*H1*x1z1z11ω12I2A*H1*x2z1z1+k1θ2I1B*I1A*y1x1z1+k12κθ2I1B*I2A*y1x2z11+ω12I1B*H1*y1z1z11ω12I2B*H1*y2z1z1.(3.23)

For convenience, we define

ΛtdV1Stdt+dV1Atdt+dV1Btdt+dV1HtdtΘt.(3.24)

Therefore, combining Eq. 3.15 and Eqs 3.203.23, we can derive

Λt=c1δS1*q1111q1c1k1λ1S1*I1A*+c1k1λ2S1*I1B*+c1k12κλ1S1*I2A*+c1k12κλ2S1*I2B*g1q1c2k12κλ1S1*I2A*+c21+ω12I1A*H1*1c4c2+c21ω12I2A*H1*gx1c1k1λ1S1*I1A*1c2c1gq1x1c2k1λ1S1*I1A*+c3k1λ2S1*I1B*gq1c1k1λ2S1*I1B*1c3c1gq1y1c3k12κλ2S1*I1B*+c31+ω12I1B*H1*1c4c3+c31ω12I2B*H1*gy1c1k12κλ1S1*I2A*1c2c1gq1x2c2k12κλ1S1*I2A*gq1x2x1c1k12κλ2S1*I2B*1c3c1gq1y2c3k12κλ2S1*I2B*gq1y2y1+c21+ω12I1A*H1*1c4c2gx1z1+c31+ω12I1B*H1*1c4c3gy1z1+c21ω12I2A*H1*1c4c2gx2z1c21ω12I2A*H1*gx2z1x1+c31ω12I2B*H1*1c4c3gy2z1c31ω12I2B*H1*gy2z1y11+ω12H1*c2I1A*1c4c2+c3I1B*1c4c3+c4k1θ1+θ2I1A*I1B*+c4k12κθ1I1A*I2B*+θ2I1B*I2A*gz1c2k1θ1I1A*I1B*1c4c2+c3k1θ2I1A*I1B*1c4c3gx1y1c4k1θ1+θ2I1A*I1B*gx1y1z1k12κθ1I1A*I2B*c21c4c2gx1y2+c4gx1y2z1k12κθ2I1B*I2A*c31c4c3gy1x2+c4gy1x2z1.(3.25)

Next, by taking c1c2 = c3 = c4 > 0, we have

dV1tdt=V1tΛt0.(3.26)

Besides, dV1(t)dt=0 if and only if S1(t)=S1*,I1A(t)=I1A*,I1B(t)=I1B*,H1(t)=H1*. And for the dynamical system (2.3) in layer 2, we can also construct the Lyapunov function V2(t) which is similar to V1(t), such that V2(t) > 0 and dV2(t)dt<0. In other words, we achieve that V(t) = V1(t) + V2(t) > 0 and dV(t)dt=dV1(t)dt+dV2(t)dt<0. Based on LaSalle’s invariance principle, it can be concluded that the information-endemic equilibrium E* is globally asymptotically stable if R0>1.

In conclusion, we have completed the proof of asymptotic stability for information-free and information-endemic equilibria. Note that the Lyapunov theory we employ is not the unique method to prove system stability. As an alternative, Shang [38] proposed a novel framework that can analytically obtain the explicit solutions of dynamical systems using Lie algebra methods. Once the explicit solutions can be available, an effort may be made to derive the limit values of these explicit solutions when t. And the convergence of the limit values can reflect the stability of dynamical systems.

4 Optimal control

In order to suppress the prevalence of negative information, we introduce two heterogeneous controls: one is direct control mode v1(t), which persuades negative information spreaders to become positive information spreaders; the other is indirect control mode v2(t), which guides hesitant individuals to become positive information spreaders. Define QC as the Lebesgue square integrable control set of all admissible values of v1(t) and v2(t) over time interval 0,T, given as QC=v1(t),v2(t)L20,T:0v1(t),v2(t)1,0tT. Based on the above considerations, we consider the optimization problems as follows:

J=0Td1I1Bt+I2Bt+12d2v12t+12d3v22tdt.(4.1)

where the first term corresponds to the infection cost of negative information propagation in the network, and the second and third terms are the costs brought by the implementation of controls. Our goal is to achieve the most powerful inhibition effect on negative information with the lowest control intensity, which forms a trade-off between the two kinds of costs. d1, d2 and d3 are the weight factors of the three costs.

Correspondingly, the Lagrangian of our optimal problem can be formed as

L=d1I1Bt+I2Bt+12d2v12t+12d3v22t,(4.2)

then define adjoint functions φ(t)=φ1(t),φ2(t),φ3(t),φ4(t),φ5(t),φ6(t),φ7(t),φ8(t), we can drive the Hamiltonian function as

H=L+φ1tdS1tdt+φ2tdI1Atdt+φ3tdI1Btdt+φ4tdH1tdt+φ5tdS2tdt+φ6tdI2Atdt+φ7tdI2Btdt+φ8tdH2tdt.(4.3)

4.1 The existence of optimal solution

Theorem 4.1. There exists a set of optimal controls v*(t)v1*(t),v2*(t) and corresponding solutions S̄1(t), Ī1A(t), Ī1B(t), H̄1(t), S̄2(t), Ī2A(t), Ī2B(t),H̄2(t) such that J(v*(t))=minv(t)QCJ(v(t)).

Proof: The existence of optimal control strategies can be proven by the Cesari theorem [39]. Cesari theorem indicates that if the optimization problem for our dynamical systems (2.2) and (2.3) satisfies the following five conditions, the optimal solutions of two controls v1(t) and v2(t) will exist.

(1) The control set and state variables are non-empty;

(2) The control set is closed and convex;

(3) The right-hand side of systems (2.2) and (2.3) is bounded above by a linear function with the state and control;

(4) The integrand in the objective function is convex with respect to the controls v1(t), v2(t);

(5) There exists a constant C1 > 1 and positive number C2 and C3 such that

LC2v1t2+v2t2C12C3.

Next, we will prove that the dynamical systems (2.2) and (2.3) satisfy the above five conditions. Obviously, if the system is uniformly Lipschitz continuous, the sets of QC and solutions to initial values are non-empty. Besides, state variables are non-empty such that condition (1) is satisfied. The characteristics of control space and objective function can be verified by definition, meeting conditions (2) and (4).

The systems (2.2) and (2.3) can be rewritten as

DXt=dXtdt=BXt+GXt,(4.4)

where

B=δ+μ00000000δ+μ00000000δ+μ00000000δ+μ00000000δ+μ00000000δ+μ00000000δ00000000δ,(4.5)
GX=k1λ1S1tI1At+k12κλ1S1tI2At+ε1AtH1tk1θ1I1AtI1Btk12κθ1I1AtI2Btk2λ1S2tI2At+k21κλ1S2tI1At+ε2AtH2tk2θ1I2AtI2Btk21κθ1I2AtI1Btk1λ2S1tI1Bt+k12κλ2S1tI2Bt+ε1BtH1tk1θ2I1BtI1Atk12κθ2I1BtI2Atk2λ2S2tI2Bt+k21κλ2S2tI1Bt+ε2BtH2tk2θ2I2BtI2Atk21κθ2I2BtI1Atk1θ1I1AtI1Bt+k12κθ1I1AtI2Bt+k1θ2I1BtI1At+k12κθ2I1BtI2Atε1At+ε1BtH1tk2θ1I2AtI2Bt+k21κθ1I2AtI1Bt+k2θ2I2BtI2At+k21κθ2I2BtI1Atε2At+ε2BtH2tξk1λ1S1tI1Atk1λ2S1tI1Btk12κλ1S1tI2Atk12κλ2S1tI2Btξk2λ1S2tI2Atk2λ2S2tI2Btk21κλ1S2tI1Atk21κλ2S2tI1Bt.(4.6)

Furthermore, we can verify

GX̃GXQS̃1S1+S̃2S2+Ĩ1AI1A+Ĩ2AI2A+Ĩ1BI1B+Ĩ2BI2B+H̃1H1+H̃2H2(4.7)

where

Q=max2λ1+λ2k1+k12κ,2λ1+λ2k2+k21κ,2k1λ1+θ1+θ2+k21κλ1+θ2+k12κθ1,.2k2λ1+θ1+θ2+k12κλ1+θ2+k21κθ1,2k1λ2+θ1+θ2+k21κλ2+θ1+k12κθ2,2k2λ2+θ1+θ2+k12κλ2+θ2+k21κθ2,3maxε̃1A+ε̃1B,ε1A+ε1B,3maxε̃2A+ε̃2B,ε2A+ε2B.(4.8)

Then we have

DX̃DXVX̃X,(4.9)

where

V=maxQ,B<.(4.10)

Therefore, the function D is uniformly Lipschitz continuous and satisfies the required bound in Cesari theorem. The control set QC belongs to the closed set 0,1 and the objective function J lies in a compact interval Jmin,Jmax. Consequently, the function D(X) is linear in two controls v1(t) and v2(t), which means condition (3) is satisfied. As a result, we can draw the conclusion that the solution of the system exists.

Furthermore, we set C1 = 2, C2=12mind2,d3, C3 = Δ(0), then condition (5) is satisfied, which means the optimal solution exists. Based on the above discussion, the proof is completed.

4.2 The solution to optimal control problem

Here we employ Pontryagin minimum principle with fixed final time to analytically derive the optimal solution.

Theorem 4.2. Given an optimal control pair v1(t) and v2(t) and the corresponding solutions to the system (2.2) and (2.3), there exist adjoint functions φ1(t), φ2(t), φ3(t), φ4(t), φ5(t), φ6(t), φ7(t), φ8(t), satisfying

dφ1tdt=φ1tφ2tk1λ1I1At+k12κλ1I2At+φ1tφ3tk1λ2I1Bt+k12κλ2I2Bt+δφ1t,(4.11)
dφ2tdt=φ1tφ2tk1λ1S1t+φ4tφ2t1+ω12H1tk1θ1I1Btk12κθ1I2Bt+δ+μφ2t+φ3tφ4tk1θ2I1Bt+φ5tφ6tk21κλ1S2t+φ8tφ6t1ω22H2t+φ7tφ8tk21κθ2I2Bt,(4.12)
dφ3tdt=φ1tφ3tk1λ2S1t+φ4tφ3t1+ω12H1tk1θ2I1Atk12κθ2I2At+δ+μφ3t+φ2tφ4tk1θ1I1At+φ5tφ7tk21κλ2S2t+φ8tφ7t1ω22H2t+φ6tφ8tk21κθ1I2Atφ2tv1t+φ3tv1td1,(4.13)
dφ4tdt=δ+μ+v2tφ4t+φ4tφ2tε1At+φ4tφ3tε1Btv2tφ2t,(4.14)
dφ5tdt=φ5tφ6tk2λ1I2At+k21κλ1I1At+φ5tφ7tk2λ2I2Bt+k21κλ2I1Bt+δφ5t,(4.15)
dφ6tdt=φ5tφ6tk2λ1S2t+φ8tφ6t1+ω22H2tk2θ1I2Btk21κθ1I1Bt+δ+μφ6t+φ7tφ8tk2θ2I2Bt+φ1tφ2tk12κλ1S1t+φ4tφ2t1ω12H1t+φ3tφ4tk12κθ2I1Bt,(4.16)
dφ7tdt=φ5tφ7tk2λ2S2t+φ8tφ7t1+ω22H2tk2θ2I2Atk21κθ2I1At+δ+μφ7t+φ6tφ8tk2θ1I2At+φ1tφ3tk12κλ2S1t+φ4tφ3t1ω12H1t+φ2tφ4tk12κθ1I1Atφ6tv1t+φ7tv1td1,(4.17)
dφ8tdt=δ+μ+v2tφ8t+φ8tφ6tε2At+φ8tφ7tε2Btv2tφ6t,(4.18)

with boundary conditions

φ1T=φ2T=φ3T=φ4T=φ5T=φ6T=φ7T=φ8T=0.(4.19)

Furthermore, the optimal solutions of v1*(t) and v2*(t) are formulated as

v1*t=minmax1d2φ3tφ2tĪ1Bt+φ7tφ6tĪ2Bt,v 1 min , v 1 max , ( 4.20 )
v 2 * t = min max 1 d 3 φ 4 t φ 2 t H ̄ 1 t + φ 7 t φ 6 t H ̄ 2 t , v 2 min , v 2 max . ( 4.21 )

Proof: While characterizing the properties of the optimal solution, the costate conditions must be satisfied in the system of costate differential equations as

d φ 1 t d t = H S 1 t , d φ 2 t d t = H I 1 A t , d φ 3 t d t = H I 1 B t , d φ 4 t d t = H H 1 t , d φ 5 t d t = H S 2 t , d φ 6 t d t = H I 2 A t , d φ 7 t d t = H I 2 B t , d φ 8 t d t = H H 2 t . ( 4.22 )

Then, by the optimal conditions, we have

H v 1 t = d 2 v 1 t + φ 2 t φ 3 t I 1 B t + φ 6 t φ 7 t I 2 B t , H v 2 t = d 3 v 2 t + φ 2 t φ 4 t H 1 t + φ 6 t φ 8 t H 2 t . ( 4.23 )

Let H v 1 ( t ) = H v 2 ( t ) = 0 , so we can obtain the optimal control at time t satisfying

v 1 * t = 1 d 2 φ 3 t φ 2 t I ̄ 1 B t + φ 7 t φ 6 t I ̄ 2 B t = Δ v 1 o p t , v 2 * t = 1 d 3 φ 4 t φ 2 t H ̄ 1 t + φ 7 t φ 6 t H ̄ 2 t = Δ v 2 o p t . ( 4.24 )

Considering the property of the control space, we obtain

v 1 * t = v 1 min , if v 1 o p t < v 1 min v 1 o p t , if v 1 min v 1 o p t v 1 max v 1 max , if v 1 o p t > v 1 max , v 2 * t = v 2 min , if v 2 o p t < v 2 min v 2 o p t , if v 2 min v 2 o p t v 2 max v 2 max , if v 2 o p t > v 2 max ( 4.25 )

Thus we have the optimal controls v 1 * ( t ) and v 2 * ( t ) in compact notation

v 1 * t = min max 1 d 2 φ 3 t φ 2 t I ̄ 1 B t + φ 7 t φ 6 t I ̄ 2 B t , v 1 min , v 1 max , ( 4.26 )
v 2 * t = min max 1 d 3 φ 4 t φ 2 t H ̄ 1 t + φ 8 t φ 6 t H ̄ 2 t , v 2 min , v 2 max . ( 4.27 )

In summary, the proof of theorem 4.2 has been completed.

4.3 The uniqueness of optimal solution

Theorem 4.3. For a relatively short control time T, the states and the adjoint functions at the optimum and the optimal control strategies are unique.

Proof: Considering two different control states and their corresponding adjoint functions as

S i , I i A , I i B , H i , φ j , S ̃ i , I ̃ i A , I ̃ i B , H ̃ i , φ ̃ j , i = 1,2 , j = 1,2 , , 8 .

Then we define S 1 = e αt p 1, I 1 A = e α t p 2 , I 1 B = e α t p 3 , H 1 = e αt p 4, S 2 = e αt p 5, I 2 A = e α t p 6 , I 2 B = e α t p 7 , H 2 = e αt p 8, and φ 1 = e αt h 1, φ 2 = e αt h 2, φ 3 = e αt h 3, φ 4 = e αt h 4, φ 5 = e αt h 5, φ 6 = e αt h 6, φ 7 = e αt h 7, φ 8 = e αt h 8. The same definitions holds for S ̃ 1 = e α t p ̃ 1 , I ̃ 1 A = e α t p ̃ 2 , I ̃ 1 B = e α t p ̃ 3 , H ̃ 1 = e α t p ̃ 4 , S ̃ 2 = e α t p ̃ 5 , I ̃ 2 A = e α t p ̃ 6 , I ̃ 2 B = e α t p ̃ 7 , H ̃ 2 = e α t p ̃ 8 , and φ ̃ 1 = e α t h ̃ 1 , φ ̃ 2 = e α t h ̃ 2 , φ ̃ 3 = e α t h ̃ 3 , φ ̃ 4 = e α t h ̃ 4 , φ ̃ 5 = e α t h ̃ 5 , φ 6 = e α t h ̃ 6 , φ 7 = e α t h ̃ 7 , φ 8 = e α t h ̃ 8 , where α > 0 is a constant to be chosen.

After substituting the above values into systems (2.2) and (2.3), we can obtain

α p 1 + d p 1 d t = ξ e α t k 1 λ 1 e α t p 1 p 2 k 1 λ 2 e α t p 1 p 3 k 12 κ λ 1 e α t p 1 p 6 k 12 κ λ 2 e α t p 1 p 7 δ p 1 , ( 4.28 )
α p 2 + d p 2 d t = k 1 λ 1 e α t p 1 p 2 + k 12 κ λ 1 e α t p 1 p 6 + 1 + ω 1 2 e α t p 2 p 4 + 1 ω 1 2 e α t p 6 p 4 k 1 θ 1 e α t p 2 p 3 k 12 κ θ 1 e α t p 2 p 7 δ + μ p 2 + v 1 * p 3 + v 2 * p 4 , ( 4.29 )
α p 3 + d p 3 d t = k 1 λ 2 e α t p 1 p 3 + k 12 κ λ 2 e α t p 1 p 7 + 1 + ω 1 2 e α t p 3 p 4 + 1 ω 1 2 e α t p 7 p 4 k 1 θ 2 e α t p 3 p 2 k 12 κ θ 2 e α t p 3 p 6 δ + μ + v 1 * p 3 , ( 4.30 )
α p 4 + d p 4 d t = k 1 θ 1 e α t p 2 p 3 + k 12 κ θ 1 e α t p 2 p 7 + k 1 θ 2 e α t p 3 p 2 + k 12 κ θ 2 e α t p 3 p 6 1 + ω 1 2 e α t p 2 p 4 1 ω 1 2 e α t p 6 p 4 1 + ω 1 2 e α t p 3 p 4 1 ω 1 2 e α t p 7 p 4 δ + μ + v 2 * p 4 , ( 4.31 )
α p 5 + d p 5 d t = ξ e α t k 2 λ 1 e α t p 5 p 6 k 2 λ 2 e α t p 5 p 7 k 21 κ λ 1 e α t p 5 p 2 k 21 κ λ 2 e α t p 5 p 3 δ p 5 , ( 4.32 )
α p 6 + d p 6 d t = k 2 λ 1 e α t p 5 p 6 + k 21 κ λ 1 e α t p 5 p 2 + 1 + ω 2 2 e α t p 6 p 8 + 1 ω 2 2 e α t p 2 p 8 k 2 θ 1 e α t p 6 p 7 k 21 κ θ 1 e α t p 6 p 3 δ + μ p 6 + v 1 * p 7 + v 2 * p 8 , ( 4.33 )
α p 7 + d p 7 d t = k 2 λ 2 e α t p 5 p 7 + k 21 κ λ 2 e α t p 5 p 3 + 1 + ω 2 2 e α t p 7 p 8 + 1 ω 2 2 e α t p 3 p 8 k 2 θ 2 e α t p 7 p 6 k 21 κ θ 2 e α t p 7 p 2 δ + μ + v 1 * p 7 , ( 4.34 )
α p 8 + d p 8 d t = k 2 θ 1 e α t p 6 p 7 + k 21 κ θ 1 e α t p 6 p 3 + k 2 θ 2 e α t p 7 p 6 + k 21 κ θ 2 e α t p 7 p 2 1 + ω 2 2 e α t p 6 p 8 1 ω 2 2 e α t p 2 p 8 1 + ω 2 2 e α t p 7 p 8 1 ω 2 2 e α t p 3 p 8 δ + μ + v 2 * p 8 , ( 4.35 )
d h 1 d t α h 1 = e α t h 1 h 2 k 1 λ 1 p 2 + k 12 κ λ 1 p 6 + e α t h 1 h 3 k 1 λ 2 p 3 + k 12 κ λ 2 p 7 + δ h 1 , ( 4.36 )
d h 2 d t α h 2 = h 1 h 2 k 1 λ 1 e α t p 1 + e α t h 4 h 2 1 + ω 1 2 p 4 k 1 θ 1 p 3 k 12 κ θ 1 p 7 + δ + μ h 2 + h 3 h 4 k 1 θ 2 e α t p 3 + h 5 h 6 k 21 κ λ 1 e α t p 5 + h 8 h 6 1 ω 2 2 e α t p 8 + h 7 h 8 k 21 κ θ 2 e α t p 7 , ( 4.37 )
d h 3 d t α h 3 = h 1 h 3 k 1 λ 2 e α t p 1 + e α t h 4 h 3 1 + ω 1 2 p 4 k 1 θ 2 p 2 k 12 κ θ 2 p 6 + δ + μ d 1 h 3 + h 2 h 4 k 1 θ 1 e α t p 2 + h 5 h 7 k 21 κ λ 2 e α t p 5 + h 8 h 7 1 ω 2 2 e α t p 8 + h 6 h 8 k 21 κ θ 1 e α t p 6 + v 1 * e α t , ( 4.38 )
d h 4 d t α h 4 = δ + μ h 4 + e α t h 4 h 2 1 + ω 1 2 p 2 + 1 ω 1 2 p 6 + e α t h 4 h 3 1 + ω 1 2 p 3 + 1 ω 1 2 p 7 + v 2 * e α t , ( 4.39 )
d h 5 d t α h 5 = e α t h 5 h 6 k 2 λ 1 p 6 + k 21 κ λ 1 p 2 + e α t h 5 h 7 k 2 λ 2 p 7 + k 21 κ λ 2 p 3 + δ h 5 , ( 4.40 )
d h 6 d t α h 6 = h 5 h 6 k 2 λ 1 e α t p 5 + e α t h 8 h 6 1 + ω 2 2 p 8 k 2 θ 1 p 7 k 21 κ θ 1 p 3 + δ + μ h 6 + h 7 h 8 k 2 θ 2 e α t p 7 + h 1 h 2 k 12 κ λ 1 e α t p 1 + h 4 h 2 1 ω 1 2 e α t p 4 + h 3 h 4 k 12 κ θ 2 e α t p 3 , ( 4.41 )
d h 7 d t α h 7 = h 5 h 7 k 2 λ 2 e α t p 5 + e α t h 8 h 7 1 + ω 2 2 p 8 k 2 θ 2 p 6 k 21 κ θ 2 p 2 + δ + μ d 1 h 7 + h 6 h 8 k 2 θ 2 e α t p 7 + h 1 h 2 k 12 κ λ 2 e α t p 1 + h 4 h 3 1 ω 1 2 e α t p 4 + h 2 h 4 k 12 κ θ 1 e α t p 2 + v 1 * e α t , ( 4.42 )
d h 8 d t α h 8 = δ + μ h 8 + e α t h 8 h 6 1 + ω 2 2 p 6 + 1 ω 2 2 p 2 + e α t h 8 h 7 1 + ω 2 2 p 7 + 1 ω 2 2 p 3 + v 2 * e α t . ( 4.43 )

Similarly, we can obtain other equations for S ̃ 1 , I ̃ 1 A , I ̃ 1 B , H ̃ 1 , S ̃ 2 , I ̃ 2 A , I ̃ 2 B , H ̃ 2 , φ ̃ 1 , φ ̃ 2 , φ ̃ 3 , φ ̃ 4 , φ ̃ 5 , φ ̃ 6 , φ ̃ 7 , φ ̃ 8 . Afterward, we subtract the equations for S 1 and S ̃ 1 , I 1 A and I ̃ 1 A , I 1 B and I ̃ 1 B , H 1 and H ̃ 1 , S 2 and S ̃ 2 , I 2 A and I ̃ 2 A , I 2 B and I ̃ 2 B , H 2 and H ̃ 2 , φ 1 and φ ̃ 1 , φ 2 and φ ̃ 2 , φ 3 and φ ̃ 3 , φ 4 and φ ̃ 4 , φ 5 and φ ̃ 5 , φ 6 and φ ̃ 6 , φ 7 and φ ̃ 7 , φ 8 and φ ̃ 8 respectively, then multiply each equation with appropriate difference subsequently, and integrate the obtained each equation from 0 to T. We take I 1 A and I ̃ 1 A , φ 3 and φ ̃ 3 as examples, thus

1 2 p 2 T p ̃ 2 T 2 + α 0 T p 2 p ̃ 2 2 d t = k 1 λ 1 0 T e α t p 1 p 2 p ̃ 1 p ̃ 2 p 2 p ̃ 2 d t + k 12 κ λ 1 0 T e α t p 1 p 6 p ̃ 1 p ̃ 6 p 2 p ̃ 2 d t + 1 + ω 1 2 0 T e α t p 2 p 4 p ̃ 2 p ̃ 4 p 2 p ̃ 2 d t + 1 ω 1 2 0 T e α t p 6 p 4 p ̃ 6 p ̃ 4 p 2 p ̃ 2 d t k 1 θ 1 0 T e α t p 2 p 3 p ̃ 2 p ̃ 3 p 2 p ̃ 2 d t k 12 κ θ 1 0 T e α t p 2 p 7 p ̃ 2 p ̃ 7 p 2 p ̃ 2 d t δ + μ 0 T p 2 p ̃ 2 2 d t + 0 T v 1 * p 3 v ̃ 1 * p ̃ 3 p 2 p ̃ 2 d t + 0 T v 2 * p 4 v ̃ 2 * p ̃ 4 p 2 p ̃ 2 d t C ̃ 1 e α T 0 T p 1 p ̃ 1 2 + p 2 p ̃ 2 2 + p 3 p ̃ 3 2 + p 4 p ̃ 4 2 + p 6 p ̃ 6 2 + p 7 p ̃ 7 2 d t + C ̃ 2 0 T p 4 p ̃ 4 2 + p 8 p ̃ 8 2 + p 7 p ̃ 7 2 + p 3 p ̃ 3 2 + p 2 p ̃ 2 2 + h 3 h ̃ 3 2 + h 2 h ̃ 2 2 + h 6 h ̃ 6 2 + h 4 h ̃ 4 2 + h 7 h ̃ 7 2 + h 8 h ̃ 8 2 d t ( 4.44 )

Furthermore,

1 2 h 3 0 h ̃ 3 0 2 + α 0 T h 3 h ̃ 3 2 d t = k 1 λ 2 0 T e α t h 1 h 3 p 1 h ̃ 1 h ̃ 3 p ̃ 1 h 3 h ̃ 3 d t + 1 + ω 1 2 0 T e α t h 4 h 3 p 4 h ̃ 4 h ̃ 3 p ̃ 4 h 3 h ̃ 3 d t k 1 θ 2 0 T e α t h 4 h 3 p 2 h ̃ 4 h ̃ 3 p ̃ 2 h 3 h ̃ 3 d t k 12 κ θ 2 0 T e α t h 4 h 3 p 6 h ̃ 4 h ̃ 3 p ̃ 6 h 3 h ̃ 3 d t + δ + μ d 1 0 T h 3 h ̃ 3 2 d t + k 1 θ 1 0 T e α t h 2 h 4 p 2 h ̃ 2 h ̃ 4 p ̃ 2 h 3 h ̃ 3 d t + k 21 κ λ 2 0 T e α t h 5 h 7 p 5 h ̃ 5 h ̃ 7 p ̃ 5 h 3 h ̃ 3 d t + 1 ω 2 2 0 T e α t h 8 h 7 p 8 h ̃ 8 h ̃ 7 p ̃ 8 h 3 h ̃ 3 d t + k 21 κ θ 1 0 T e α t h 6 h 8 p 6 h ̃ 6 h ̃ 8 p ̃ 6 h 3 h ̃ 3 d t + 0 T e α t v 1 * v ̃ 1 * h 3 h ̃ 3 d t C ̃ 2 0 T h 3 h ̃ 3 2 d t + C ̃ 1 e α T 0 T h 1 h ̃ 1 2 + h 2 h ̃ 2 2 + h 3 h ̃ 3 2 + h 4 h ̃ 4 2 + h 5 h ̃ 5 2 + h 6 h ̃ 6 2 + h 7 h ̃ 7 2 + h 8 h ̃ 8 2 d t + C ̃ 1 e α T 0 T p 1 p ̃ 1 2 + p 2 p ̃ 2 2 + p 3 p ̃ 3 2 + p 4 p ̃ 4 2 + p 5 p ̃ 5 2 + p 6 p ̃ 6 2 + p 7 p ̃ 7 2 + p 8 p ̃ 8 2 d t ( 4.45 )

Combining all of these equations, we can obtain

1 2 i = 1 8 p i p ̃ i 2 T + 1 2 h i h ̃ i 2 0 + α i = 1 8 0 T p i p ̃ i 2 d t + 0 T h i h ̃ i 2 d t C ̃ 1 + C ̃ 2 e α T 0 T i = 1 8 p i p ̃ i 2 + h i h ̃ i 2 d t ( 4.46 )

where C ̃ 1 and C ̃ 2 are constants depending on the coefficients and bounds of p 1, p 2, p 3, p 4, p 5, p 6, p 7, p 8, h 1, h 2, h 3, h 4, h 5, h 6, h 7, h 8. Therefore, we have

α C ̃ 1 + C ̃ 2 e α T 0 T i = 1 8 p i p ̃ i 2 + h i h ̃ i 2 d t 0 ( 4.47 )

If α is chosen such that α > C ̃ 1 + C ̃ 2 and T < 1 α ln α C ̃ 1 C ̃ 2 , then p i = p ̃ i , h i = h ̃ i , i = 1, 2, … , 8. As a result, based on the above proof, we can learn that the optimal control solution is unique.

5 Numerical experiments

In this section, we perform extensive numerical simulations to 1) corroborate the theoretical results of stability analysis towards information-free and information-endemic equilibria; 2) explore the influence of spreading parameters on dynamic trend and steady-state prevalence; 3) discuss the competition between two types of information; and 4) investigate the effectiveness of our optimal control strategies.

In order to verify the correctness of our theoretical modeling in characterize the competitive information propagation process on multi-layer interconnected networks, we first conduct the time evolution of each status according to Eqs 2.2, 2.3 and Monte Carlo (MC) simulations under different cases of spreading parameters. As shown in Figure 2, the MC simulation results are observed to match well with the theoretical results, which indicates that our formulations can accurately reflect the competitive spreading mechanism. Furthermore, we can calculate the basic reproduction number R 0 under three cases, namely, (1) Case 1: R 0 = 2.6794 > 1 , our system will converge to an information-endemic equilibrium point E* = (0.4398, 0, 0.3784, 0) when t; (2) Case 2: R 0 = 2.8133 > 1 , our system will converge to an information-endemic equilibrium point E* = (0, 0.3383, 0, 0.2936) when t. (3) Case 3: R 0 = 0.8038 < 1 , our system will converge to an information-free equilibrium point E 0 = (0, 0, 0, 0) when t; These conclusions are consistent with our Theorems 3.1–3.3.

FIGURE 2
www.frontiersin.org

FIGURE 2. Time evolution of each state density via several combinations cases. The symbols correspond to Monte Carlo (MC) simulations and the dotted lines represent the theoretical modeling of dynamic equation (ODE). The shared parameter settings are k 1 = 4, k 2 = 3, k 12 = 3, k 21 = 2, θ 1 = 0.2, θ 2 = 0.15, ξ = δ = 0.3, κ = 0.5. (A) Case 1: S 1 (0) = 0.7, I 1 A ( 0 ) = 0.15, I 1 B ( 0 ) = 0.15, S 2 (0) = 0.8, I 2 A ( 0 ) = 0.15, I 2 B ( 0 ) = 0.05, λ 1 = 0.25, λ 2 = 0.15, μ = 0.15; (B) Case 2: S 1 (0) = 0.55, I 1 A ( 0 ) = 0.25, I 1 B ( 0 ) = 0.2, S 2 (0) = 0.4, I 2 A ( 0 ) = 0.3, I 2 B ( 0 ) = 0.3, λ 1 = 0.25, λ 2 = 0.35, μ = 0.30; (C) S 1 (0) = 0.5, I 1 A ( 0 ) = 0.3, I 1 B ( 0 ) = 0.2, S 2 (0) = 0.4, I 2 A ( 0 ) = 0.35, I 2 B ( 0 ) = 0.25, λ 1 = 0.1, λ 2 = 0.05, μ = 0.3.

It is well-acknowledged that spreading parameters are the key factors affecting the steady-state prevalence of information propagation, so it is necessary to explore the correlation between some important spreading parameters and the information prevalence. Note that the dynamic process of information in layer 1 is influenced by three aspects: 1) the interaction between individuals in layer 1 via intra-layer edges presented as k 1 ; 2) the interaction between individuals across layers 1 and 2 via inter-layer edges presented as k 12 ; 3) the weight ω 1 between local and global information prevalence. Similarly, the dynamic process of information in layer 2 is also influenced by three aspects: 1) the interaction between individuals in layer 2 via intra-layer edges presented as k 2 ; 2) the interaction between individuals across layers 2 and 1 via inter-layer edges presented as k 21 ; 3) the weight ω 2 between local and global information prevalence. We observe that the information propagation in layer 1 and 2 have similar mechanisms of state transition, leading to their similar evolution trend, and their differences are merely reflected in numerical results. Therefore, we only analyze the conclusions in layer 1, which are well generalized to layer 2. Here we provide the phase diagrams of five different experiments. For each diagram, the colormap adopts a JET mode, which starts with blue representing the minimum value, gradually transitions to cyan, green, yellow, orange, and ends with red representing the maximum value.

Figure 3A describes the changing trend of steady-state density of I 1 A and I 1 B spreaders under heterogeneous combinations of λ 1 and λ 2. The color scale of I 1 A ( ) (left) ranges from 0,0.3164 , and the color scale of I 1 B ( ) (right) ranges from 0,0.3183 . We can observe that when both λ 1 and λ 2 are relatively small, the system converges to an information-free equilibrium, where two types of information will eventually die out. When λ 1 and λ 2 become larger, the infection density presents a coexistence of continuous and discontinuous phase transitions. Specifically, taking I 1 A density as an example, when λ 2 is very small, the steady-state density of I 1 A gradually increases in a slow trend with the increase of λ 1. This is because the small λ 2 corresponds to the low-density I 1 B spreaders, and the larger λ 1 increases the probability that these small number of I 1 B spreaders are infected with positive information. Although the infectivity of positive information is increased, the quantity of I 1 B spreaders with potential infected possibility is low, thus the steady-state I 1 A density will not increase dramatically. Besides, when λ 2 is large, the steady-state density of I 1 A spreaders will grow sharply with the increase of λ 1. This is because the larger λ 2 keeps the infected density of I 1 B spreaders at a high level. The increase of λ 1 will not only make these large number of I 1 B spreaders change their opinions into I 1 A state with a great probability, but also guide more S and H individuals to become I 1 A spreaders. Both the large infectivity and potential population base contribute to a sharp increase in the steady-state density of I 1 A spreader, which presents a transient process of discontinuous phase. The similar analysis also applies to the changing trend of I 1 B spreader density influenced by I 1 A and I 1 B .

Figure 3B illustrates how I 1 A and I 1 B are affected by the transmission rate θ 1 and θ 2. The color scale of I 1 A ( ) (left) ranges from 0,0.2480 , and the color scale of I 1 B ( ) (right) ranges from 0,0.2930 . It can be seen that the changing trends of I 1 A and I 1 B are completely complementary, which further verifies the competition between two kinds of information. With the increase of θ 1, the probability of I 1 A spreaders receiving negative information and turning into I 1 B status may become larger significantly, thereby improving (decreasing) the density of I 1 B ( I 1 A ) spreaders. Similarly, the increase in θ 2 will cause more I 1 B individuals to change their opinions and become the I 1 A spreaders.

Figure 3C depicts the changing trend of I 1 A and I 1 B influenced by λ 1 and μ. The color scale of I 1 A ( ) (left) ranges from 0,0.5758 , and the color scale of I 1 B ( ) (right) ranges from 0,0.5176 . When both λ 1 and μ are small, the negative information propagation is dominant, and the system will converge to the information-endemic equilibrium with non-zero I 1 B . However, when λ 1 exceeds a certain threshold, the infectivity of positive information is stronger than that of negative information, thereby the system may converge to other equilibrium with non-zero I 1 A . The transformation of equilibrium is a process of discontinuous phase transition. Further increases in λ 1 will extend the prevalence of I 1 A . No matter I 1 A or I 1 B is dominant, the increase in μ can significantly reduce the steady-state density of positive and negative information. And when μ is large enough, both kinds of information will eventually die out and the system will stabilize at the information-free equilibrium.

Figure 3D provides the changing trend of steady-state I 1 A under the influence of ξ and δ. The color scale of I 1 A ( ) ranges from 0,0.9865 . As ξ becomes larger, the number of S individuals may grow to participate in information propagation process, thus the individuals infected as I 1 A spreaders will also increase correspondingly. On the contrary, the increase in δ not only directly removes more I 1 A spreaders from information propagation, but also reduces the probability of individuals in other states being infected by positive information.

Figure 3E shows the changing trend of steady-state I 1 A under the influence of k 1 and k 2 . The color scale of I 1 A ( ) ranges from 0,0.3156 . We can see that the increase of both k 1 and k 2 can expand the steady-state density of I 1 A spreaders. This is because larger k 1 will enhance the correlation between individuals in layer 1, making the probability of S and I 1 B individuals receiving positive information larger, thus increasing the density of I 1 A spreaders. Besides, a larger k 2 will also strengthen the interaction intensity of individuals in layer 2 and make more individuals become I 2 A spreaders, thus increasing the density of individuals being infected as I 1 A in layer 1 through the inter-layer edges.

FIGURE 3
www.frontiersin.org

FIGURE 3. Phase diagram of correlation between spreading parameters and system steady-state characteristics. (A) I 1 A ( ) , I 1 B ( ) v.s. λ 1, λ 2; (B) I 1 A ( ) , I 1 B ( ) v.s. θ 1, θ 2; (C) I 1 A ( ) , I 1 B ( ) v.s. λ 1, μ; (D) I 1 A ( ) v.s. ξ, δ; (E) I 1 A ( ) v.s. k 1 , k 2 .Parameter settings are listed as: (A) θ 1 = 0.2, θ 2 = 0.15, k 1 = 4, k 2 = 3, k 12 = 3, k 21 = 2, ω 1 = 0.6, ω 2 = 0.55, ξ = 0.2, δ = 0.2, κ = 0.5, μ = 0.3; (B) λ 1 = 0.25, λ 2 = 0.35, k 1 = 4, k 2 = 3, k 12 = 3, k 21 = 2, ω 1 = 0.6, ω 2 = 0.55, ξ = 0.2, δ = 0.2, κ = 0.5, μ = 0.3; (C) λ 2 = 0.25, θ 1 = 0.2, θ 2 = 0.15, k 1 = 4, k 2 = 3, k 12 = 3, k 21 = 2, ω 1 = 0.6, ω 2 = 0.55, ξ = 0.2, δ = 0.2, κ = 0.5; (D) λ 1 = 0.25, λ 2 = 0.23, θ 1 = 0.2, θ 2 = 0.15, k 1 = 4, k 2 = 3, k 12 = 3, k 21 = 2, ω 1 = 0.6, ω 2 = 0.55, κ = 0.5, μ = 0.3; (E) λ 1 = 0.25, λ 2 = 0.23, θ 1 = 0.2, θ 2 = 0.15, k 12 = 3, k 21 = 2, ω 1 = 0.6, ω 2 = 0.55, ξ = 0.2, δ = 0.2, κ = 0.5, μ = 0.3.

In order to further verify the correctness of our Theorems 3.1–3.3 on the stability analysis of information-free and information-endemic equilibria, we construct the evolution trajectory of infection states I 1 A , I 1 B , I 2 A , I 2 B under four settings of heterogeneous spreading parameters, which is shown in Figure 4. Each setting all covers 7 cases with different initial value conditions. Next, we separately discuss the results under four heterogeneous settings: (1) Setting 1: R 0 = 4.2182 > 1 . No matter what the initial value condition is, the time-varying trajectory of infection states in all cases will converge to an information-endemic equilibrium E* = (0.3927, 0, 0.3377, 0), where positive information is dominant, and there is little difference between the trajectory evolution in layer 1 and layer 2. (2) Setting 2: R 0 = 2.8122 > 1 , similarly, no matter what the initial value condition is, the infection states in all cases will converge to an information-endemic equilibrium E* = (0, 0.3363, 0, 0.2614), where negative information is dominant; (3) Setting 3: R 0 = 2.1091 > 1 , the infection states in all cases will converge to an information-endemic equilibrium E* = (0.2784, 0, 0.1905, 0) where positive information is dominant; (4) Setting 4: R 0 = 0.9097 < 1 , the infection states in all cases gradually die out and finally converge to an information-free equilibrium E 0 = (0, 0, 0, 0). To sum up, the basic reproduction number R 0 determines the stable state of the system. To be more precise, the propagation parameters associated with R 0 significantly affect the evolution trend and steady-state conditions of the system, which are not related to the initial value conditions.

FIGURE 4
www.frontiersin.org

FIGURE 4. The evolution trajectory of infection states I 1 A , I 1 B , I 2 A , I 2 B under four settings of heterogeneous spreading parameters. Homogeneous parameter settings are listed as: k 2 = 5, k 12 = 3, k 21 = 2, θ 1 = 0.2, θ 2 = 0.15, ξ = 0.3, δ = 0.3, κ = 0.5, μ = 0.3. And heterogeneous parameter settings are: (A) k 1 = 8, λ 1 = 0.30, λ 2 = 0.08; (B) k 1 = 8, λ 1 = 0.15, λ 2 = 0.20; (C) k 1 = 5, λ 1 = 0.15, λ 2 = 0.08; (D) k 1 = 6, λ 1 = 0.05, λ 2 = 0.08.

Furthermore, we explore the effects of weights ω 1 and ω 2 on the dynamical trend of positive and negative information. It is remarkable that larger ω 1 and ω 2 indicate that hesitant individuals consider the local information prevalence when deciding which information to believe, while smaller ω 1 and ω 2 imply that hesitant individuals consider the global information prevalence more. Figure 5 shows the evolution of I 1 A (t), I 1 B (t), I 2 A (t) and I 2 B (t) under different combinations of ω 1 and ω 2. From our parameter settings, it can be observed that: 1) the connection between nodes in layer 1 is tighter; 2) the spreading of negative information is more dominant that positive information. According to the comparison of Figures 5A,B, the spreading rate and prevalence of information in layer 1 are significantly higher than those in layer 2. This can be well-understood as: more edge relationships between nodes provide greater probability for information propagation. More interestingly, positive and negative information in layer 1 and 2 has the same evolution trend under different ω 1 and ω 2. Taking the spreading process of negative information as an example, the case where H 1 individuals consider more local prevalence and H 2 individuals consider more global prevalence corresponds to the fastest spreading rate and the highest prevalence of negative information. On the contrary, the case where H 1 individuals consider more global prevalence and H 2 individuals consider more local prevalence leads to the slowest spreading rate and the lowest prevalence of negative information. This can be interpreted as: the negative information in layer 1 has a larger propagation tendency due to a tighter network topology, while the negative information in layer 2 has a limited spreading prevalence due to sparse network connections. H 1 individuals still have a strong tendency to become I 1 B status if they consider more local prevalence, but their tendency to become I 1 B status is weakened by the lower I 2 B density if they consider more global prevalence. Similarly, if H 2 individuals consider more local prevalence, their tendency to transform into I 2 B status will be reduced because the lower I 2 B density in their resident layer. But if H 2 individuals consider more global prevalence, they are more willing to become I 2 B status under the influence of a larger I 1 B . In addition, when ω 1 and ω 2 are assigned the same settings, the larger ω 1 and ω 2 are, the more I 1 B and I 2 B will be. This is because a larger ω 1 greatly promotes the transition from H 1 to I 1 B . Although H 2 individuals takes more consideration of the prevalence in their resident layer, a larger I 1 B can still significantly improve the transition probability from H 2 to I 2 B . On the contrary, a smaller ω 1 means that the propagation of I 1 B is limited by the smaller I 2 B , and the probability of H 1 becoming I 1 B is significantly reduced, thus weakening the influence on H 2. The conclusion of positive information can refer to the above analysis of negative information.

FIGURE 5
www.frontiersin.org

FIGURE 5. The infection states I 1 A ( t ) , I 1 B ( t ) , I 2 A ( t ) , I 2 B ( t ) under five different combinations of ω 1 and ω 2. (A) time v.s. I 1 A ( t ) ; (B) time v.s. I 1 B ( t ) ; (C) time v.s. I 2 A ( t ) ; (D) time v.s. I 2 B ( t ) . Parameter settings are listed as: S 1 (0) = 0.5, I 1 A ( 0 ) = I 1 B ( 0 ) = 0.25, S 2 (0) = 0.9, I 2 A ( 0 ) = I 2 B ( 0 ) = 0.1, λ 1 = 0.08, λ 2 = 0.05, θ 1 = 0.2, θ 2 = 0.15, k 2 = 8, k 2 = 3, k 12 = 4, k 21 = 2, ξ = δ = μ = 0.3, κ = 0.5.

To assess the performance of the proposed control mechanism, we introduce the following five control strategies, including our optimal control and other four baselines.

• No control: The system evolves naturally without implementing any control, namely, v 1(t) = 0, v 2(t) = 0;

• Constant control 1: The controls are time invariant, namely, v 1(t) = 0.15, v 2(t) = 0.15;

• Constant control 2: The controls are time invariant, namely, v 1(t) = 0.25, v 2(t) = 0.25;

• Heuristic control: The controls are referred as feedback mechanism based on I 1 B , I 2 B , H 1 and H 2 time-varying state density, namely,

     v 1 ( t ) = α I 1 B ( t ) + I 2 B ( t ) 2 ,

     v 2 ( t ) = α H 1 ( t ) + H 2 ( t ) 2 , α = 0.8;

• Optimal control: The controls follow Eqs 4.11—4.21.

Figure 6 illustrates the comparative results of cumulative costs under five strategies. As can be observed from Figure 6A, both the optimal and heuristic controls achieve the lower total cost in the control interval, while the total costs with no control and two constant controls are relatively high. Under no control strategy, even without the introduction of control cost, the corresponding infection cost will be very high because the current information prevalence is the largest. For the two constant controls, they merely focus on the control performance without any cost constraints. Therefore, although constant controls have significant suppression effect on the diffusion of negative information, their larger control intensity leads to the higher control costs. The results in Figures 6B, C also confirm these explanations. As the heuristic control strategy is a feedback mechanism to the time-varying infection prevalence, it can still inhibit the prevalence of negative information to a certain extent, but the control performance is worse than constant controls and optimal control. Another interesting phenomenon is that although our optimal control strategy can significantly inhibit the spread of negative information, the control intensity of the two heterogeneous costs is quite different. From Figures 6C,D, the intervention effect on the spreaders of negative information is significantly stronger than that on the hesitant individuals, which may be because hesitate status has no infectivity and does not significantly promote the spread of negative information. This also indicates that in order to achieve the ideal control performance, decision-makers should attach more importance on the direct restrictions towards the sources of negative information, instead of indirect control with little benefits towards hesitate individuals.

FIGURE 6
www.frontiersin.org

FIGURE 6. The total cost, infection cost, control cost1 and control cost2 under five different control strategies. (A) time v.s. total cost; (B) time v.s. infection cost; (C) time v.s. control v 1 cost; (D) time v.s. control v 2 cost. Parameter settings are listed as: S 1 (0) = S 2 (0) = 0.7, I 1 A ( 0 ) = I 1 B ( 0 ) = I 2 A ( 0 ) = I 2 B ( 0 ) = 0.15, λ 1 = 0.35, λ 2 = 0.25, θ 1 = 0.2, θ 2 = 0.15, k 2 = 8, k 2 = 5, k 12 = 3, k 21 = 2, ξ = δ = μ = 0.3, κ = 0.5, ω 1 = 0.6, ω 2 = 0.4, d 1 = 0.3, d 2 = d 3 = 0.65.

Figure 7 presents the time-varying trend comparison of positive/negative information prevalence I 1 A ( t ) , I 1 B ( t ) , I 2 A ( t ) , I 2 B ( t ) under five control strategies. We can investigate that the evolution trends of positive/negative information in two different layers are almost consistent, but the information prevalence in layer 1 is larger than that in layer 2. Optimal, constant and heuristic controls can significantly reduce the real-time infection density of negative information and increase the density of positive information. Meanwhile, these controls also accelerate the spreading process to reach a steady state. In the initial propagation stage, our optimal control strategies play the most significant role in promoting the positive information propagation while suppressing the negative information propagation. And this control advantage will gradually weaken over time, because our controls will decline to 0 when approaching the control time terminal. Two constant control strategies have strong inhibition effects on negative information due that they always maintain high control intensity without cost constraint. Heuristic control is limited by the time-dependent density of negative information spreaders and hesitate individuals, and its control intensity is low, which makes its inhibition effect on negative information relatively poor.

FIGURE 7
www.frontiersin.org

FIGURE 7. The infection states I 1 A , I 1 B , I 2 A , I 2 B under five different control strategies. (A) time v.s. I 1 A ( t ) ; (B) time v.s. I 1 B ( t ) ; (C) time v.s. I 2 A ( t ) ; (D) time v.s. I 2 B ( t ) . Parameter settings are the same as that in Figure 6.

6 Conclusion

In this paper, we have investigated the propagation dynamics of competitive information on multi-layer interconnected networks. On the one hand, we explored the correlation between information propagation and multi-layer network topology. On the other hand, we introduced individual adaptive behavior towards information propagation, i.e., the tendency of an infected individual to become a spreader of positive or negative information depends on the weighted consideration of local and global information prevalence. Under such propagation mechanism, the basic reproduction number R 0 was theoretically calculated via next-generation matrix method. Based on the critical condition of R 0 , the asymptotic stability of information-free and information-endemic equilibria was proven. That is, if R 0 < 1 , the information-free equilibrium is globally stable, and if R 0 > 1 , the information-endemic equilibrium is globally stable. Furthermore, we also designed two heterogeneous controls, which aims to maximize the spread of positive information and suppress the prevalence of negative information: 1) one is direct control mode, which persuades the spreaders of negative information to transform into the spreaders of positive information; 2) the other is indirect control mode, which guides hesitate individuals to become the spreaders of positive information. Then considering the cost constraints of the implementation of control strategies in reality, we developed an optimal control problem to solve the trade-off between the spreading prevalence of negative information and the control cost. Correspondingly, we provided the theoretical proof of the existence, analytical formulation and uniqueness of the optimal solution. Finally, the theoretical results of stability analysis and the performance of the optimal control were verified and discussed through numerical simulation. Extensive simulation experiments show that: 1) The different combinations of spreading parameters λ 1, λ 2, θ 1, θ 2, ω 1, ω 2, δ, μ, ξ not only affect the dynamic evolution process of information propagation, but also significant change the basic reproduction number and steady-state information prevalence. Driven by various spreading parameters, the steady-state behavior of our dynamic system may exhibit continuous or discontinuous phase transitions, which can serve as a theoretical guidance to regulate the steady-state system behavior via tuning spreading parameters. 2) Our optimal control strategy has achieved remarkable performance in both suppressing the spread of negative information and reducing total cost. Meanwhile, under the framework of optimal control, the direct control towards negative spreaders is significantly more dominant than the indirect control towards hesitant individuals. This theoretical result inspires decision-makers to attach more importance on the spreaders of negative information rather than hesitant individuals when conducting public opinion control in practice.

We provide two possible directions in the future: 1) our model assumes that the spreading parameters and the inter-layer average degree are time-invariant. However, in real life, information propagation is a rather complicated process associated with numerous social and cognitive psychology factors. Therefore, our model will be improved if the spreading parameters and topology settings are described as time-dependent variables driven by more social and psychological factors; 2) Our current control strategies are continuous within the specific time interval, however, in practical scenario, decision-makers can only intervene in the spreading processes at discrete time due to cost constraints. Therefore, we can introduce discrete controls to formulate the optimization problem, and discuss the optimal intensity and interval of these controls.

Data availability statement

The original contributions presented in the study are included in the article/Supplementary material, further inquiries can be directed to the corresponding author.

Author contributions

LC: Conceptualization, Formal Analysis, Funding acquisition, Methodology, Project administration, Supervision, Writing–original draft, Writing–review and editing. HZ: Formal Analysis, Methodology, Software, Validation, Writing–original draft. XW: Formal Analysis, Methodology, Software, Validation, Writing–review and editing. XA: Formal Analysis, Methodology, Software, Validation, Visualization, Writing–review and editing.

Funding

The author(s) declare financial support was received for the research, authorship, and/or publication of this article. This work was supported by the Shandong Social Science Planning Fund Program under Grant No. 20CGLJ24.

Conflict of interest

The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

Publisher’s note

All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.

References

1. Lenormand M, Gonçalves B, Tugores A, Ramasco JJ. Human diffusion and city influence. J R Soc Interf (2015) 12:20150473. doi:10.1098/rsif.2015.0473

PubMed Abstract | CrossRef Full Text | Google Scholar

2. Jin C, Li B, Jansen SJT, Boumeester HJFM, Boelhouwer PJ. What attracts young talents? Understanding the migration intention of university students to first-tier cities in China. Cities (2022) 128:103802. doi:10.1016/j.cities.2022.103802

CrossRef Full Text | Google Scholar

3. Jiang H, Jiang P, Wang D, Wu J. Can smart city construction facilitate green total factor productivity? A quasi-natural experiment based on China’s pilot smart city. Sustain Cities Soc (2021) 69:102809. doi:10.1016/j.scs.2021.102809

CrossRef Full Text | Google Scholar

4. Sardar T, Nadim SS, Rana S. Detection of multiple waves for COVID-19 and its optimal control through media awareness and vaccination: study based on some Indian states. Nonlinear Dyn (2023) 111:1903–20. doi:10.1007/s11071-022-07887-5

PubMed Abstract | CrossRef Full Text | Google Scholar

5. Tiwari PK, Rai RK, Khajanchi S, Gupta RK, Misra AK. Dynamics of coronavirus pandemic: effects of community awareness and global information campaigns. Eur Phys J Plus (2021) 136:994. doi:10.1140/epjp/s13360-021-01997-6

PubMed Abstract | CrossRef Full Text | Google Scholar

6. Rai RK, Khajanchi S, Tiwari PK, Venturino E, Misra AK. Impact of social media advertisements on the transmission dynamics of COVID-19 pandemic in India. J Appl Math Comput (2022) 68:19–44. doi:10.1007/s12190-021-01507-y

PubMed Abstract | CrossRef Full Text | Google Scholar

7. Yuan Y, Li N. Optimal control and cost-effectiveness analysis for a COVID-19 model with individual protection awareness. Phys A: Statist Mech Appl (2022) 603:127804. doi:10.1016/j.physa.2022.127804

CrossRef Full Text | Google Scholar

8. Pertwee E, Simas C, Larson HJ. An epidemic of uncertainty: rumors, conspiracy theories and vaccine hesitancy. Nat Med (2022) 28:456–9. doi:10.1038/s41591-022-01728-z

PubMed Abstract | CrossRef Full Text | Google Scholar

9. Harper T, Attwell K. How vaccination rumours spread online: tracing the dissemination of information regarding adverse events of covid-19 vaccines. Int J Public Health (2022) 30:1604228. doi:10.3389/ijph.2022.1604228

CrossRef Full Text | Google Scholar

10. Islam MS, Kamal AHM, Kabir A, southern DL, Khan SH, Hasan SMM, et al. COVID-19 vaccine rumors and conspiracy theories: the need for cognitive inoculation against misinformation to improve vaccine adherence. Plos One (2021) 16(5):e0251605. doi:10.1371/journal.pone.0251605

PubMed Abstract | CrossRef Full Text | Google Scholar

11. Yu Z, Lu S, Wang D, Li Z. Modeling and analysis of rumor propagation in social networks. Inf Sci (2021) 580:857–73. doi:10.1016/j.ins.2021.09.012

CrossRef Full Text | Google Scholar

12. Yin F, Xia X, Zhang X, Zhang M, Lv J, Wu J. Modelling the dynamic emotional information propagation and guiding the public sentiment in the Chinese Sina-microblog. Appl Math Comput (2021) 396:125884. doi:10.1016/j.amc.2020.125884

CrossRef Full Text | Google Scholar

13. Zhu Q, Zhang G, Luo X, Gan C. An industrial virus propagation model based on SCADA system. Inf Sci (2023) 630:546–66. doi:10.1016/j.ins.2022.12.119

CrossRef Full Text | Google Scholar

14. Lucarelli A, Olof BP. City branding: a state-of-the-art review of the research domain. J Place Manage Dev (2011) 4(1):9–27. doi:10.1108/17538331111117133

CrossRef Full Text | Google Scholar

15. Perez-Cornejo C, Rodríguez-Gutierrez P, Quevedo-Puente E. City reputation and the role of sustainability in cities. Sustain Dev (2023) 31(3):1444–55. doi:10.1002/sd.2459

CrossRef Full Text | Google Scholar

16. Delgado-García JB, Quevedo-Puente E, Blanco-Mazagatos V. The impact of city reputation on city performance. Reg Stud (2018) 52(8):1098–110. doi:10.1080/00343404.2017.1364358

CrossRef Full Text | Google Scholar

17. Aloweidi A, Bsisu I, Suleiman A, Abu-Halaweh S, Almustafa M, Aqel M, et al. Hesitancy towards COVID-19 vaccines: an analytical cross–sectional study. Int J Environ Res Public Health (2021) 18(10):5111. doi:10.3390/ijerph18105111

PubMed Abstract | CrossRef Full Text | Google Scholar

18. Wu J, Tang B, Bragazzi NL, Nah K, McCarthy Z. Quantifying the role of social distancing, personal protection and case detection in mitigating covid-19 outbreak in Ontario, Canada. J Math Ind (2020) 10(1):15–2. doi:10.1186/s13362-020-00083-3

PubMed Abstract | CrossRef Full Text | Google Scholar

19. Jarvis CI, Van Zandvoort K, Gimma A, Prem K, Klepac P, Rubin GJ, et al. Quantifying the impact of physical distance measures on the transmission of COVID-19 in the UK. BMC Med (2020) 18:124. doi:10.1186/s12916-020-01597-8

PubMed Abstract | CrossRef Full Text | Google Scholar

20. Sharevski F, Huff A, Jachim P, Pieroni E. (Mis) perceptions and engagement on twitter: COVID-19 vaccine rumors on efficacy and mass immunization effort. Int J Inf Manag Data Insights (2022) 2(1):100059. doi:10.1016/j.jjimei.2022.100059

CrossRef Full Text | Google Scholar

21. Fan J, Wang X, Du S, Mao A, Du H, Qiu W. Discussion of the trust in vaccination against COVID-19. Vaccines (2022) 10(8):1214. doi:10.3390/vaccines10081214

PubMed Abstract | CrossRef Full Text | Google Scholar

22. Antonopoulos CG, Shang Y. Opinion formation in multiplex networks with general initial distributions. Sci Rep (2018) 8:2852. doi:10.1038/s41598-018-21054-0

PubMed Abstract | CrossRef Full Text | Google Scholar

23. Yin F, Pan Y, Tang X, Wu C, Jin Z, Wu J. An information propagation network dynamic considering multi-platform influences. Appl Math Lett (2022) 133:108231. doi:10.1016/j.aml.2022.108231

CrossRef Full Text | Google Scholar

24. Wang J, Jiang H, Ma T, Hu C. Global dynamics of the multi-lingual SIR rumor spreading model with cross-transmitted mechanism. Chaos Sol Fract (2019) 126:148–57. doi:10.1016/j.chaos.2019.05.027

CrossRef Full Text | Google Scholar

25. Wang J, Wang YQ, Li M. Rumor spreading considering the herd mentality mechanism. In: 36th Chinese Control Conference; 26-28 July 2017; Dalian, China (2017). p. 1480–5.

CrossRef Full Text | Google Scholar

26. Xiao Y, Chen D, Wei S, Li Q, Wang H, Xu M. Rumor propagation dynamic model based on evolutionary game and anti-rumor. Nonlinear Dyn (2019) 95:523–39. doi:10.1007/s11071-018-4579-1

CrossRef Full Text | Google Scholar

27. Wang Q, Yang X, Xi W. Effects of group arguments on rumor belief and transmission in online communities: an information cascade and group polarization perspective. Inf Manage (2018) 55:441–9. doi:10.1016/j.im.2017.10.004

CrossRef Full Text | Google Scholar

28. Hosni AIE, Li K, Ahmad S. Minimizing rumor influence in multiplex online social networks based on human individual and social behaviors. Inf Sci (2020) 512:1458–80. doi:10.1016/j.ins.2019.10.063

CrossRef Full Text | Google Scholar

29. Zareie A, Sakellariou R. Minimizing the spread of misinformation in online social networks: a survey. J Netw Comput Appl (2021) 186:103094. doi:10.1016/j.jnca.2021.103094

CrossRef Full Text | Google Scholar

30. Yan R, Li Y, Wu W, Li D, Wang Y. Rumor blocking through online link deletion on social networks. ACM Trans Knowl Discov Data (2019) 13(2):1–26. doi:10.1145/3301302

CrossRef Full Text | Google Scholar

31. Wang B, Chen G, Fu L, Song L, Wang X. Drimux: dynamic rumor influence minimization with user experience in social networks. IEEE Trans Knowl Data Eng (2017) 29(10):2168–81. doi:10.1109/tkde.2017.2728064

CrossRef Full Text | Google Scholar

32. Cheng Y, Huo L, Zhao L. Stability analysis and optimal control of rumor spreading model under media coverage considering time delay and pulse vaccination. Chaos Sol Fract (2022) 157:111931. doi:10.1016/j.chaos.2022.111931

CrossRef Full Text | Google Scholar

33. Chen S, Jiang H, Li L, Li J. Dynamical behaviors and optimal control of rumor propagation model with saturation incidence on heterogeneous networks. Chaos Sol Fract (2020) 140:110206. doi:10.1016/j.chaos.2020.110206

CrossRef Full Text | Google Scholar

34. Lin Y, Wang X, Hao F, Jiang Y, Wu Y, Min G, et al. Dynamic control of fraud information spreading in mobile social networks. IEEE Trans Syst Man Cybern Syst (2021) 51(6):3725–38. doi:10.1109/tsmc.2019.2930908

CrossRef Full Text | Google Scholar

35. Li L, Liu Y, Zhou Q, Yang W, Yuan J. Targeted influence maximization under a multifactor-based information propagation model. Inf Sci (2020) 519:124–40. doi:10.1016/j.ins.2020.01.040

CrossRef Full Text | Google Scholar

36. Wang X, Wang X, Min G, Hao F, Chen CLP. An efficient feedback control mechanism for positive/negative information spread in online social networks. IEEE Trans Cybern (2022) 52(1):87–100. doi:10.1109/tcyb.2020.2977322

PubMed Abstract | CrossRef Full Text | Google Scholar

37. Van den Driessche P, Watmough J. Reproduction numbers and sub-threshold endemic equilibria for compartmental models of disease transmission. Math Biosci (2002) 180:29–48. doi:10.1016/s0025-5564(02)00108-6

PubMed Abstract | CrossRef Full Text | Google Scholar

38. Shang Y. Lie algebraic discussion for affinity based information diffusion in social networks. Open Phys (2017) 15(1):705–11. doi:10.1515/phys-2017-0083

CrossRef Full Text | Google Scholar

39. Fleming WH, Rishel RW. Deterministic and stochastic optimal control. New York: Springer (1975).

Google Scholar

Keywords: competitive information propagation, local-global prevalence, multi-layer networks, individual adaptive behavior, optimal control

Citation: Cao L, Zhao H, Wang X and An X (2023) Competitive information propagation considering local-global prevalence on multi-layer interconnected networks. Front. Phys. 11:1293177. doi: 10.3389/fphy.2023.1293177

Received: 12 September 2023; Accepted: 12 October 2023;
Published: 31 October 2023.

Edited by:

Ayse Peker-Dobie, Istanbul Technical University, Türkiye

Reviewed by:

Yilun Shang, Northumbria University, United Kingdom
Ali Demirci, Istanbul Technical University, Türkiye

Copyright © 2023 Cao, Zhao, Wang and An. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.

*Correspondence: Li Cao, Y2xqeTcxN0AxNjMuY29t

Disclaimer: All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article or claim that may be made by its manufacturer is not guaranteed or endorsed by the publisher.