Specialist Cops Catching Robbers on Complex Networks

Arora, S and Jain, Abhishek and Panduranga rao, M V and et al, . (2018) Specialist Cops Catching Robbers on Complex Networks. In: Complex Networks and Their Applications VII. Studies in Computational Intelligence, 812 (812). Springer, Cham, pp. 731-742. ISBN 978303005416

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

Abstract

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
Item Type: Book Section
Uncontrolled Keywords: Complex networks,Cops and Robbers on graphs,Statistical model checking,Indexed in Scopus
Subjects: Computer science
Divisions: Department of Computer Science & Engineering
Depositing User: Library Staff
Date Deposited: 28 Oct 2019 09:46
Last Modified: 28 Oct 2019 09:46
URI: http://raiith.iith.ac.in/id/eprint/6866
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 6866 Statistics for this ePrint Item