Discrete Dynamics in Nature and Society

Discrete Dynamics in Nature and Society / 2020 / Article
Special Issue

Dynamical Modeling, Analysis, and Control of Information Diffusion over Social Networks

View this Special Issue

Research Article | Open Access

Volume 2020 |Article ID 6724815 | https://doi.org/10.1155/2020/6724815

Rachid Ghazzali, Amine El Bhih, Adil El Alami Laaroussi, Mostafa Rachik, "Modeling a Rumor Propagation in Online Social Network: An Optimal Control Approach", Discrete Dynamics in Nature and Society, vol. 2020, Article ID 6724815, 12 pages, 2020. https://doi.org/10.1155/2020/6724815

Modeling a Rumor Propagation in Online Social Network: An Optimal Control Approach

Guest Editor: Jianxin Li
Received29 May 2020
Accepted14 Jul 2020
Published11 Aug 2020

Abstract

We propose to model the phenomenon of the spread of a rumor in social networks in this paper. From an existing model, we manipulate a new one that is based on the model of cholera in order to take into account professional pages that specialize in spreading rumors. In the second part, we introduce a control strategy to fight against the diffusion of the rumor. Our main objective is to characterize the three optimal controls that minimize the number of spreader users, fake pages, and the corresponding costs. For that matter, using the maximum principle of Pontryagin, we prove the existence and we give characterization of our controls. Numerical simulations are given to concretize our approach.

1. Introduction

The phenomenon of rumor is a complex phenomenon that has eluded man since ancient times, where it intersects many factors and interventions, including what is natural, sociological, economic, and psychological. Communities have known over the years the emergence of many rumors that have spread widely among them; it was also the focus of interaction and analysis by the commanders of these societies throughout history [1]; human beings have fabricated rumors and disseminated them for political, economic, and social purposes [2], where they are exploited to achieve commercial profits or to achieve victories in wars by dissolving fear and surrender within the enemy or with holding confidence in their leaders. The phenomenon of rumor has known many changes in its composition, in line with the change that societies know and the development of daily life in general with the increasing use of technological instruments and modern technologies in communication within communities. This phenomenon has witnessed a dramatic rise and an increase in the speed of its spread. This increase contributes significantly to huge consequences on the other hand. The development of the phenomenon of rumors and the strength of their influence and impact within societies gave this phenomenon another dimension [3], as it became used by the media and intelligence in competition between countries and what is known as propaganda and polemic or buzz by publishing some false news in whole or in part to influence the opinions of voters by raising or decreasing the popularity of politicians [4] as happened in the elections between Trump and Hillary where Hillary was the most popular and was the favorite to win until the last weeks before the presidential election [5], where some of the specialized communication agencies published many news about Hillary contributed significantly to influence public opinion tendency to Trump, who eventually won. Jennifer et al. in their article [6] did a study in order to understand the dynamics of this exceptional campaign in which social media played a major role. The website [7] gives a variety of Trump’s Tweets grouped by topic (people, places, and things Trump has insulted on Twitter). In 2018, Russian authorities have considered starting to block sites like Telegram [8] because of the danger on national security. And if some rumors arouse ridicule, such as saying that Nicolas Cage was Dracula, others were of great danger; to see more in this regard, we guide the reader to the beautiful book [9].

Mathematical modeling is one of the most important applications of mathematics that contribute to the representation and simulation of social, economic, biological, and ecological phenomena and convert them into mathematical equations that are formulated, studied, analyzed, and interpreted [10]. In this context, many researchers have developed different mathematical models representing the dynamics of the rumor [11] and the elements interfering with its spread [1215], and especially [16] in the work [17], authors gave a review and a study of several mathematical models of rumor’s propagation.

1.1. Related Work

