Machine learning-based prediction of Q-voter model in complex networks
Abstract
In this article, we consider machine learning algorithms to accurately predict two variables associated with the -voter model in complex networks, i.e., (i) the consensus time and (ii) the frequency of opinion changes. Leveraging nine topological measures of the underlying networks, we verify that the clustering coefficient (C) and information centrality (IC) emerge as the most important predictors for these outcomes. Notably, the machine learning algorithms demonstrate accuracy across three distinct initialization methods of the -voter model, including random selection and the involvement of high- and low-degree agents with positive opinions. By unraveling the intricate interplay between network structure and dynamics, this research sheds light on the underlying mechanisms responsible for polarization effects and other dynamic patterns in social systems. Adopting a holistic approach that comprehends the complexity of network systems, this study offers insights into the intricate dynamics associated with polarization effects and paves the way for investigating the structure and dynamics of complex systems through modern machine learning methods.
Cite
@article{arxiv.2310.09131,
title = {Machine learning-based prediction of Q-voter model in complex networks},
author = {Aruane M. Pineda and Paul Kent and Colm Connaughton and Francisco A. Rodrigues},
journal= {arXiv preprint arXiv:2310.09131},
year = {2023}
}
Comments
32 pages, 10 figures