Abstract
We study the localization game on dense random graphs. In this game, a copx tries to locate a robbery by asking for the graph distance of y from every vertex in a sequence of sets W1,W2,…,Wℓ. We prove high probability upper and lower bounds for the minimum size of each Wi that will guarantee that x will be able to locate y.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