In 1964, Goffman and Newill developed in their article titled “Generalization of Epidemic Theory: An Application to the Transmission of Ideas” [18] a new concept for modeling the transmission of ideas within a society based on the mathematical model SIR due to the great similarity between the two phenomena. This model was previously used to model the transmission of diseases and epidemics within communities; in the introduction of their work, the authors stated that “the process already described does not take into account the almost endless number of complexities which actually arise” [18]. Based on the previous work, Daley and Kendall in their letter titled “Epidemics and Rumors” suggested applying the previous idea to modeling the spread of rumors within communities [19]. With the development of societies and the emergence of modern technological means (transport communication), new factors have emerged that further complicate the phenomenon of rumor and contribute to the large spread of rumors; this has led many researchers to think about developing the previous model. As an example, in the work done by Luıs M.A. Bettencourt et al. [20], they 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 and to give time factor more importance in the process of spread of the phenomenon, Laarabi et al. [21] had developed another model using a delayed rumor propagation model. This is in addition to many recent works that have recently been produced that take into account several factors involved in the development of a concept that truly simulates the dynamics of rumor propagation; to take a broader view, the reader is referred to the article [22]. With the emergence of social networks and their impacts on communication within communities where they are taking more and more space within the community, it became clear that they must be taken into account as major intervening in the spread of rumors; in this context many of the works that adopted this hypothesis have been produced. To take an idea of some of these works, see the article [23]. For example, in the work [24], authors had implemented a mathematical model in order to model the dynamics of a rumor in social network by adding three new compartments: reviewers, sharers, and collectors who are reviewing the message, collecting the message, sharing the message, or giving no response to the message, respectively, but in the work [25], the authors were limited to highlight the role of users of the network and ignore the impact of the network itself, especially the role of pages that spread the rumor within the network. The loading of false information in these pages is a source of rumor between browsers and considered as a big factor which helps in the rapid spread of rumors, such as rivers and valleys, which store bacteria and microbes and are a hotbed for the multiplication and growing bacteria that transmit diseases to humans through the use of the water of those rivers. A good example of this similarity is the cholera epidemic. In this paper and based on the previous hypothesis, we will exploit the mathematical model that has been formulated to represent the cholera epidemics [26] and combine it with the previous work model by adding a new compartment which represents page’s rumor. Other models from population dynamics and optimal controls can be found in [3, 27].

Recently, a significant amount of prior works exists in the study of rumor detection in social networks. For example, in [28], the authors propose a GCN-based model for rumor detection on social media, called Bi-GCN, and they discuss several variants of Bi-GCN to model the propagation patterns. Ma et al. in [29] discuss the same topic involving a novel approach to capture the temporal characteristics based on the time series of rumor’s life cycle, for which time series modeling technique is applied to incorporate various social context information, while Han Guo et al. [30] propose a novel hierarchical neural network combined with social information (HSA-BLSTM) for rumor detection and they test their model on two real-world datasets from Weibo and Twitter demonstrating outstanding performance in both rumor detection and early detection scenarios. Li et al. [31] give another approach, the personalized influential topic search by proposing two random-walk based approaches in order to measure the influence of a topic on a query user. Moreover, Li et al. in [32] studied the problem from another side, influence maximization; the aim is to find a limited number of users which can influence the maximum number of users in social networks. Li et al. in [33] continue to improve their work by taking into account the physical locations of the users since location is an important factor in this process. The same approach was discussed by Cai et al. in [34], where they formulate a new problem of holistic influence maximization, denoted as HIM query, for targeted advertisements in a spatial social network.

1.2. Problem Definition

