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

2015/02/03 by Amine Semma, Semma, Amine, Ismail Elouafiq +1
Decision Sciences · Physics and Astronomy · Social Sciences · #Complex Network Analysis Techniques #Distributed #Evolutionary Game Theory and Cooperation #FOS: Computer and information sciences #FOS: Mathematics #Game Theory and Applications #Opinion Dynamics and Social Influence #Parallel #Probability (math.PR) #Social and Information Networks (cs.SI) #and Cluster Computing (cs.DC)

paper · pdf · doi:10.48550/arxiv.1502.00802

openalex publication_date 2015/02/03 · openalex created_date 2022/09/02 · openalex updated_date 2026/07/28

Abstract

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

Related

• Distributed Consensus Formation Through Unconstrained Gossiping
• Gossip consensus algorithms via quantized communication
• Broadcast Gossip Algorithms for Consensus on Strongly Connected Digraphs
• A New Perspective on Randomized Gossip Algorithms
• Paving the Way for Consensus: Convergence of Block Gossip Algorithms