Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: An anti-incursion algorithm for unknown probabilistic adversaries on
  connected graphs   A gambler moves on the vertices $1, \ldots, n$ of a graph using the
probability distribution $p_{1}, \ldots, p_{n}$. A cop pursues the gambler on
the graph, only being able to move between adjacent vertices. What is the
expected number of moves that the gambler can make until the cop catches them?
  Komarov and Winkler proved an upper bound of approximately $1.97n$ for the
expected capture time on any connected $n$-vertex graph when the cop does not
know the gambler's distribution. We improve this upper bound to approximately
$1.95n$ by modifying the cop's pursuit algorithm.

22
The categories of this paper are: chao-dyn
8
The categories of this paper are: hep-ex
23
The categories of this paper are: solv-int
31
The categories of this paper are: ao-sci
34
The categories of this paper are: chem-ph
27
The categories of this paper are: comp-gas
16
The categories of this paper are: stat
32
The categories of this paper are: atom-ph
21
The categories of this paper are: adap-org
3
The categories of this paper are: physics
4
The categories of this paper are: cond-mat
11
The categories of this paper are: hep-lat
10
The categories of this paper are: q-bio
7
The categories of this paper are: hep-th
18
The categories of this paper are: econ
12
The categories of this paper are: nucl-th