In [35], where the authors subdivide the population into three compartments representing the main actors in the dynamics of the propagation of a rumor, these compartments are ignorant individuals, the spreaders, and the stiflers. As we mentioned before, many agencies specialized in propaganda dissemination have become using social media to facilitate the spread of rumor and large volume of users. For this purpose, special pages are created to spread a rumor about a specific subject or target person. This page is promoted by fictitious users that are created for this purpose. They create a private network of friends; their friends are the first victims; every time they like or comment on what is posted by the page or fictitious people, this activity is displayed to all their friends or perhaps friends of their friends inadvertently which is promoted by this rumor passively by them, while studies indicate that the number of users of the networks is rising at a tremendous rate and it has become one of the basics in the field of communication and publicity, according to statistics [4]. It treated millions of rumors spread daily in social networks, starting from this model, and by adding an additional compartment, named as Fakes, we will build our own model which describes the propagation of a rumor through a social network. Our idea is to combine the classical model with another mathematical model that describes the dynamics of cholera in order to highlight the importance of fake page which are specified in spreading fake news; in other words, since there is a similarity between these two phenomena, we can consider a fake page as a contaminated river which contains bacteria; these bacteria are false information in our case. We can use this model in order to describe the dynamics of the rumor between the different individuals as well as bringing out the contribution of fake pages in this process [36]. In this paper and based on the previous hypothesis, we will exploit the mathematical model that has been formulated to represent the cholera epidemics [36] and combine it with the previous work model by adding a new compartment F which represents page’s rumor.

In this paper, in Section 2, we propose a continuous mathematical model that describes the dynamics of a population that reacts in the spread of the rumor in a social network positivity, and the boundness of the model is discussed. In 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 3.2. Finally, we conclude the paper in Section 4.

1.2.1.

In this section, we will describe our model which consists of four compartments representing the subdivision of the population that reacts in the spread of the rumor in a social network. , ignorant, represents users who do not know the rumor and are susceptible to be informed, , spreader, represents users who spread the rumor, , stifler, represents individuals who refuse to spread the rumor, and , rumor’s page, represents the page specialized in spreading the rumor. The compartment represents the number of users who do not know the rumor and who are susceptible to be informed; this population increases with the rate which represents the new users created; an ignorant inquires about the rumor through two ways: either by consulting a specialized page in the diffusion of the rumor or directly by the contact with a spreader. Some of these users deactivate their account at a rate . Thus, in this compartment, we have an incoming flux equal to and an outgoing flux equal to .

The compartment represents the number of people who spread the rumor either directly or by sharing one-page publications or by creating new publications. Thus, we have an incoming flux equal to 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 , and after the contact of a spreader and a stifler, the stifler succeeds to convince him that the information is false at a rate ; after a certain period, a portion of the spreaders decide not to spread the rumor at a rate .

The compartment represents the number of stiflers who refuse to spread the rumor. This number increases at a rate which represents the portion of users who knew that the information is wrong, in addition to the flux that left the compartment and decreases with the rate of stiflers who have deactivated their accounts.

The compartment represents the page specialized in the diffusion of the rumor. This page contains malicious publications about the rumor; in this page, have the right to publish and share these publications at rates and , respectively, and the ignorants who consult the page also share these publications at a rate .

The following diagram will demonstrate the flux directions of individuals among the compartments (Figure 1).

The dynamics of this model are governed by the following nonlinear system:

With initial values, , , , and are nonnegatives : logistic capacity (concentration of rumors).

In order to demonstrate the effectiveness of the model we have proposed, we will present a numerical simulation with the following figure 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; the values are attached in the table.

From Figure 2, 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; in contrast, there is a significant rise of spreaders and the numbers of stiflers and pages is rising on average. These changes indicate that after 30 days trading rumor has become more and more due to the continuous publication of it.

1.2.2. Model Basic Properties

Theorem 1. If , , , and , the solutions , , , and of system (1) are positive for all .

Proof. where . Both sides in the last inequality are multiplied by .
We obtainThenIntegrating this inequality from 0 to givesThenSimilarly, we prove that , , , and .

1.2.3. Boundedness of the Solutions

Theorem 2. The setis positively invariant under system (1) with initial conditions , , , and being positively invariant for system (1).

2. The Model with Controls

Now, we introduce our controls into system (1). As control measures to fight the spread of rumor, we extend our system by including three kinds of controls , , and . The first control is to tell users that the information or publication is false and contains a malicious rumor. The second control is through the admin where he deactivates an account after learning that it is fake or aimed at spreading the rumor. The last one 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.

