… Gossip Algorithm Ali Saidi Advanced Infrastructure Design Hamilton, NJ, USA asaidi@aidpe.com Mojdeh Mohtashemi MITRE Corp., McLean, VA, USA MIT CSAIL, Cambridge, MA, USA mojdeh@mitre.org … of information where communication takes place in parallel rounds. In each round every node contacts another node at random and either receives or transmits a piece of information (or … round i+1, the probability that some node does not have the information (the proportion iX−1 ) contacts a node that does, is iX . An Implicit assumption in (1) is that all the nodes cooperate …