# A Discrete Mathematical Modeling and Optimal Control of the Rumor Propagation in Online Social Network

Authors: Amine El Bhih; Rachid Ghazzali; Soukaina Ben Rhila; Mostafa Rachik; Adil El Alami Laaroussi
Journal: Discrete Dynamics in Nature and Society
 (2020)

---

## Abstract

In this paper, a new rumor spreading model in social networks has been investigated. We propose a new version primarily based on the cholera model in order to take into account the expert pages specialized in the dissemination of rumors from an existing IRCSS model. In the second part, we recommend an optimal control strategy to fight against the spread of the rumor, and the study aims at characterizing the three optimal controls which minimize the number of spreader users, fake pages, and corresponding costs; theoretically, we have proved the existence of optimal controls, and we have given a characterization of controls in terms of states and adjoint functions based on a discrete version of Pontryagin’s maximum principle. To illustrate the theoretical results obtained, we propose numerical simulations for several scenarios applying the forward-backward sweep method (FBSM) to solve our optimality system in an iterative process.


---

## Body

## 1. Introduction

The spread of rumors is a complicated phenomenon that has occupied a large place in human life since ancient times; civilizations have studied and analyzed this phenomenon where many elements overlap and intervene, including what is natural, sociological, economic, and psychological. History has recognized over the years the emergence of many rumors that have spread extensively among communities; it was once the center of interaction and evaluation by company commanders throughout history, and people invent rumors and spread them so that they can be used for political or financial purposes. Rumors can make an industry prosper, while it can also wrest victory from the jaws of defeat. The rumor phenomenon has recognized many changes in its composition with the existence and increasing use of technological capabilities and modern online technologies that companies recognize. This phenomenon has given another dimension since it has been used using the media and genius in the competition between countries and what is recognized as buzz or propaganda and controversy using the publication of false news in whole or partly to influence power with opponents of power. Confined to the elections between Trump and Hillary, where Hillary was the most popular and was the favorite of political researchers [1] until the closing month before the presidential election, where some of the competent communication agencies published many news about Hillary, this news played an important and fundamental role in influencing public opinion and turning the scales in favor of Trump who eventually won, Jennifer et al. in their article [2] gave a contribution to understand the dynamics of this unusual campaign in which social media played a major role. In [3], we can find a collection of Trump tweets divided by subjects (people, places, and things Trump has insulted on twitter) who ultimately received mathematical modeling is one of the most necessary functions of arithmetic that make a contribution to the representation and simulation of social, economic, organic, and ecological phenomena and convert them into mathematical equations that are formulated, studied, analyzed, and interpreted their results as an example; Cazzoli et al. analyzed the impact of tweets on the financial market [4], for example, Vilas et al. analyzed the interference between cryptocurrencies and company tickers in the London stock [5].In this context, many researchers have developed specific mathematical fashions representing the dynamics of the rumor and the factors interfering with its spread [6–9]. In this work and primarily based on the model they proposed, we introduce a new approach by taking into account the spread of rumors through social media. We will describe and explain the model we will use here. As we mentioned, many organizations which specialized in propaganda dissemination have grown to be the usage of social media to facilitate unfold of the rumor and large volume of users. For this purpose, extraordinary pages are created to unfold a rumor about a unique situation or target person. This page is promoted by means of fictitious customers created for this purpose. They create a private network of friends, friends instead are the first victims; each and every time they like or comment on what is posted on the page or fictitious people, this pastime is displayed to all their pals or possibly pals of their buddies inadvertently which is promoted by using this rumor passively by them, while research indicates that the number of users of the networks is rising at a magnificent charge, and it has come to be one of the basics in the discipline of communication and publicity, and in accordance to statistics, what is dealt with millions of rumors spread every day and in view that, in 2019, the entire of Russia is considering the decision to attend some web sites as Telegram because of the threat that brings countrywide security. And if some rumors arouse ridicule, such as announcing that Nicolas Cage was dracula, others were of magnificent danger; to see greater in this regard, we refer the reader to the interesting book [10].In 1927, Kermack and McKendrick [11] were the first researchers on mathematical epidemiology to suggest the susceptible-infected-removed (SIR) model that describes the rapid explosion of an infectious disease for a short time. In 1964, Goffman and Newill developed in their article titled “Generalization of epidemic principle: an application to the transmission of thoughts,” [12] a new notion for modeling the transmission of ideas within a society based on the mathematical model SIR due to the terrific similarity between the two phenomena. This model was earlier used to model the transmission of diseases and epidemics inside communities; in the introduction of their work, the authors cited that the method which has been already described does not take into account the almost endless variety of complexities which in reality arise [12]. Based on the preceding work, Daley and Kendall in their letter titled “Epidemics and Rumours” counseled making use of the preceding thought to modeling the unfold of rumors inside communities [13]. With the development of societies and the emergence of contemporary technological means (transport-communication), new elements have emerged that similarly complicate the phenomenon of rumor and contribute to the massive spread of rumors; this has led many researchers to think about growing the previous model. As an example, the work that has been done by Bettencourt et al. [14], authors proposed a new model taking into account new factors by extending the SIR model to a SEIZR model with two additional compartments. In the same context, Laarabi et al. [15] developed and analyzed the delayed model for the transmission dynamics of rumor with constant recruitment and incubation period. This is in addition to many current works that have currently been produced that take into account quite a few factors concerned in the development of a thought that truly simulates the dynamics of hearsay propagation; to take a broader view, the reader is referred to the article [16]. There are other works which have modeled the phenomenon of rumor propagation using other approaches, for example, complex-network opinion dynamics models, among which, Wang et al. [17] established a new comprehensive model; this model captures the role of memory, the effects of conformity, the differences in the subjective propensity to produce distortions, and the variations in the degree of trust that people have in each other through the concept of entropy of information. In addition, they have developed this model in [18] by taking into account information distortion and polarization effects in order to modeling imprecision in human memory and communication and the consequent progressive drift of information. Based on the single-issue opinion dynamics model, Tan and Cheong [19] incorporated a general model of multi-issue opinion dynamics where the agreement on one issue can promote greater inclusivity in discussing other issues. With the emergence of social networks and their impact on verbal exchange within communities, the place they are taking extra and greater area within the community, it grew to be clear that they should be taken into account as a principal intervening in the unfold of rumors; in this context, many research studies which adopt this hypothesis have been carried out to take thinking on some of these works, see the article [20], for instance, in the work [21], authors had implemented a mathematical model in order to modeling the dynamics of a rumor in the social community with the aid of adding three new compartments: reviewers, sharers, and collectors, people who review the message, accumulate the message, share the message, or do not respond to the message, respectively; however, in the work [21], authors have been restricted to highlight the function of customers of the community and omit the effect of the network itself, in particular, the function of pages that spread the rumor inside the network; the loading of false information in these pages is a source of hearsay between browsers and is considered as a big element which helps in the rapid unfold of rumors, such as rivers and valleys, which store microorganism and microbes and are a hotbed for the multiplication and growth of bacteria that transmit diseases to human beings through the use of water of those rivers; a proper instance of this similarity is the cholera epidemic. In this work, we propose a new model which describes the dynamics of rumor spread through social media based on the cholera model [22] and combine it with the previous work model by adding new cubicles P which represent the page’s rumor. Moreover, we apply an optimal control strategy in order to fight against the spread of the rumor through social media; regarding to this, we use theoretical results provided by Balatif et al. [23], where authors implemented a discrete time model that describes the dynamics of voters, and they proposed an optimal control strategy; the same idea and strategy were applied by Labzai et al. [24], and in order to modeling and control smoking, Kouidere et al. [25] suggested a model of the evolution from prediabetes to diabetes with optimal control approach. Other models from optimal control problems and population dynamics can be found in [26–30].In this paper, in Section2, we propose a discrete ISpStP mathematical model that describes the dynamic of a population that reacts in the spread of the rumor in a social network. In Section 3, we present an optimal control problem for the proposed model where we give some results concerning the existence of the optimal control, and we characterize the optimal controls using the Pontryagin maximum principle in discrete time. Numerical simulations through MATLAB are given in Section 4. Finally, we conclude the paper in Section 5.


