Specialist Cops Catching Robbers on Complex Networks

Arora, Shiraj and Jain, Abhishek and Ramesh, Yenda and Rao, M V Panduranga (2018) Specialist Cops Catching Robbers on Complex Networks. In: 7th International Conference on Complex Networks and their Applications, COMPLEX NETWORKS, 11-13 December 2018, Cambridge, United Kingdom.

Full text not available from this repository. (Request a copy)


We study a variant of the folklore Cops and Robbers (also known as pursuit evasion) problem on graphs. In this variant, there are different specializations of cops and a minimum number of each specialization are necessary to catch a robber. To the best of our knowledge, this variant has not been investigated so far. We believe that this problem will find relevance in several domains like biological systems and epidemic response strategies. We seek to compare the ease of catching robbers executing random walks on various graphs, especially complex networks. We use Statistical Model Checking for the analysis. In this initial work, we report experiments that yield interesting results. For example, we show empirically that it is easier to catch robbers on the Barabási-Albert model, than on the Erdős-Rényi model.

[error in script]
IITH Creators:
IITH CreatorsORCiD
Rao, M V PandurangaUNSPECIFIED
Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Indexed in Scopus
Subjects: Computer science
Divisions: Department of Computer Science & Engineering
Depositing User: Library Staff
Date Deposited: 28 Oct 2019 11:38
Last Modified: 28 Oct 2019 11:38
URI: http://raiith.iith.ac.in/id/eprint/6811
Publisher URL: http://doi.org/10.1007/978-3-030-05411-3_58
Related URLs:

Actions (login required)

View Item View Item
Statistics for RAIITH ePrint 6811 Statistics for this ePrint Item