Related papers: Total flooding time and rumor propagation on graph…
Recent work, motivated by anonymous messaging platforms, has introduced adaptive diffusion protocols which can obfuscate the source of a rumor: a "snapshot adversary" with access to the subgraph of "infected" nodes can do no better than…
We study in this paper optimal mass transport over a strongly connected, directed graph on a given discrete time interval. Differently from previous literature, we do not assume full knowledge of the initial and final goods distribution…
Dynamic models and statistical inference for the diffusion of information in social networks is an area which has witnessed remarkable progress in the last decade due to the proliferation of social networks. Modeling and inference of…
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,…
In most social and information systems the activity of agents generates rapidly evolving time-varying networks. The temporal variation in networks' connectivity patterns and the ongoing dynamic processes are usually coupled in ways that…
Growing literatures on epidemic and rumor dynamics show that infection and information coevolve. We present a unified framework for modeling the spread of infection and information: a general class of interaction-driven fluid-limit models…
Motivated by the growing interest in mobile systems, we study the dynamics of information dissemination between agents moving independently on a plane. Formally, we consider $k$ mobile agents performing independent random walks on an…
Social networks allow rapid spread of ideas and innovations while the negative information can also propagate widely. When the cascades with different opinions reaching the same user, the cascade arriving first is the most likely to be…
The identification of the minimal set of nodes that maximizes the propagation of information is one of the most relevant problems in network science. In this paper, we introduce a new method to find the set of initial spreaders to maximize…
In distributed environments, such as distributed ledgers technologies and other peer-to-peer architectures, communication represents a crucial topic. The ability to efficiently disseminate contents is strongly influenced by the type of…
We consider the optimization problem of seeding a spreading process on a temporal network so that the expected size of the resulting outbreak is maximized. We frame the problem for a spreading process following the rules of the…
Inspired by distributed resource allocation problems in dynamic topology networks, we initiate the study of distributed consensus with finite messaging passing. We first find a sufficient condition on the network graph for which no…
We consider a gossip network, consisting of $n$ nodes, which tracks the information at a source. The source updates its information with a Poisson arrival process and also sends updates to the nodes in the network. The nodes themselves can…
This paper addresses the issue of suppressing a rumor using the truth in a cost-effective way. First, an individual-level dynamical model capturing the rumor-truth mixed spreading processes is proposed. On this basis, the cost-effective…
Temporal networks, whose links are activated or deactivated over time, are used to represent complex systems such as social interactions or collaborations occurring at specific times. Such networks facilitate the spread of information and…
Temporal interaction networks capture the history of activities between entities along a timeline. At each interaction, some quantity of data (money, information, kbytes, etc.) flows from one vertex of the network to another. Flow-based…
Graph theory provides a language for studying the structure of relations, and it is often used to study interactions over time too. However, it poorly captures the both temporal and structural nature of interactions, that calls for a…
We consider a model of language development, known as the naming game, in which agents invent, share and then select descriptive words for a single object, in such a way as to promote local consensus. When formulated on a finite and…
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…
We consider the median dynamics process in general graphs. In this model, each vertex has an independent initial opinion uniformly distributed in the interval [0,1] and, with rate one, updates its opinion to coincide with the median of its…