## 2. Mathematical Model and Simulation without Controls

In this section, we consider a discrete mathematical modelISpStP that will describe the dynamics of a population of rumors; our model consists of four compartments representing the subdivision of the population that reacts in the spread of the rumor in a social network:I: ignorant, users who do not know the rumor and susceptible to be informedSp: spreader, users who spread the rumorSt: stifler, individuals who refuse to spread the rumorP: rumor’s page, the page specialized in spreading the rumorThe compartmentI represents the number of users who do not understand the rumor and who are susceptible to be informed, and this population increases with the charge μN which represents the new customers created; an ignorant inquires about the rumor through two ways, either by using consulting a specialized page in the diffusion of the rumor or at once by means of the contact with a spreader; some of these users deactivate their account at a rate μI. Thus, in this compartment, we have an incoming flux which equals to μN and an outgoing flux which equals to αhSpI+αeIP/κ+P+μI.The compartmentSp: this compartment represents the number of humans who spread the rumor either immediately or by way of sharing one-page publications or via developing new publications. Thus, we have an incoming flux which equals to θαhSpI+αeIP/κ+P which represents the proportion of the new users who will spread the rumor. After the contact between two spreaders, one of them decides not to diffuse the information at a rate γSp2, and after the contact of a spreader and a stifler, the stifler succeeds to convince him that the information is false at a rate λStSp; after a certain period, a portion of the spreaders decide not to spread the rumor at a rate βSp.The compartmentSt: this compartment represents the number of stiflers who refuse to spread the rumor. This number increases at a rate 1−θαhSpI+αeIP/κ+P which represents the portion of users who knew that the information is wrong, in addition to the flux that left the Sp compartment SpγSp+λSt+βSp, and decreases with the rate μ1St of stiflers who have deactivated their accounts.The compartmentP: this compartment represents the page specialized in the diffusion of the rumor. This page consists of malicious publications about the rumor; in this page, Sp has the proper right to publish and share these publications at a rate δ1Sp and ε2Sp, respectively, and the ignorant who consults the page also shares these publications at a rate ε1I.The diagram will demonstrate the flux directions of individuals among the compartments, Figure1.(1)In+1=In+μN−αhSpnIn−αeInPnκ+Pn−μ1In,Spn+1=Spn+θαhSpnIn+αeInPnκ+Pn−μ1+βSpn−γSpnSpn+Stn,Stn+1=Stn+1−θαhSpnIn+αeInPnκ+Pn+γSpnSpn+Stn+βSpn−μ1Stn,Pn+1=Pn+ε1N+ε2Spn−μ2Pn,with initial values I0, Sp0, St0, and P0 which are nonnegatives.Figure 1
Description diagram of the rumor dynamics.In order to demonstrate the effectiveness of the model we have proposed, we will present a numerical simulation with Figure2 so that we can see how well the model adapts to reality. Initial values are approximate data that we suggested after studying and researching some statistics about the users of social networks, and the values are attached in the table.Figure 2
Dynamics without control strategy.From Figure2, we note that there is no significant effect until the 30th day; 30 days after the launch of the rumor, the number of ignorants decreases sharply, and in contrast, there is a significant rise of spreader people and the number of stiflers and pages are rising on average; these changes indicate that, after 30 days, trading rumor has become more and more due to the continuous publication of it.


