Asymptotics for Push on the Complete Graph

We study the popular randomized rumour spreading protocol push. Initially, a node in a graph possesses some information, which is then spread in a round based manner. In each round, each informed node chooses uniformly at random one of its neighbours and passes the information to it. The quantity to investigate is the runtime, that is, the number of rounds until everybody has received the information.