اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMoving with the Times: Investigating the Alt-Right Network Gab with Temporal Interaction Graphs
156
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Gab is an online social network often associated with the alt-right political movement and users barred from other networks. It presents an interesting opportunity for research because near-complete data is available from day one of the networks creation. In this paper, we investigate the evolution of the user interaction graph, that is the graph where a link represents a user interacting with another user at a given time. We view this graph both at different times and at different timescales. The latter is achieved by using sliding windows on the graph which gives a novel perspective on social network data. The Gab network is relatively slowly growing over the period of months but subject to large bursts of arrivals over hours and days. We identify plausible events that are of interest to the Gab community associated with the most obvious such bursts. The network is characterised by interactions between `strangers rather than by reinforcing links between `friends. Gab usage follows the diurnal cycle of the predominantly US and Europe based users. At off-peak hours the Gab interaction network fragments into sub-networks with absolutely no interaction between them. A small group of users are highly influential across larger timescales, but a substantial number of users gain influence for short periods of time. Temporal analysis at different timescales gives new insights above and beyond what could be found on static graphs.
قيم البحث
اقرأ أيضاً
Social media has become an important venue for diverse groups to share information, discuss political issues, and organize social movements. Recent scholarship has shown that the social media ecosystem can affect political thinking and expression. In
dividuals and groups across the political spectrum have engaged in the use of these platforms extensively, even creating their own forums with varying approaches to content moderation in pursuit of freer standards of speech. The Gab social media platform arose in this context. Gab is a social media platform for the so-called alt right, and much of the popular press has opined about the thematic content of discourses on Gab and platforms like it, but little research has examined the content itself. Using a publicly available dataset of all Gab posts from August 2016 until July 2019, the current paper explores a five percent random sample of this dataset to explore thematic content on the platform. We run multiple structural topic models, using standard procedures to arrive at an optimal k number of topics. The final model specifies 85 topics for 403,469 documents. We include as prevalence variables whether the source account has been flagged as a bot and the number of followers for the source account. Results suggest the most nodal topics in the dataset pertain to the authenticity of the Holocaust, the meaning of red pill, and the journalistic merit of mainstream media. We conclude by discussing the implications of our findings for work in ethical content moderation, online community development, political polarization, and avenues for future research.
The moderation of content in many social media systems, such as Twitter and Facebook, motivated the emergence of a new social network system that promotes free speech, named Gab. Soon after that, Gab has been removed from Google Play Store for violat
ing the companys hate speech policy and it has been rejected by Apple for similar reasons. In this paper we characterize Gab, aiming at understanding who are the users who joined it and what kind of content they share in this system. Our findings show that Gab is a very politically oriented system that hosts banned users from other social networks, some of them due to possible cases of hate speech and association with extremism. We provide the first measurement of news dissemination inside a right-leaning echo chamber, investigating a social media where readers are rarely exposed to content that cuts across ideological lines, but rather are fed with content that reinforces their current political or social views.
Temporal graphs are ubiquitous. Mining communities that are bursting in a period of time is essential to seek emergency events in temporal graphs. Unfortunately, most previous studies for community mining in temporal networks ignore the bursting patt
erns of communities. In this paper, we are the first to study a problem of seeking bursting communities in a temporal graph. We propose a novel model, called (l, {delta})-maximal dense core, to represent a bursting community in a temporal graph. Specifically, an (l, {delta})-maximal dense core is a temporal subgraph in which each node has average degree no less than {delta} in a time segment with length no less than l. To compute the (l, {delta})-maximal dense core, we first develop a novel dynamic programming algorithm which can calculate the segment density efficiently. Then, we propose an improved algorithm with several novel pruning techniques to further improve the efficiency. In addition, we also develop an efficient algorithm to enumerate all (l, {delta})-maximal dense cores that are not dominated by the others in terms of the parameters l and {delta}. The results of extensive experiments on 9 real-life datasets demonstrate the effectiveness, efficiency and scalability of our algorithms.
Network embedding aims to learn low-dimensional representations of nodes while capturing structure information of networks. It has achieved great success on many tasks of network analysis such as link prediction and node classification. Most of exist
ing network embedding algorithms focus on how to learn static homogeneous networks effectively. However, networks in the real world are more complex, e.g., networks may consist of several types of nodes and edges (called heterogeneous information) and may vary over time in terms of dynamic nodes and edges (called evolutionary patterns). Limited work has been done for network embedding of dynamic heterogeneous networks as it is challenging to learn both evolutionary and heterogeneous information simultaneously. In this paper, we propose a novel dynamic heterogeneous network embedding method, termed as DyHATR, which uses hierarchical attention to learn heterogeneous information and incorporates recurrent neural networks with temporal attention to capture evolutionary patterns. We benchmark our method on four real-world datasets for the task of link prediction. Experimental results show that DyHATR significantly outperforms several state-of-the-art baselines.
We investigate the potential collider signatures of singly-charged and doubly-charged Higgs bosons such as those arising in minimal left-right symmetric models. Focusing on multileptonic probes in the context of the high-luminosity run of the Large H
adron Collider, we separately assess the advantages of the four-leptonic and trileptonic final states for a representative benchmark setup designed by considering a large set of experimental constraints. Our study establishes possibilities of identifying singly-charged and doubly-charged scalars at the Large Hadron Collider with a large significance, for luminosity goals expected to be reached during the high-luminosity phase of the Large Hadron Collider. We generalise our results and demonstrate that existing limits can in principle be pushed much further in the heavy mass regime.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