## 3. The Model with Controls

Now, we introduce our controls into system (1) as the control measures to fight the spread of the rumor; we extend our system by including three kinds of controls u, v, and w. The first control u is to tell users that the information or publication is false and contains a malicious rumor, the second control v is through the admin where he deactivates an account after learning that it is fake or aimed at spreading the rumor, and the last one w is also applied by the admin, this time by deactivating the page intended to spread the rumor after the arrival of a certain number of complaints.In the aim of better understanding the effects of any control measure of these strategies, we introduce three new variables:πi, where i=1,2,3, πi=0 in the absence of the control, and πi=1 in the presence of the control.(2)In+1=In+μN−αhSpnIn−αeInPnκ+Pn−μ1In−π1unIn,Spn+1=Spn+θαhSpnIn+αeInPnκ+Pn−μ1+βSpn−γSpnSpn+Stn−π2vnSpn,Stn+1=Stn+1−θαhSpnIn+αeInPnκ+Pn+γSpnSpn+Stn+βSpn−μ1Stn+π1unIn,Pn+1=Pn+ε1N+ε2Spn−μ2Pn−π3wnPn.


## 4. An Optimal Control Approach

The problem is to minimize the objective functional:(3)Ju,v,w=MNSpN+∑k=0N−1MkSpk+12Akπ1uk2+12Bkπ2vk2+12Ckπ3wk2,where Ak>0, Bk>0, Ck>0, and Mk>0 for i∈0,…,N are the cost coefficients. They are selected to weigh the relative importance of Spk, uk, vk, and wk at time k. Nis the final time.In other words, we seek the optimal controlsuk, vk, and wk such that(4)Ju∗,v∗,w∗=minu,v,wJu,v,wu,v,w∈Uad,where Uad is the set of admissible controls defined by(5)Uad=uk,vk,wka≤uk≤b,c≤vk≤d,e≤wk≤f,k=0,…,N−1,and a,b,c,d,e,f∈]0,1[6.The sufficient condition for the existence of an optimal controluk∗,vk∗,wk∗ for problem (3) comes from the following theorem.Theorem 1.
There exists an optimal controlu∗,v∗,w∗ such that(6)Ju∗,v∗,w∗=minu,v,wJu,v,wu,v,w∈Uad,subject to control system (2) with initial conditions.Proof.
There are a finite number of time steps,S=S0;S1;…;Sn, I=I0;I1;…;IN, and P=P0;P1;…;PN which are uniformly bounded for all u,v,w∈Uad. Thus, Ju,v,w is uniformly bounded for all u,v,w in the control set Uad. Since Ju,v,w is bounded,infu,v,w∈UadJu,v,w is finite, and there exists a sequence ukj;vkj;wkj∈Uad such that limj⟶+∞Jukj;vkj;wkj=infu,v,w∈UadJu,v,w and the corresponding sequences of states Ii, Sti, Spi, and Bi . Since there is a finite number of uniformly bounded sequences, there exist uk∗;vk∗;wk∗∈Uad3 and S,I,P,R∈ℝN+1 such that, on a subsequence, ukj⟶uk∗, vkj⟶vk∗, wkj⟶wk∗, Sj⟶S∗, Ij⟶I∗, and Pj⟶P∗. Finally, due to the finite dimensional structure of system (2) and the objective function Ju,v,w, u∗,v∗,w∗ is an optimal control with corresponding states I∗,St∗,Sp∗P∗. Therefore, infu,v,w∈UadJu,v,w is achieved.
In order to derive the necessary condition for the optimal control, Pontryagin’s maximum principle in discrete time given in [31, 32] was used. This principle converts into a problem of minimizing a Hamiltonian at the time step defined by(7)Hk=MkSpk+12Akπ1uk2+12Bkπ2vk2+12Ckπ3wk2+∑j=14λj,k+1fj,k+1,where fj,k+1 is the right side of the system of difference equation (2) of the jth state variable at time step k+1.
Using Pontryagin’s maximum principle in discrete time [31–33], we can say the following theorem.Theorem 2.
LetI∗,Sp∗, St∗, and P∗ be optimal state solutions with an associated optimal control u∗,v∗,w∗ for optimal control problem (3). Then, there exist adjoint variables λ1,k,λ2,k,λ3,k,λ4,k satisfying(8)Δλ1,k=λ1,k+11−αhSpk−αePkκ+Pk−μ1−π1uk+λ2,k+1θαhSpk+αePkκ+Pk+λ3,k+11−θαhSpk+αePkκ+Pk,Δλ2,k=1+λ1,k+1−αhIk+λ2,k+11+θαhIk−μ+β−2γ−π2vkk+λ3,k+11−θαhSpk+2γ+β+λ4,k+1ε2,Δλ3,k=λ2,k+1−γSpkSpk+λ3,k+11+γSpk−μ,Δλ4,k=λ1,k+1−αeIkκκ+Pk2+λ2,k+1θαeIkκκ+Pk2+λ3,k+11−θαeIkκκ+Pk2+λ4,k+11−μ2−π3wk,with transversality conditions at time(9)λ1,N=AN,λ2,N=λ3,N=λ4,N=0.Furthermore, fork=0,1,…,N−1 and for π1=π2=π3=1, the optimal controls uk∗, vk∗, and wk∗ are given by(10)uk∗=minb,maxa,λ1,k+1Ik−λ3,k+1γSpkIkAk,vk∗=mind,maxc,−λ2,k+1γSpk2StkBk,wk∗=minf,maxe,λ4,k+1PkCk.Proof.
The Hamiltonian of the optimal problem is given by(11)Hk=MkSpk+12Akuk2+12Bkvk2+12Ckwk2+λ1,k+1Ik+μN−αhSpkIk−αeIkPkκ+Pk−μ1Ik−π1ukI+λ2,k+1Spk+θαhSpkIk+αeIkPkκ+Pk−μ+βSpk−γSpkSpk+Stk−π2vkSpk+λ3,k+1Stk+1−θαhSpkIk+αeIkPkκ+Pk+γSpkSpk+Stk+βSpk−μStk+π1ukI+λ4,k+1Pk+ε1Nk+ε2Spk−μ2Pk−π3wkPk.
Fork=0,1,…,N−1, the adjoint equations and transversality conditions can be obtained by using Pontryagin’s maximum principle, in discrete time, given in [31–33] such that(12)Δλ1,k=∂Hk∂Ik=λ1,k+11−αhSpk−αePkκ+Pk−μ1−π1uk+λ2,k+1θαhSpk+αePkκ+Pk+λ3,k+11−θαhSpk+αePkκ+Pk,Δλ2,k=∂Hk∂Spk=Mk+λ1,k+1−αhIk+λ2,k+11+θαhIk−μ+β−2γ−π2vk+λ3,k+11−θαhSpk+2γ+β+λ4,k+1ε2,Δλ3,k=∂Hk∂Stk=λ2,k+1−γSpk+λ3,k+11+γSpk−μ,Δλ4,k=∂Hk∂Pk=λ1,k+1−αeIkκκ+Pk2+λ2,k+1θαeIkκκ+Pk2+λ3,k+11−θαeIkκκ+Pk2+λ4,k+11−μ2−π3wk.
PutΦN=ANIN:(13)λ1,N=∂ΦN∂I=AN,λ2,N=∂ΦN∂Sp=0,λ3,N=∂ΦN∂St=0,λ4,N=∂ΦN∂P=0.
Fork=0,1,…,N−1, the optimal controls uk∗,vk∗, and wk∗ can be solved from the following optimality condition:(14)∂H∂uk=Akuk−λ1,k+1π1Ik+λ3,k+1γπ1SpkIk=0⟺uk=λ1,k+1π1Ik−λ3,k+1γπ1SpkIkAk,∂H∂vk=Bkvk+λ2,k+1γSpk2π2k=0⟺vk=−λ2,k+1γSpk2π2StkBk,∂H∂wk=Ckwk−λ4,k+1π3Pk=0⟺wk=λ4,k+1π3PkCk.
So, forπ1=π2=π3=1, we have(15)uk=λ1,k+1Ik−λ3,k+1γSpkIkAk,vk=−λ2,k+1γSpk2StkBk,wk=λ4,k+1PkCk.
However, ifπi=0 for i=1,2,3, the control attached to this case will be eliminated and removed. By the bounds in Uad of the controls, it is easy to obtain uk∗, vk∗, and wk∗ in the form of (10).


### 4.1. Algorithm

In this section, we present the results obtained by solving numerically the optimality system. This system consists of the state system, adjoint system, initial and final time conditions, and the control characterization. So, the optimality system is given by the following:Step 1:I0=i0, Sp0=sp0, St0=st0, P0=p0, λ2,N=λ3,N=λ4,N=0, λ1,N=AN, and given uk;0∗, vk;0∗, and wk;0∗Step 2: fork=0;1;…;N−1 do:(16)Ik+1=μN−αhSpkIk−αeIkPkκ+Pk−μ1Ik,Spk+1=θαhSpkIk+αeIkPkκ+Pk−μ+βSpk−γSpkSpk+Stk,Spk+1=1−θαhSpkIk+αeIkPkκ+Pk+γSpkSpk+Stk+βSpk−μStk,Pk+1=ε1N+ε2Spk−μ2Pk,⋮⋮⋮⋮λ1,T−k=λ1,T−k+11−αhSpk−αePkκ+Pk−μ1+λ2,T−k+1θαhSpk+αePkκ+Pk+λ3,T−k+11−θαhSpk+αePkκ+Pk,λ2,T−k=1+λ1,T−k+1−αhIk+λ2,T−k+11+θαhIk−μ+β−2γ+λ3,T−k+11−θαhSpk+2γ+β+λ4,T−k+1ε2,λ3,T−k=λ2,T−k+1−γSpkSpk+λ3,T−k+11+γSpk−μ,λ4,T−k=λ1,T−k+1−αeIkκκ+Pk2+λ2,T−k+1θαeIkκκ+Pk2+λ3,T−k+11−θαeIkκκ+Pk2+λ4,T−k+11−μ2,uk+1=minb,maxa,1Akλ1,T−k+1Ik−λ3,T−k+1γSpkIk,vk+1=mind,maxc,1Bk−λ2,T−k+1γSpk2Stk,wk+1=minf,maxe,1Ck−λ4,T−k+1Pk,end forStep 3: fork=0;1;…;N; write:(17)Ik∗=Ik,Spk∗=Spk,Stk∗=Stk,Pk∗=Pk,uk∗=uk,vk∗=vk,wk∗=wk,end for.In this formulation, there were initial conditions for the state variables and terminal conditions for the adjoints. That is, the optimality system is a two-point boundary value problem with separated boundary conditions at time stepsk=0 and k=N. We solve the optimality system by an iterative method with forward solving of the state system followed by backward solving of the adjoint system. We start with an initial guess for the controls at the first iteration, and then before the next iteration, we update the controls by using the characterization. We continue until convergence of successive iterates is achieved.


## 4.1. Algorithm

In this section, we present the results obtained by solving numerically the optimality system. This system consists of the state system, adjoint system, initial and final time conditions, and the control characterization. So, the optimality system is given by the following:Step 1:I0=i0, Sp0=sp0, St0=st0, P0=p0, λ2,N=λ3,N=λ4,N=0, λ1,N=AN, and given uk;0∗, vk;0∗, and wk;0∗Step 2: fork=0;1;…;N−1 do:(16)Ik+1=μN−αhSpkIk−αeIkPkκ+Pk−μ1Ik,Spk+1=θαhSpkIk+αeIkPkκ+Pk−μ+βSpk−γSpkSpk+Stk,Spk+1=1−θαhSpkIk+αeIkPkκ+Pk+γSpkSpk+Stk+βSpk−μStk,Pk+1=ε1N+ε2Spk−μ2Pk,⋮⋮⋮⋮λ1,T−k=λ1,T−k+11−αhSpk−αePkκ+Pk−μ1+λ2,T−k+1θαhSpk+αePkκ+Pk+λ3,T−k+11−θαhSpk+αePkκ+Pk,λ2,T−k=1+λ1,T−k+1−αhIk+λ2,T−k+11+θαhIk−μ+β−2γ+λ3,T−k+11−θαhSpk+2γ+β+λ4,T−k+1ε2,λ3,T−k=λ2,T−k+1−γSpkSpk+λ3,T−k+11+γSpk−μ,λ4,T−k=λ1,T−k+1−αeIkκκ+Pk2+λ2,T−k+1θαeIkκκ+Pk2+λ3,T−k+11−θαeIkκκ+Pk2+λ4,T−k+11−μ2,uk+1=minb,maxa,1Akλ1,T−k+1Ik−λ3,T−k+1γSpkIk,vk+1=mind,maxc,1Bk−λ2,T−k+1γSpk2Stk,wk+1=minf,maxe,1Ck−λ4,T−k+1Pk,end forStep 3: fork=0;1;…;N; write:(17)Ik∗=Ik,Spk∗=Spk,Stk∗=Stk,Pk∗=Pk,uk∗=uk,vk∗=vk,wk∗=wk,end for.In this formulation, there were initial conditions for the state variables and terminal conditions for the adjoints. That is, the optimality system is a two-point boundary value problem with separated boundary conditions at time stepsk=0 and k=N. We solve the optimality system by an iterative method with forward solving of the state system followed by backward solving of the adjoint system. We start with an initial guess for the controls at the first iteration, and then before the next iteration, we update the controls by using the characterization. We continue until convergence of successive iterates is achieved.


## 5. Numerical Simulation

In this paragraph, we give numerical simulation to highlight the effectiveness of the strategy that we have developed in the framework of eliminating the rumor and limit its spread, and the initial values are the same as in Table1; with regard to other initial values, they are proposed values after a statistical study.Table 1
Rumor model parameters and values.
Parameter
Description
Value
α
h
The proportion of ignorants who become the spreader after discussing with a spreader
(0.0005/day)
α
e
The proportion of ignorants who become the spreader after consulting a page of rumor
(0.0007/day)
θ
The proportion of the ignorant who become the spreader
(0.65/day)
1
−
θ
The proportion of the ignorant who become the stifler
(0.35/day)
μ
New users and deactivated users
0.0008/day
β
The proportion of spreaders who become stiflers
(0.002/day)
γ
The proportion of spreaders who become stiflers after contacting another spreader
(0.00005/day)
ε
1
The rate of shared publications of a rumor page by ignorants
(0.000005/day)
ε
2
The rate of shared publications of a rumor page by spreaders
0.00001/day
δ
1
New rumor pages created by spreaders
0.04/dayIn this section, we introduce our control strategy which consists in using three kinds of controls: the first oneun where an ignorant is informed by a stifler that the information is false or a rumor, the second noted vn which is applied by a professional admin and which consists of deactivating or blocking a fake account that specializes in spreading the rumor, and the third noted wn which is also applied by an admin by blocking the pages created in order to spread the rumor and this after reaching a significant number of signals and after the diagnosis of the content of the concerned page. We apply our strategy for a period of fifteen weeks that we assume an average duration of the spread of a rumor. Figure 3 illustrates the results found. From Figure 3, we see that the effect of the strategy begins as early as the second week, and the number of the ignorant decreases from 2000 in a fatal way until reaching almost 100; this number is recovered in the number of stiflers which increases significantly from zero until reaching 2000. The same remark for the number of pages, we notice that between the first and the second week, the number increases step by step; however, after the second week of the application of controls, the number decreases until less than 50. As for the number of spreaders, the number is decreasing from 50 to zero.Figure 3
Dynamics with controlsu, v, and w.In the next section and in order to give more details about our strategy as well as the effect of each control, we choose to apply three scenarios; in each of these scenarios, we apply separately one control, Figures4–6 illustrate the result found in each scenario for the three cases:(a)
Apply only the controlu(b)
Apply only the controlv(c)
Apply only the controlwFigure 4
Dynamics with controlu.Figure 5
Dynamics with controlv.Figure 6
Dynamics with controlw.


### 5.1. Apply Only the Controlu

In this scenario, we simulate the case where we apply a single controlu with which we inform a portion of the ignorants by the false information, so we win this proportion in favor of stiflers, and the control is applied over a period of 100 days. From the figure, we see that, after 10 days, the number of spreaders falls and does not exceed 3,000 people throughout the period, and the number of stiflers meanwhile increases sharply to almost 20,000 which shows the effectiveness of our control.


### 5.2. Apply Only the Controlv

In the second scenario, we apply a single controlv but this time, a control that focuses on the spreaders by disabling their accounts, and the period is always 100 days; the figure shows us that the number of spreaders decreases since the 3rd day, but this time, we see that the number Sp tends to zero; however, there is a small improvement in the number of stiflers, and we notice that the number grows slowly and reaches 10,000 people.


### 5.3. Apply Only the Controlw

In the last scenario, we apply the only remaining controlw by disabling the pages reserved for the diffusion of the rumor. From the figure, we see that the numbers of stiflers and spreaders have undergone the same changes as in the previous scenarios, and the number of pages has fallen dramatically, which shows the effectiveness of this strategy because it gives similar results to the previous ones and more, which is logical since this strategy aims and attacks the source of the rumor and the necessary tool for spreaders in order to spread the rumor.


## 5.1. Apply Only the Controlu

In this scenario, we simulate the case where we apply a single controlu with which we inform a portion of the ignorants by the false information, so we win this proportion in favor of stiflers, and the control is applied over a period of 100 days. From the figure, we see that, after 10 days, the number of spreaders falls and does not exceed 3,000 people throughout the period, and the number of stiflers meanwhile increases sharply to almost 20,000 which shows the effectiveness of our control.


## 5.2. Apply Only the Controlv

In the second scenario, we apply a single controlv but this time, a control that focuses on the spreaders by disabling their accounts, and the period is always 100 days; the figure shows us that the number of spreaders decreases since the 3rd day, but this time, we see that the number Sp tends to zero; however, there is a small improvement in the number of stiflers, and we notice that the number grows slowly and reaches 10,000 people.


## 5.3. Apply Only the Controlw

In the last scenario, we apply the only remaining controlw by disabling the pages reserved for the diffusion of the rumor. From the figure, we see that the numbers of stiflers and spreaders have undergone the same changes as in the previous scenarios, and the number of pages has fallen dramatically, which shows the effectiveness of this strategy because it gives similar results to the previous ones and more, which is logical since this strategy aims and attacks the source of the rumor and the necessary tool for spreaders in order to spread the rumor.


## 6. Conclusion

In this work, we propose a new model which describes the dynamics of rumor spread through social media based on the cholera model; this allows us to introduce a new compartment representing pages or tweets or any other kind of publication that disseminates the rumor. Moreover, we apply a control strategy in order to fight against the spread of the rumor; since there is an overlap between both phenomena, the strategy is also based on the cholera model and which proved its effectiveness against this disease. Three control strategies were introduced, and by the introduction of three new variablesπii=1,2,3, we could study and combine several scenarios in order to see the impact and the effect of each one of these controls on the reduction of the rumor spread. The numerical resolution of the system with difference equations as well as the numerical simulations enabled us to compare and see the difference between each scenario in a concrete way. Numerical results prove the effectiveness of our strategy. The purpose of this work is achieved, and we have proved the effectiveness of our strategy and its importance in fighting the spread of any rumor throughout any social network.



---

*Source: 4386476-2020-05-01.xml*