Eliminating Illusion in Directed Networks
arXiv:2604.02395v1 Announce Type: new Abstract: We study illusion elimination problems on directed social networks where each vertex is colored either red or blue. A vertex is under textit{majority illusion} if it has more red out-neighbors than blue out-neighbors when there are more blue vertices than red ones in the network. In a more general phenomenon of $p$-illusion, at least $p$ fraction of the out-neighbors (as opposed to $1/2$ for majority) of a vertex is red. In the directed […]