Sequential metric dimension for random graphs

10/22/2019
by   Gergely Odor, et al.
0

In the localization game, the goal is to find a fixed but unknown target node v^ with the least number of distance queries possible. In the j^th step of the game, the player queries a single node v_j and receives the distance between the nodes v_j and v^. The sequential metric dimension (SMD) is the minimal number of queries that the player needs to guess the target with absolute certainty, no matter where the target is. The term SMD originates from the related notion of metric dimension (MD), which can be defined the same way as the SMD, except that the player must choose all queries before any of the distances are revealed. In this work, we extend the results of arXiv:1208.3801 on the MD of Erdős-Rényi graphs to the SMD. We find that, in fully connected Erdős-Rényi graphs, the MD and the SMD are a constant factor apart. For the lower bound we present a clean analysis by combining tools developed for the MD and a novel coupling argument. For the upper bound we show that a strategy that greedily minimizes the number of candidate targets in each step uses asymptotically optimal queries in Erdős-Rényi graphs. Connections with source localization, binary search on graphs and the birthday paradox are discussed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/29/2021

Pursuit-evasion games on latin square graphs

We investigate various pursuit-evasion parameters on latin square graphs...
research
12/08/2021

A Simple Algorithm for Graph Reconstruction

How efficiently can we find an unknown graph using distance queries betw...
research
06/13/2018

Bounds on the localization number

We consider the localization game played on graphs, wherein a set of cop...
research
03/25/2020

The Exact Query Complexity of Yes-No Permutation Mastermind

Mastermind is famous two-players game. The first player (codemaker) choo...
research
06/09/2023

Optimal distance query reconstruction for graphs without long induced cycles

Let G=(V,E) be an n-vertex connected graph of maximum degree Δ. Given ac...
research
10/09/2019

Metric Dimension

In this manuscript, we provide a concise review of the concept of metric...
research
09/24/2019

The Query Complexity of Mastermind with ℓ_p Distances

Consider a variant of the Mastermind game in which queries are ℓ_p dista...

Please sign up or login with your details

Forgot password? Click here to reset