We look for an upper bound on this maximum relocation distance that holds with high probability (over the initial placements of the points).
For general graph we prove that the maximum relocation distance is O(sqrt{n}) w.h.p., for grid we prove that the maximum relocation distance is O(log^(7/2)n).