With the aim of better understanding the effects of any control measure of these strategies, we introduce three new variables: , where , in the absence of control, and in the presence of control. One has

3. Optimal Control Problem

We define the objective functional as follows:where , , and are the cost coefficients:where is the set of admissible controls defined byand .

Theorem 3. Consider the control problem with system (8).

There exists an optimal control such that

If the following conditions are met:(1)The set set of controls and the corresponding state variables is nonempty.(2)The control set is convex and closed.(3)The right-hand side of the state system is bounded by a linear function in the state and control variables.(4)The integrand of the objective functional is convex on and there exist constants and such that

Proof. The existence of the optimal control can be obtained using a result by Fleming and Rishel [37], checking the following step:Condition 1: To prove that the set of controls and the corresponding state variables is nonempty, we will use a simplified version of an existence result ([38], Theorem 7). Let , , , and , where , and form the right-hand side of the system of 8. Let , , and , for some constants, and since all parameters are constants and , and are continuous, then , , , and are also continuous. Additionally, the partial derivatives , , , , , , , , , , , , , and are all continuous. Therefore, there exists a unique solution () that satisfies the initial conditions. Therefore, the set of controls and the corresponding state variables is nonempty and condition 1 is satisfied.Condition 2: By definition, is closed. Take any control and . Then .Additionally, we observe that ; then .Hence,Therefore, is convex and condition 2 is satisfied.Condition 3: All the right-hand sides of equations of system are continuous, bounded above by a sum of bounded control and state, and can be written as a linear function of , and with coefficients depending on the time and state. Therefore, condition 3 is satisfied.Condition 4: The integrand in the objective functional (9) is convex on . It rests to show that there exist constants and such that the integrand of the objective functional satisfiesThe state variables are bounded; let , , and ; then it follows thatThen, from Fleming and Rishel [37], we conclude that there exists an optimal control.

3.1. Characterization of the Optimal Controls

In this section, we apply Pontryagin’s maximum principle [26]. The key idea is introducing the adjoint function to attach the system of differential equations to the objective functional resulting in the formation of a function called the Hamiltonian. This principle converts the problem of finding the control to optimize the objective functional subject to the state of differential equations with initial condition to find the control to optimize Hamiltonian pointwise (with respect to the control).

Now, we have the Hamiltonian of the optimal problem given by

Using Pontryagin’s maximum [26, 39], we can say the following theorem.

Theorem 4. Let , , and be optimal state solutions with an associated optimal control for the optimal control problem. Then there exist adjoint variables , and satisfyingwith transversality conditions at time . One hasFurthermore, and for , the optimal controls , , and are given by

Proof. For , the adjoint equations and transversality conditions can be obtained by using Pontryagin’s maximum principle [26, 39] such thatFor , the optimal controls , , and can be solved from the optimality condition:For the bounds in of the controls, it is easy to obtain , , and given byHowever, if where , the controls attached to this case will be eliminated and removed.

3.2. Numerical Simulation
3.2.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. , , , , , , and given , , step 2. for do:end forstep 3. for ; write: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 steps and . 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.

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; the initial values are the same as in Table 1; with regard to other initial values, they proposed values after a statistical study.


ParameterDescriptionValue

The proportion of ignorants who become spreaders after discussing with a spreader(0.05/day)
The proportion of ignorants who become spreaders after consulting a page of rumor(0.07/day)
The proportion of ignorants who become spreaders(0.85/day)
The proportion of ignorants who become stiflers(0.15/day)
New users and deactivated users0.08
The proportion of spreaders who become stiflers(0.2/day)
The proportion of spreaders who become stiflers after contacting another spreader(0.005/day)
The rate of shared publications of rumor page by ignorants(0.05/day)
The rate of shared publications of rumor page by spreaders0.1/day
New rumor pages created by spreaders0.4/day

