Related papers: Reliability and efficiency of generalized rumor sp…
Rumor models consider that information transmission occurs with the same probability between each pair of nodes. However, this assumption is not observed in social networks, which contain influential spreaders. To overcome this limitation,…
Rumor spreading is a ubiquitous phenomenon in social and technological networks. Traditional models consider that the rumor is propagated by pairwise interactions between spreaders and ignorants. Spreaders can become stiflers only after…
We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particular those mediated by the Internet). We use analytical and…
We investigate rumor spreading in a generalized Maki-Thompson model with spontaneous stifling, evolving on quasi-transitive networks. Individuals are either ignorants, spreaders, or stiflers; spreaders stop by contact with other spreaders…
We study the dynamics of epidemic spreading processes aimed at spontaneous dissemination of information updates in populations with complex connectivity patterns. The influence of the topological structure of the network in these processes…
We derive mean-field equations that describe the dynamics of a general model of rumor spreading on complex networks, and use analytical and numerical solutions of these equations to examine the threshold behavior and dynamics of the model…
We study a rumor spreading model where individuals are connected via a network structure. Initially, only a small subset of the individuals are spreading a rumor. Each individual who is connected to a spreader, starts spreading the rumor…
The burst in the use of online social networks over the last decade has provided evidence that current rumor spreading models miss some fundamental ingredients in order to reproduce how information is disseminated. In particular, recent…
We derive the mean-field equations characterizing the dynamics of a rumor process that takes place on top of complex heterogeneous networks. These equations are solved numerically by means of a stochastic approach. First, we present…
The spread of rumors, which are known as unverified statements of uncertain origin, may cause tremendous number of social problems. If it would be possible to identify factors affecting spreading a rumor (such as agents' desires, trust…
Recent research [1] has suggested that coreness, and not degree, constitutes a better topological descriptor to identifying influential spreaders in complex networks. This hypothesis has been verified in the context of disease spreading.…
In earlier rumor spreading models, at each time step nodes contact all of their neighbors. In more realistic scenario it is possible that a node may contact only some of its neighbors to spread the rumor. Therefore it is must in real world…
The rapid spread of information and rumors through social media platforms, especially in group settings, motivates the need for more sophisticated models of rumor propagation. Traditional pairwise models do not account for group…
In the era of the rapid development of the Internet, the threshold for information spreading has become lower. Most of the time, rumors, as a special kind of information, are harmful to society. And once the rumor appears, the truth will…
In this paper, we present an experimental analysis of the asynchronous push & pull rumour spreading protocol. This protocol is, to date, the best-performing rumour spreading protocol for simple, scalable, and robust information…
Rumour spreading is a protocol for modelling the spread of information through a network via user-to-user interaction. The Spatial Preferred Attachment (SPA) model is a random graph model for complex networks: vertices are placed in a…
With the rise of social media, misinformation has become increasingly prevalent, fueled largely by the spread of rumors. This study explores the use of Large Language Model (LLM) agents within a novel framework to simulate and analyze the…
We study a simple model of information propagation in social networks, where two quantities are introduced: the spread factor, which measures the average maximal fraction of neighbors of a given node that interchange information among each…
We propose a mathematical model to measure how multiple repetitions may influence in the ultimate proportion of the population never hearing a rumor during a given outbreak. The model is a multi-dimensional continuous-time Markov chain that…
We study the diffusion of a true and a false message (the rumor) in a social network. Upon hearing a message, individuals may believe it, disbelieve it, or debunk it through costly verification. Whenever the truth survives in steady state,…