Are Large Random Graphs Always Safe to Hide?
Logic in Computer Science
2025-12-01 v1 Computer Science and Game Theory
Abstract
We discuss winning possibilities of players in various variants of cops and robber game played on large random graphs, a testbed for various kinds of network queries, search problems in particular. We explore the use of logic frameworks to investigate such results; in particular, we show that whenever a winning condition for either player can be expressed as a certain kind of formula in first-order logic, that player almost always wins. In the process, we obtain more insight into the logic-game connection from the zero-one law perspective.
Keywords
Cite
@article{arxiv.2511.22387,
title = {Are Large Random Graphs Always Safe to Hide?},
author = {Sourav Chakraborty and Sujata Ghosh and Smiha Samanta},
journal= {arXiv preprint arXiv:2511.22387},
year = {2025}
}
Comments
In Proceedings TARK 2025, arXiv:2511.20540