Week 9

Question 1

Voter model (idea)

Answer 1

Happens in rounds (at end of round everyone ‘votes’)

At each round t, each agent v selects one of its neighbours uniformly to copy

Question 2

Voter model (notation)

Answer 2

t € T is rounds for t = 0,1,…

G = (V,E) for an undirected connected graph

Colours are in set X

For each t we have S_t : V -> X (each agent has a colour)

Question 3

Connected graph

Answer 3

There is a trail from each edge to each other

Question 4

deg(v)

Answer 4

Number of neighbours of v

Question 5

Probability of consensus theorem

Answer 5

(You need something that is invariant, in this case degree of edges)