Localization game for random graphs

We consider the localization game played on graphs in which a cop tries to determine the exact location of an invisible robber by exploiting distance probes. The minimum number of probes necessary per round to locate the robber on a given graph is the localization number . In this paper, we improve the bounds for dense random graphs determining the asymptotic behaviour of . Moreover, we extend the argument to sparse graphs.