Centrality-driven Sparse Optimal Control of Belief Formation in Social Networks
Frontiers in Computing and Intelligent Systems · 30.07.2026 · 17 (2) · 31-36
DOI: 10.54097/htnq1v67 ↗Kurz gefasst
Fachartikel in der Zeitschrift Frontiers in Computing and Intelligent Systems, online erschienen am 30.07.2026. Verfasst von Bo Wang. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).
Abstract (Originalsprache)
This paper studies the problem of steering collective beliefs in social networks when only a small fraction of nodes can be directly influenced. We propose a sparse optimal control framework built on the Network Drift-Diffusion Model (NDDM). Two intervention mechanisms are considered: direct control and latent (indirect) control. To select which nodes to actuate, we compare six centrality measures---Degree, Betweenness, Eigenvector, Closeness, PageRank, and K-shell---and keep only the top 5\%--30\% as control inputs. The optimal feedback law follows from the Hamilton-Jacobi-Bellman (HJB) equation, which reduces to solving Riccati-type differential equations. We test our approach on Erdős-Rényi (ER), Barabási-Albert (BA), and Watts-Strogatz (WS) networks. The results show that the best centrality choice depends strongly on the network topology, and the system undergoes phase transitions as control parameters vary.
Zitieren
APA
Wang, B. (2026). Centrality-driven Sparse Optimal Control of Belief Formation in Social Networks. Frontiers in Computing and Intelligent Systems, 17(2), 31-36. https://doi.org/10.54097/htnq1v67
Vancouver
Wang B. Centrality-driven Sparse Optimal Control of Belief Formation in Social Networks. Frontiers in Computing and Intelligent Systems. 2026;17(2):31-36. doi:10.54097/htnq1v67
BibTeX
@article{Wang2026,
author = {Wang, Bo},
title = {Centrality-driven Sparse Optimal Control of Belief Formation in Social Networks},
journal = {Frontiers in Computing and Intelligent Systems},
year = {2026},
volume = {17},
number = {2},
pages = {31--36},
doi = {10.54097/htnq1v67}
}
EUVIMED