Mean-field control and deep learning for information dissemination problem in online social networks

The paper formulates and numerically investigates the tasks of stopping and stimulating the dissemination of information in online social networks for a mean-field model and a model based on artificial neural networks.The mean field model is reduced to a joint solution of initial boundary value problems for the Kolmogorov-Fokker-Planck (KFP) and Hamilton-Jacobi-Bellman (HJB) equations, as well as the Nash optimality condition.Numerical methods for solving systems of KFP and HJB in high dimensions are practically nonexistent due to the need for grid-based spatial discretization.Therefore, we propose a deep learning algorithm based on the generative adversarial network.We parameterize the value (the solution of HJB) and density (the solution of KFP) functions by two neural networks that solve a convex-concave saddle-point problem.

Authors

Publication Details

Published
2025-09-21
DOI
https://doi.org/10.51408/csit2025_71
Primary Topic
Opinion Dynamics and Social Influence
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Mean-field control and deep learning for information dissemination problem in online social networks

Nikolay Zyatkov, Olga Krivorotko, Tatiana Zvonareva
Opinion Dynamics and Social Influence
article

Mean-field control and deep learning for information dissemination problem in online social networks

Nikolay Zyatkov, Olga Krivorotko, Tatiana Zvonareva
article en

Abstract

The paper formulates and numerically investigates the tasks of stopping and stimulating the dissemination of information in online social networks for a mean-field model and a model based on artificial neural networks.The mean field model is reduced to a joint solution of initial boundary value problems for the Kolmogorov-Fokker-Planck (KFP) and Hamilton-Jacobi-Bellman (HJB) equations, as well as the Nash optimality condition.Numerical methods for solving systems of KFP and HJB in high dimensions are practically nonexistent due to the need for grid-based spatial discretization.Therefore, we propose a deep learning algorithm based on the generative adversarial network.We parameterize the value (the solution of HJB) and density (the solution of KFP) functions by two neural networks that solve a convex-concave saddle-point problem.

Openalex Percentile: Top 79%
Opinion Dynamics and Social Influence
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.