Year: 2025
Type: article
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.
DOI: 10.4204/eptcs.437.26
Authors: Sourav Chakraborty, Sujata Ghosh, Smiha Samanta
Institution: Indian Statistical Institute
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4416664989
FWCI:
Cites:
Cited by:
Related to: