We introduce a generalized rumor spreading model and analytically investigate the spreading of rumors on scale-free (SF) networks. In the standard rumor spreading model, each node has an infectivity equal to its degree, and connectivity is uniform across all links. To generalize this model, we introduce an infectivity function that determines the number of simultaneous contacts that a given nod...

Recently, the use of social media platforms has increased with ease and fast accessibility, making such a place rumor proliferation owing to lack posting constraints content authentication. Therefore, there is need leverage artificial intelligence techniques detect rumors on prevent their adverse effects society individuals. Most existing works that in Arabic target textual features tweet conte...

How fake news goes viral via social media? How does its propagation pattern differ from real stories? In this paper, we attempt to address the problem of identifying rumors, i.e., fake information, out of microblog posts based on their propagation structure. We firstly model microblog posts diffusion with propagation trees, which provide valuable clues on how an original message is transmitted ...

In this paper, we study how rumors in Online Social Networks (OSNs) may impact the performance of device-to-device (D2D) communication. As D2D is a new technology, people may choose not to use it when believed in rumors of its negative impacts. Thus, the cellular network with underlaying D2D is vulnerable to OSNs as rumors in OSNs may decrement the throughput of the cellular network in popular ...

Rumors inundate every social network. Some of them are true, but many of them are false. On rare occasions, a false rumor is exposed as the lie that it is. But more commonly, false rumors have a habit of obtaining apparent verification, by corroboration from what seems to be a second independent source. However, in complex social networks, the connectivity is such that a putative second source ...

Radio networks model wireless synchronous communication with only one wave frequency used for transmissions. In the problem of many-to-all (M2A) communication, some nodes hold input rumors, and the goal is to have all nodes learn all the rumors. We study the average time complexity of distributed many-to-all communication by deterministic protocols in directed networks under two scenarios: of c...

Rumour detection is hard because the most accurate systems operate retrospectively, only recognising rumours once they have collected repeated signals. By then the rumours might have already spread and caused harm. We introduce a new category of features based on novelty, tailored to detect rumours early on. To compensate for the absence of repeated signals, we make use of news wire as an addit...