Edge flipping in the complete graph

We consider the following random process on the complete graph: repeatedly draw edges (with replacement) and with probability p   assign the vertices of the edge blue and with probability 1−p1−p assign the vertices of the edge red. This is a random walk on a state space of red/blue colorings of the complete graph and so has a stationary distribution. We derive this stationary distribution as well as answer some related questions.