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

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Rachid Ghazzali ◽  
Amine El Bhih ◽  
Adil El Alami Laaroussi ◽  
Mostafa Rachik

We propose to model the phenomenon of the spread of a rumor in social networks in this paper. From an existing SIR 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.

2020 ◽  
Vol 2020 ◽  
pp. 1-12 ◽  
Author(s):  
Amine El Bhih ◽  
Rachid Ghazzali ◽  
Soukaina Ben Rhila ◽  
Mostafa Rachik ◽  
Adil El Alami Laaroussi

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.


2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Da-Wen Huang ◽  
Lu-Xing Yang ◽  
Xiaofan Yang ◽  
Yuan Yan Tang ◽  
Jichao Bi

Rumors have been widely spread in online social networks and they become a major concern in modern society. This paper is devoted to the design of a cost-effective rumor-containing scheme in online social networks through an optimal control approach. First, a new individual-based rumor spreading model is proposed, and the model considers the influence of the external environment on rumor spreading for the first time. Second, the cost-effectiveness is recommended to balance the loss caused by rumors against the cost of a rumor-containing scheme. On this basis, we reduce the original problem to an optimal control model. Next, we prove that this model is solvable, and we present the optimality system for the model. Finally, we show that the resulting rumor-containing scheme is cost-effective through extensive computer experiments.


2015 ◽  
Vol 25 (02) ◽  
pp. 1550031 ◽  
Author(s):  
Edgar N. Sanchez ◽  
David I. Rodriguez

In this paper, a control strategy based on the inverse optimal control approach is applied for pinning weighted complex networks with chaotic systems at their nodes; additionally, a cost functional is minimized. This control strategy does not require to have the same coupling strength for all node connections.


2019 ◽  
Vol 2019 ◽  
pp. 1-8 ◽  
Author(s):  
Abdelfatah Kouidere ◽  
Omar Balatif ◽  
Hanane Ferjouchia ◽  
Abdesslam Boutayeb ◽  
Mostafa Rachik

Nowadays, Diabetes is one of the most common diseases, which has a huge and growing socio-economic burden affecting individuals, families, and the whole society. In this paper, we propose an optimal control approach modeling the evolution from pre-diabetes to diabetes with and without complications and the effect of living environment. We show the existence of an optimal control and then use a numerical implicit finite-difference method to monitor the size of population in each compartment.


Sign in / Sign up

Export Citation Format

Share Document