Localization Game for Random Graphs
Andrzej Dudek, Sean English, Alan Frieze, Calum MacRury, Pawel Pralat

TL;DR
This paper studies the localization game on graphs, focusing on the localization number, and provides improved bounds for dense random graphs as well as extending results to sparse graphs.
Contribution
It offers new bounds and asymptotic behavior analysis for the localization number in both dense and sparse random graphs.
Findings
Improved bounds for the localization number in dense random graphs.
Asymptotic behavior of the localization number established.
Extension of results to sparse graphs.
Abstract
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 corresponding graph parameter for a given graph is called the localization number. In this paper, we improve the bounds for dense random graphs determining an asymptotic behaviour of . Moreover, we extend the argument to sparse graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
