Related papers: Rumour Processes on N
Mobile networks receive increasing research interest recently due to their increasingly wide applications in various areas; mobile ad hoc networks (MANET) and Vehicular ad hoc networks (VANET) are two prominent examples. Mobility introduces…
When opinion spread is studied, peer pressure is often modeled by interactions of more than two individuals (higher-order interactions). In our work, we introduce a two-layer random hypergraph model, in which hyperedges represent households…
It is proposed a model that makes use of the Entropy concept and the Jensen-Shannon information divergence function to simulate computationally the dissemination of opinions on a Barab\'asi-Albert (BA) scale-free network. The simulation…
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assume that initially one node in a given network holds some…
Social media have become part of modern news reporting, used by journalists to spread information and find sources, or as a news source by individuals. The quest for prominence and recognition on social media sites like Twitter can…
With technologies that have democratized the production and reproduction of information, a significant portion of daily interacted posts in social media has been infected by rumors. Despite the extensive research on rumor detection and…
There has been much effort on studying how social media sites, such as Twitter, help propagate information in different situations, including spreading alerts and SOS messages in an emergency. However, existing work has not addressed how to…
We model the communication of narratives as a cheap-talk game under model uncertainty. The sender has private information about the true data generating process of publicly observable data. The receiver is uncertain about how to interpret…
Opinion formation is one of the most fascinating phenomena observed in human communities, and the ability to predict and to control the dynamics of this process is interesting from the theoretical as well as practical point of view.…
The diffusion of ideas is often closely connected to the creation and diffusion of knowledge and to the technological evolution of society. Because of this, knowledge creation, exchange and its subsequent transformation into innovations for…
Behavioral adoptions are influenced by peers in different ways. While some individuals may change after a single incoming influence, others need multiple cumulated attempts. These two mechanism, known as the simple and the complex…
We study a model of rumor propagation in discrete time where each site in the graph has initially a distinct information; we are interested in the number of "conversations" before the entire graph knows all informations. This problem can be…
Stationary distributions of multivariate diffusion processes have recently been proposed as probabilistic models of causal systems in statistics and machine learning. Motivated by these developments, we study stationary multivariate…
Impulse propagation in crowds is a phenomenon that is crucial for understanding collective dynamics, but has been scarcely addressed so far. Therefore, we have carried out experiments in which persons standing in a crowd are pushed forward…
We analyze four models of epidemic spreading using a stochastic approach in which the primary stochastic variables are the numbers of individuals in each class. The stochastic approach is described by a master equation and the transition…
The spread of information has become faster and wider than ever with the advent of social network platforms. The question raised in this study is whether information dissemination in social networks is random or follows a discernible…
In this paper, we study an asynchronous randomized gossip algorithm under unreliable communication. At each instance, two nodes are selected to meet with a given probability. When nodes meet, two unreliable communication links are…
We study gossip algorithms for the rumor spreading problem which asks each node to deliver a rumor to all nodes in an unknown network. Gossip algorithms allow nodes only to call one neighbor per round and have recently attracted attention…
We consider a coupled Polya's urn scheme for social dynamics on networks. Agents hold continuum-valued opinions on a two-state issue and randomly converse with their neighbors on a graph, agreeing on one of the two states. The probability…
We examine a general stochastic rumor model characterized by specific parameters that govern the interaction rates among individuals. Our model includes the \((\alpha, p)\)-probability variants of the well-known Daley--Kendall and…