From Figure 3, we note that, after 30 days of the implementation of the preventive strategy, effect begins to appear where we can see again that the sharp decline in the number can be observed, but this time accompanied by a high number and a gradual decline for both and . This confirms that the proposed strategy in theory is paying off.

In this paragraph and with the aim of obtaining more accurate information about the impact of each control separately, we will develop a preventive strategy by applying each of them individually; numerical analysis will show us the effectiveness of each prevention strategy.

3.2.2. Case 1: Applying Only Control

Since it will be applied to ignorant individuals, we will be limited to displaying and comparing the curves of and in both cases with and without control strategy. We observe from Figure 4 that, 30 days after the implementation of the strategy, the impact will start to appear as we note that the number will gradually decrease until it stabilizes at 45. On the other hand, the number of will suddenly start to rise from about the first day. This change is probably due to the fact that the control is aimed at telling the ignorant people to turn to stifler ones. In this way, we win a number of people in the fight against the spread of false news.

3.2.3. Case 2: Applying Only Control

Here, we will implement only control , noting through Figure 5 that the effect of the strategy will appear after 20 days on the number of as the number will gradually decrease. This rapid change is attributed to the fact that control directly targets this group. The number of and change begins to appear after 40 to 50 days as the number of ignorant individuals is relatively high after the implementation of the strategy in parallel with the fact that there is a relatively high number of people which is considered logical and simulates reality since the high number of is the one that caused the number of to be raised due to their transfer of the correct information to them.

3.2.4. Case 3: Applying Only Control

In the last case, we apply only control . Note through Figure 6 that the effect begins immediately (after about 5 days); for the number of ignorants, we note that there is a gradual decline which is less than the number of ignorant in the absence of control; this is mainly due to low sources of rumors; the same observation is for spreader’s number; it rises relatively weaker and is stabilizing at 60 thousand ones; the same thing gets with the number of stiflers where we observe that it rises up to the limits of 25 thousands; the number of pages further rises until the value reaches 15. These observations clearly illustrate the importance of this strategy in the fight against the spread of rumors, where we see the speed of its impact and also to reach the stage of stability after its application since it targets the sources of rumors directly.

4. Conclusion

In this paper, we give a new simple mathematical model which describes the dynamics of rumor propagation through social network. The model is based on two compartmental models by combining them in order to take into account more factors that are involved in the dynamic. Three control strategies were introduced, and referring to the introduction of three new variables , 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 goal is achieved and 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. The purpose of the 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.

Data Availability

