Protocol definition

1. The ground is a simple connected graph. 2. At time 0, one vertex knows a rumour. 3. At each time-step 1, 2,..., every informed vertex tells the rumour to a random neighbour. Remark 1. Informed vertex may call a neighbour in consecutive steps. Remark 2. If a vertex receives the rumour at time t, it starts passing it from time t + 1. inform-time(v): the first time v learns the rumour. Spread Time: the first time everyone knows the rumour