Diffusion of Ordinal Opinions in Social Networks: An Agent-Based Model and Heuristics for Campaigning

Most research investigating how social influence affects election results mainly uses diffusion models for binary opinions. However, these diffusion models are progressive and focus on the diffusion of one opinion. In this article, we introduce a general diffusion model for ordinal opinions expressed as linear orderings over a finite set of candidates. We employ agent-based modeling to simulate a nonprogressive diffusion process, allowing multiple types of opinion diffusion about different candidates. The proposed agent-based diffusion model can forecast long-term trends of opinion diffusion in social networks by capturing voters’ personalized features and incorporating dynamic social contexts. Furthermore, we examine the possibility of affecting election outcomes by externally changing the ordinal opinions of certain vertices, i.e., campaigning. Since finding influential voters from the social network is computationally challenging, we propose a heuristic approach, i.e., backward influence rank (BIR). Experimental results demonstrate that the proposed BIR approach is superior to the classic greedy approach for campaigning by achieving a similar margin of victory to that of the greedy approach but running two orders of magnitude faster than the greedy approach did.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Computational Social Systems
Published
2024-10-09
DOI
https://doi.org/10.1109/tcss.2024.3458950
Citations
1
Primary Topic
Opinion Dynamics and Social Influence
Type
article
Field-Weighted Citation Impact
0.28
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Diffusion of Ordinal Opinions in Social Networks: An Agent-Based Model and Heuristics for Campaigning

Guoxin Su, Fenghui Ren, Xiaoxue Liu, Shōhei Kato et al.
1 citations
IEEE Transactions on Computational Social Systems
Opinion Dynamics and Social Influence
0.28
article

Diffusion of Ordinal Opinions in Social Networks: An Agent-Based Model and Heuristics for Campaigning

Guoxin Su, Fenghui Ren, Xiaoxue Liu, Shōhei Kato, Minjie Zhang, Wen Gu
article en
1 citations

Abstract

Most research investigating how social influence affects election results mainly uses diffusion models for binary opinions. However, these diffusion models are progressive and focus on the diffusion of one opinion. In this article, we introduce a general diffusion model for ordinal opinions expressed as linear orderings over a finite set of candidates. We employ agent-based modeling to simulate a nonprogressive diffusion process, allowing multiple types of opinion diffusion about different candidates. The proposed agent-based diffusion model can forecast long-term trends of opinion diffusion in social networks by capturing voters’ personalized features and incorporating dynamic social contexts. Furthermore, we examine the possibility of affecting election outcomes by externally changing the ordinal opinions of certain vertices, i.e., campaigning. Since finding influential voters from the social network is computationally challenging, we propose a heuristic approach, i.e., backward influence rank (BIR). Experimental results demonstrate that the proposed BIR approach is superior to the classic greedy approach for campaigning by achieving a similar margin of victory to that of the greedy approach but running two orders of magnitude faster than the greedy approach did.

IEEE Transactions on Computational Social SystemsVol. 12(1)
Japan Advanced Institute of Science and Technology (JP), Nagoya Institute of Technology (JP), University of Wollongong (AU)
Openalex Percentile: Top 44%
Opinion Dynamics and Social Influence
0.28
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.