Gossip protocols have proved to be a viable solution to set-up and manage largescale P2P services or applications in a fully decentralised scenario. The gossip or epidemic communication scheme is heavily based on stochastic behaviors and it is the fundamental idea behind many large-scale P2P protocols. It provides many remarkable features, such as scalability, robustness to failures, emergent l...

A gossip process is an iterative in a multi-agent system where only two neighboring agents communicate at each iteration and update their states. The condition by convention described undirected graph. In this paper, we consider general rule whereby agent takes arbitrary weighted average of its neighbor’s current general, the limit (if it converges) depends on order iterations gossiping pairs. ...

We are entangled in a tightly woven social fabric of which many of the intersections and communication processes are hidden. The social structures made visible are those of governments, corporations and institutions. Other social structures that have no representation are trivialized as fiction or on a day-to-day-level, as gossip. Gossip is the most effective and compelling way of weaving the s...

The gossip paradigm made its first appearance in distributed systems in 1987, when it was applied to disseminate updates in replicated databases. Two decades later, gossip-based protocols have gone far beyond dissemination, solving a large and diverse collection of problems. We believe that the story is not over: while gossip is not the panacea for distributed systems, there are still virgin re...

Motivated by applications to wireless sensor, peer-to-peer, and social networks, the canonical average consensus problem is considered in random and regular graphs in this paper. A local average information exchange (LAIE) algorithm is developed to compute the global consensus of the initial measurements of the nodes at every node in the network. In the proposed algorithm, each node interacts w...

This paper presents a new theorem called the reordering theorem for the problem of gossiping by telephone. The theorem says the calls of any complete gossiping can be rearranged into a sequence such that at most two calls cause each participant to become fully informed, and such that the reverse of this sequence has the same property. This theorem has broad consequences. Several results from th...

RÉSUMÉ. Pour permettre la recherche par le contenu de documents multimédia repartis sur de larges réseaux, nous proposons un système d’indexation basé sur l’apprentissage décentralisé et asynchrone de dictionnaires visuels. Nous proposons un algorithme décentralisé pour le calcul des dictionnaires basé sur un protocole d’agrégation Gossip, qui produit un dictionnaire local performant en chaque ...

Four studies were conducted to develop and validate a measure of individual differences in attitudes towards gossip (ATG). In Study 1, exploratory factor analyses of responses to a pool of ATG items identified two factors reflecting attitudes about gossip s Social Value (SV) and Moral Value (MV), which provided the basis for constructing a 12-item ATG scale. In Study 2, the SV and MV factors we...