TY - GEN
T1 - Using Connected Accounts to Enhance Information Spread in Social Networks
AU - Sela, Alon
AU - Cohen-Milo, Orit
AU - Kagan, Eugene
AU - Zwilling, Moti
AU - Ben-Gal, Irad
N1 - Publisher Copyright:
© 2020, Springer Nature Switzerland AG.
PY - 2020
Y1 - 2020
N2 - In this article, a new operation mode of social bots is presented. It includes a creation of social bots in dense, highly-connected, sub structures in the network, named Spreading Groups. Spreading Groups are groups of bots and human-managed accounts that operate in social networks. They are often used to bias the natural opinion spread and to promote and over represent an agenda. These bots accounts are mixed with regular users, while repeatedly echoing their agenda, disguised as real humans who simply deliver their own personal thoughts. This mixture makes the bots more difficult to detect and more influential. We show that if these connected sub structures repeatedly echo a message within their group, such an operation mode will spread messages more efficiently compared to a random spread of unconnected bots of a similar size. In particular, groups of bots were found to be as influential as groups of similar sizes, which are constructed from the most influential users (e.g., those with the highest eigenvalue centrality) in the social network. They were also found to be twice more influential on average than groups of similar sizes of random bots.
AB - In this article, a new operation mode of social bots is presented. It includes a creation of social bots in dense, highly-connected, sub structures in the network, named Spreading Groups. Spreading Groups are groups of bots and human-managed accounts that operate in social networks. They are often used to bias the natural opinion spread and to promote and over represent an agenda. These bots accounts are mixed with regular users, while repeatedly echoing their agenda, disguised as real humans who simply deliver their own personal thoughts. This mixture makes the bots more difficult to detect and more influential. We show that if these connected sub structures repeatedly echo a message within their group, such an operation mode will spread messages more efficiently compared to a random spread of unconnected bots of a similar size. In particular, groups of bots were found to be as influential as groups of similar sizes, which are constructed from the most influential users (e.g., those with the highest eigenvalue centrality) in the social network. They were also found to be twice more influential on average than groups of similar sizes of random bots.
KW - Bot
KW - Information spread
KW - Social networks
KW - Spreading Groups
UR - http://www.scopus.com/inward/record.url?scp=85076679017&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-36687-2_38
DO - 10.1007/978-3-030-36687-2_38
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85076679017
SN - 9783030366865
T3 - Studies in Computational Intelligence
SP - 459
EP - 468
BT - Complex Networks and Their Applications VIII - Volume 1 Proceedings of the 8th International Conference on Complex Networks and Their Applications, COMPLEX NETWORKS 2019
A2 - Cherifi, Hocine
A2 - Gaito, Sabrina
A2 - Mendes, José Fernendo
A2 - Moro, Esteban
A2 - Rocha, Luis Mateus
T2 - 8th International Conference on Complex Networks and their Applications, COMPLEX NETWORKS 2019
Y2 - 10 December 2019 through 12 December 2019
ER -