Author:
Schroeder Daniel Thilo,Langguth Johannes,Burchard Luk,Pogorelov Konstantin,Lind Pedro G.
Abstract
AbstractOnline social networks are ubiquitous, have billions of users, and produce large amounts of data. While platforms like Reddit are based on a forum-like organization where users gather around topics, Facebook and Twitter implement a concept in which individuals represent the primary entity of interest. This makes them natural testbeds for exploring individual behavior in large social networks. Underlying these individual-based platforms is a network whose “friend” or “follower” edges are of binary nature only and therefore do not necessarily reflect the level of acquaintance between pairs of users. In this paper,we present the network of acquaintance “strengths” underlying the German Twittersphere. To that end, we make use of the full non-verbal information contained in tweet–retweet actions to uncover the graph of social acquaintances among users, beyond pure binary edges. The social connectivity between pairs of users is weighted by keeping track of the frequency of shared content and the time elapsed between publication and sharing. Moreover, we also present a preliminary topological analysis of the German Twitter network. Finally, making the data describing the weighted German Twitter network of acquaintances, we discuss how to apply this framework as a ground basis for investigating spreading phenomena of particular contents.
Publisher
Springer Science and Business Media LLC
Reference31 articles.
1. Vosoughi, S., Roy, D. & Aral, S. The spread of true and false news online. Science 359, 1146–1151 (2018).
2. Porter, M. A. & Gleeson, J. P. Dynamical systems on networks. Front. Appl. Dyn. Syst. Rev. Tutor. 4, 20 (2016).
3. Gupta, P. et al. Wtf: The who to follow service at twitter. In Proceedings of the 22nd International Conference on World Wide Web, 505–514 (2013).
4. Paßmann, J. Die soziale Logik des Likes: Eine Twitter-Ethnografie (Campus Verlag, ***, 2018).
5. Michail, D., Kinable, J., Naveh, B. & Sichi, J. V. Jgrapht-a java library for graph data structures and algorithms. ACM Trans. Math. Softw. 46, 1–29 (2020).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献