arXiv Open Access 2015

Algorithm for Achieving Consensus Over Conflicting Rumors: Convergence Analysis and Applications

Amine Semma Ismail Elouafiq
Lihat Sumber

Abstrak

Motivated by the large expansion in the study of social networks, this paper deals with the problem of multiple messages spreading over the same network using gossip algorithms. Given two messages distributed over some nodes of the graph, we first investigate the final distribution of the messages given an initial state. Then, an algorithm is presented to achieve consensus over one of the messages. Finally, a game theoretical application and an analogy with word-of-mouth marketing are outlined.

Topik & Kata Kunci

Penulis (2)

A

Amine Semma

I

Ismail Elouafiq

Format Sitasi

Semma, A., Elouafiq, I. (2015). Algorithm for Achieving Consensus Over Conflicting Rumors: Convergence Analysis and Applications. https://arxiv.org/abs/1502.00802

Akses Cepat

Lihat di Sumber
Informasi Jurnal
Tahun Terbit
2015
Bahasa
en
Sumber Database
arXiv
Akses
Open Access ✓