Eliminating Majority Illusion is Easy

TL;DR

This paper introduces polynomial-time algorithms to eliminate majority illusion in social networks by minimally altering connections, and proves the NP-hardness of related generalized problems.

Contribution

It provides the first efficient algorithms for removing majority illusion and establishes complexity results for broader network influence problems.

Findings

Polynomial-time algorithms effectively eliminate majority illusion.

Ensures all neighborhoods reach a specified majority fraction.

Generalized problem is NP-hard for most parameters.

Abstract

Majority Illusion is a phenomenon in social networks wherein the decision by the majority of the network is not the same as one's personal social circle's majority, leading to an incorrect perception of the majority in a large network. In this paper, we present polynomial-time algorithms which can eliminate majority illusion in a network by altering as few connections as possible. Additionally, we prove that the more general problem of ensuring all neighbourhoods in the network are at least a $p$-fraction of the majority is NP-hard for most values of $p$.