What network topology can tell in election prediction

DOI10.1142/S1793830918500271zbMath1434.68667OpenAlexW2785939094MaRDI QIDQ4634531

Zhihao Chen, Zhao Zhang

Publication date: 10 April 2018

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830918500271

zbMATH Keywords

algorithmsocial networkelectionwinner prediction

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Nonnumerical algorithms (68W05) Voting theory (91B12)

Cites Work

• Ergodic theorems for weakly interacting infinite systems and the voter model
• A new status index derived from sociometric analysis
• Opinion Fluctuations and Disagreement in Social Networks
• On the role of zealotry in the voter model
• On the Limiting Behavior of Parameter-Dependent Network Centrality Measures
• A Recurring Theorem on Determinants

This page was built for publication: What network topology can tell in election prediction