Countering Misinformation on Social Networks Using Graph Alterations
Yigit E. Bayiz, Ufuk Topcu

TL;DR
This paper proposes an optimization-based method to selectively remove user connections in social networks, effectively reducing misinformation spread while preserving correct information dissemination.
Contribution
It introduces a probabilistic dropout technique optimized via convex programming to alter network dynamics against misinformation.
Findings
Reduces misinformation cascade size by up to 70% in synthetic networks.
Decreases misinformation spread by up to 45% in real Twitter-based networks.
Maintains a branching ratio of at least 1.5 for correct information.
Abstract
We restrict the propagation of misinformation in a social-media-like environment while preserving the spread of correct information. We model the environment as a random network of users in which each news item propagates in the network in consecutive cascades. Existing studies suggest that the cascade behaviors of misinformation and correct information are affected differently by user polarization and reflexivity. We show that this difference can be used to alter network dynamics in a way that selectively hinders the spread of misinformation content. To implement these alterations, we introduce an optimization-based probabilistic dropout method that randomly removes connections between users to achieve minimal propagation of misinformation. We use disciplined convex programming to optimize these removal probabilities over a reduced space of possible network alterations. We test the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOpinion Dynamics and Social Influence · Complex Network Analysis Techniques · Misinformation and Its Impacts
