Thomas Sauerwald
> University of Cambridge
Scientific, Seminar
Algorithmic Theory of Networks Seminar: Thomas Sauerwald
We study a natural process for allocating m balls into n bins that are organized as the vertices of an undirected graph G. Balls arrive one at a time. When a ball arrives, it first chooses a vertex u in G uniformly at random. Then the ball performs a...