The strength of weak bots

Some fear that social bots, automated accounts on online social networks, propagate falsehoods that can harm public opinion formation and democratic decision-making. Empirical research, however, resulted in puzzling findings. On the one hand, the content emitted by bots tends to spread very quickly in the networks. On the other hand, it turned out that bots’ ability to contact human users tends to be very limited. Here we analyze an agent-based model of social influence in networks explaining this inconsistency. We show that bots may be successful in spreading falsehoods not despite their limited direct impact on human users, but because of this limitation. Our model suggests that bots with limited direct impact on humans may be more and not less effective in spreading their views in the social network, because their direct contacts keep exerting influence on users that the bot does not reach directly. Highly active and well-connected bots, in contrast, may have a strong impact on their direct contacts, but these contacts grow too dissimilar from their network neighbors to further spread the bot\u27s content. To demonstrate this effect, we included bots in Axelrod\u27s seminal model of the dissemination of cultures and conducted simulation experiments demonstrating the strength of weak bots. A series of sensitivity analyses show that the finding is robust, in particular when the model is tailored to the context of online social networks. We discuss implications for future empirical research and developers of approaches to detect bots and misinformatio

The strength of weak bots

Some fear that social bots, automated accounts on online social networks, propagate falsehoods that can harm public opinion formation and democratic decision-making. Empirical research, however, resulted in puzzling findings. On the one hand, the content emitted by bots tends to spread very quickly in the networks. On the other hand, it turned out that bots’ ability to contact human users tends to be very limited. Here we analyze an agent-based model of social influence in networks explaining this inconsistency. We show that bots may be successful in spreading falsehoods not despite their limited direct impact on human users, but because of this limitation. Our model suggests that bots with limited direct impact on humans may be more and not less effective in spreading their views in the social network, because their direct contacts keep exerting influence on users that the bot does not reach directly. Highly active and well-connected bots, in contrast, may have a strong impact on their direct contacts, but these contacts grow too dissimilar from their network neighbors to further spread the bot\u27s content. To demonstrate this effect, we included bots in Axelrod\u27s seminal model of the dissemination of cultures and conducted simulation experiments demonstrating the strength of weak bots. A series of sensitivity analyses show that the finding is robust, in particular when the model is tailored to the context of online social networks. We discuss implications for future empirical research and developers of approaches to detect bots and misinformatio

Detecting the Influence of Spreading in Social Networks with Excitable Sensor Networks

Detecting spreading outbreaks in social networks with sensors is of great significance in applications. Inspired by the formation mechanism of human's physical sensations to external stimuli, we propose a new method to detect the influence of spreading by constructing excitable sensor networks. Exploiting the amplifying effect of excitable sensor networks, our method can better detect small-scale spreading processes. At the same time, it can also distinguish large-scale diffusion instances due to the self-inhibition effect of excitable elements. Through simulations of diverse spreading dynamics on typical real-world social networks (facebook, coauthor and email social networks), we find that the excitable senor networks are capable of detecting and ranking spreading processes in a much wider range of influence than other commonly used sensor placement methods, such as random, targeted, acquaintance and distance strategies. In addition, we validate the efficacy of our method with diffusion data from a real-world online social system, Twitter. We find that our method can detect more spreading topics in practice. Our approach provides a new direction in spreading detection and should be useful for designing effective detection methods

Theories for influencer identification in complex networks

In social and biological systems, the structural heterogeneity of interaction networks gives rise to the emergence of a small set of influential nodes, or influencers, in a series of dynamical processes. Although much smaller than the entire network, these influencers were observed to be able to shape the collective dynamics of large populations in different contexts. As such, the successful identification of influencers should have profound implications in various real-world spreading dynamics such as viral marketing, epidemic outbreaks and cascading failure. In this chapter, we first summarize the centrality-based approach in finding single influencers in complex networks, and then discuss the more complicated problem of locating multiple influencers from a collective point of view. Progress rooted in collective influence theory, belief-propagation and computer science will be presented. Finally, we present some applications of influencer identification in diverse real-world systems, including online social platforms, scientific publication, brain networks and socioeconomic systems.Comment: 24 pages, 6 figure

Hipsters on Networks: How a Small Group of Individuals Can Lead to an Anti-Establishment Majority

The spread of opinions, memes, diseases, and "alternative facts" in a population depends both on the details of the spreading process and on the structure of the social and communication networks on which they spread. In this paper, we explore how \textit{anti-establishment} nodes (e.g., \textit{hipsters}) influence the spreading dynamics of two competing products. We consider a model in which spreading follows a deterministic rule for updating node states (which describe which product has been adopted) in which an adjustable fraction $p_{\rm Hip}$ of the nodes in a network are hipsters, who choose to adopt the product that they believe is the less popular of the two. The remaining nodes are conformists, who choose which product to adopt by considering which products their immediate neighbors have adopted. We simulate our model on both synthetic and real networks, and we show that the hipsters have a major effect on the final fraction of people who adopt each product: even when only one of the two products exists at the beginning of the simulations, a very small fraction of hipsters in a network can still cause the other product to eventually become the more popular one. To account for this behavior, we construct an approximation for the steady-state adoption fraction on $k$-regular trees in the limit of few hipsters. Additionally, our simulations demonstrate that a time delay $\tau$ in the knowledge of the product distribution in a population, as compared to immediate knowledge of product adoption among nearest neighbors, can have a large effect on the final distribution of product adoptions. Our simple model and analysis may help shed light on the road to success for anti-establishment choices in elections, as such success can arise rather generically in our model from a small number of anti-establishment individuals and ordinary processes of social influence on normal individuals.Comment: Extensively revised, with much new analysis and numerics The abstract on arXiv is a shortened version of the full abstract because of space limit