The disciplinary data used to support the findings of this study have been deposited in the Network Repository (http://www.networkrepository.com).

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

The research reported in this paper was supported by the Moroccan Systems Theory Network.

References

  1. G. W. Allport and L. Postman, The Psychology of Rumor, Holt Rinehart & Winston, New York, NY, USA, 1947.
  2. P. Bordia and N. Difonzo, “Psychological motivations in rumor spread,” Analysis of Commercial Rumors from the Perspective of Marketing Managers: Rumor Prevalence, Effects, and Control Tactics, 2005. View at: Google Scholar
  3. R. Ghazzali, A. E. A. Laaroussi, A. EL Bhih, and M. Rachik, “On the control of a reaction-diffusion system: a class of SIR distributed parameter systems,” International Journal of Dynamics and Control, vol. 7, no. 3, pp. 1021–1034, 2019. View at: Publisher Site | Google Scholar
  4. https://zephoria.com/top-15-valuable-facebook-statistics/.
  5. L. J. Sabato, K. Kondik, and G. Skelley, Republicans 2016: What to Do with the Donald? 2015, http://centerforpolitics.org/crystalball/articles/republicans-2016-what-to-do-withthe-donald/.
  6. J. Fromm, S. Melzer, B. Ross, and S. Stieglitz, Trump versus Clinton-Twitter Communication during the US Primaries, Palgrave Macmillan, London, UK, 2016.
  7. C. Lee and K. Quealy, The 337 People, Places and Things Donald Trump Has Insulted on Twitter: A Complete List, 2016, https://www.nytimes.com/interactive/2016/01/28/upshot/donald-trump-twitter-insults.html.
  8. https://www.reuters.com/article/us-russia-telegram-blocking/russia-starts-blocking-telegram-messenger-idUSKBN1HN13J.
  9. R. E. Bartholomew and P. Hassall, A Colorful History of Popular Delusions, Prometheus Books, Buffalo, NY, USA, 2015.
  10. D. P. Maki and M. Thompson, Mathematical Models and Applications, Prentice-Hall, Englewood cliffs, NJ, USA, 1974.
  11. A. Rapoport and L. I. Rebhun, “On the mathematical theory of rumor spread,” The Bulletin of Mathematical Biophysics, vol. 14, no. 4, pp. 375–383, 1952. View at: Publisher Site | Google Scholar
  12. M. H. Zheng, L. Y. Lv, and M. Zhao, “Spreading in online social networks: the role of social reinforcement,” Physical Review E, vol. 88, no. 1, Article ID 012818, 2013. View at: Publisher Site | Google Scholar
  13. L. Fan, W. Wu, X. Zhai, K. Xing, W. Lee, and D.-Z. Du, “Maximizing rumor containment in social networks with constrained time,” Social Network Analysis and Mining, vol. 4, no. 1, 2014. View at: Publisher Site | Google Scholar
  14. A. Jain, V. Borkar, and D. Garg, “Fast rumor source identification via random walks,” Social Network Analysis and Mining, vol. 6, no. 1, p. 62, 2016. View at: Publisher Site | Google Scholar
  15. S. Santhoshkumar and L. D. Dhinesh Babu, “Earlier detection of rumors in online social networks using certainty-factor-based convolutional neural networks,” Social Network Analysis and Mining, vol. 10, no. 1, p. 20, 2020. View at: Publisher Site | Google Scholar
  16. D. J. Daley and D. G. Kendall, “Epidemics and Rumours,” Nature, vol. 204, p. 1118, 1964. View at: Google Scholar
  17. M. Z. Ndii, E. Carnia, and A. K. Supriatna, “Mathematical models for the spread of rumors: a review,” in Proceedings of the 6th International Congress on Interdisciplinary Behavior and Social Sciences (ICIBSoS 2017), Bali, Indonesia, July 2018. View at: Google Scholar
  18. W. O. Kermack and A. G. McKendrick, “A contribution to the mathematical theory of epidemics,” Proceedings of the Royal Society of London. Series A, vol. 115, pp. 700–721, 1927. View at: Google Scholar
  19. W. Goffman and V. A. Newill, “Generalization of epidemic theory: an application to the transmission of ideas,” Nature, vol. 204, no. 4955, pp. 225–228, 1964. View at: Publisher Site | Google Scholar
  20. D. J. Daley and D. G. Kendall, “Statistics epidemics and rumours,” Nature, vol. 204, p. 1964. View at: Google Scholar
  21. H. Laarabi, A. Abta, M. Rachik, and J. Bouyaghroumni, “Stability analysis of a delayed rumor propagation model,” Differential Equations and Dynamical Systems, vol. 24, no. 4, pp. 407–415, 2016. View at: Publisher Site | Google Scholar
  22. R. Zhang and D. Li, “Rumor propagation on networks with community structure,” Physica A: Statistical Mechanics and its Applications, vol. 483, pp. 375–385, 2017. View at: Publisher Site | Google Scholar
  23. J. Jia and W. Wu, “A rumor transmission model with incubation in social networks,” Physica A: Statistical Mechanics and its Applications, vol. 491, pp. 453–462, 2018. View at: Publisher Site | Google Scholar
  24. Y. Hu, Q. Pan, W. Hou, and M. He, “Rumor spreading model with the different attitudes towards rumors,” Physica A: Statistical Mechanics and its Applications, vol. 502, pp. 331–344, 2018. View at: Publisher Site | Google Scholar
  25. A. G. Hakim, H. C. Favre1, and D. A. Zighed, Information Diffusion in Online Social Networks: A Survey SIGMOD Record, vol. 42, no. 2, 2013.
  26. L. S. Pontryagin, V. G. Boltyanskii, R. V. Gamkrelidze, and E. Mishchenko, The Mathematical Theory of Optimal Processes (International Series of Monographs in Pure and Applied Mathematics), Interscience, New York, NY, USA, 1962.
  27. A. El Bhih, Y. Benfatah, S. Ben Rhila, M. Rachik, and A. El Alami Laaroussi, “A spatiotemporal prey-predator discrete model and optimal controls for environmental sustainability in the multifishing areas of Morocco,” Discrete Dynamics in Nature and Society, vol. 2020, pp. 1–18, 2020. View at: Publisher Site | Google Scholar
  28. B. Tian, X. Xiao, T. Xu et al., Rumor Detection on Social Media with Bi-directional Graph Convolutional Networks, 2020, http://arxiv.org/abs/2001.06362.
  29. J. Ma, W. Gao, Z. Wei, Y. Lu, and K.-F. Wong, “Detect rumors using time series of social context information on microblogging websites,” in Proceedings of the 24th ACM International on Conference on Information and Knowledge Management-CIKM’15, Melbourne, Australia, 2015. View at: Google Scholar
  30. G. Birkhoand and G. C. Rota, Ordinary Dierential Equations, John Wiley & Sons, New York, NY, USA, 4th edition, 1989.
  31. H. Guo, J. Cao, Y. Zhang, J. Guo, and J. Li, “Rumor detection with hierarchical social attention network,” in Proceedings of the 27th ACM International Conference on Information and Knowledge Management-CIKM’18, Torino, Italy, October 2018. View at: Publisher Site | Google Scholar
  32. J. Li, T. Cai, K. Deng, X. Wang, T. Sellis, and F. Xia, “Community-diversified influence maximization in social networks,” Information Systems, vol. 92, p. 101522, 2020. View at: Publisher Site | Google Scholar
  33. J. Li, T. Sellis, J. S. Culpepper, Z. He, C. Liu, and J. Wang, “Geo-social influence spanning maximization,” IEEE Transactions on Knowledge and Data Engineering, vol. 29, no. 8, pp. 1653–1666, 2017. View at: Publisher Site | Google Scholar
  34. T. Cai, J. Li, A. S. Mian, R. Li, T. Sellis, and J. X. Yu, “Target-aware holistic influence maximization in spatial social networks,” IEEE Transactions on Knowledge and Data Engineering, p. 1, 2020. View at: Publisher Site | Google Scholar
  35. L. Zhao, H. Cui, X. Qiu, X. Wang, and J. Wang, “SIR rumor spreading model in the new media age,” Physica A: Statistical Mechanics and its Applications, vol. 392, no. 4, pp. 995–1003, 2013. View at: Publisher Site | Google Scholar
  36. J. Wang and C. Modnak, “Modeling cholera dynamics with controls canadian applied mathematics quarterly,” , vol. 19, no. 3, 2011. View at: Google Scholar
  37. W. H. Fleming and R. W. Rishel, Deterministic and Stochastic Optimal Control, Springer, New York, NY, USA, 1975.
  38. W. E. Boyce and R. C. DiPrima, Elementary Differential Equations and Boundary Value Problems, John Wiley & Sons, New York, NY, USA, 2009.
  39. V. Guibout and A. M. Bloch, “A discrete maximum principle for solving optimal control problems,” in Proceedings of the 2004 43rd IEEE Conference on Decision and Control (CDC), vol. 2, pp. 1806–1811, Atlantis, Bahamas, December 2004. View at: Google Scholar

Copyright © 2020 Rachid Ghazzali et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

 PDF Download Citation Citation
 Download other formatsMore
 Order printed copiesOrder
Views607
Downloads295
Citations

Related articles

Article of the Year Award: Outstanding research contributions of 2020, as selected by our Chief Editors. Read the winning articles.