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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Adler, M., Räcke, H., Sivadasan, N., Sohler, C., Vöcking, B.: Randomized pursuit-evasion in graphs. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) Automata, Languages and Programming, pp. 901–912. Springer, Berlin Heidelberg, Berlin, Heidelberg (2002)
Agha, G., Palmskog, K.: A survey of statistical model checking. ACM Trans. Model. Comput. Simul. 28(1), 6:1–6, 39 (2018). https://doi.org/10.1145/3158668
Aigner, M., Fromme, M.: A game of cops and robbers. Discret. Appl. Math. 8(1), 1–12 (1984)
Alspach, B.: Searching and sweeping graphs: a brief survey. Le Matematiche 59, 5–37 (2004)
Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999). https://doi.org/10.1126/science.286.5439.509. http://science.sciencemag.org/content/286/5439/509
Chung, T.H., Hollinger, G.A., Isler, V.: Search and pursuit-evasion in mobile robotics. Auton. Robot. 31(4), 299 (2011). https://doi.org/10.1007/s10514-011-9241-4. https://doi.org/10.1007/s10514-011-9241-4
Clarke, E.M., Zuliani, P.: Statistical model checking for cyber-physical systems. In: Bultan, T., Hsiung, P.A. (eds.) Automated Technology for Verification and Analysis, pp. 1–12. Springer, Berlin Heidelberg, Berlin, Heidelberg (2011)
Cooper, C., Frieze, A., Radzik, T.: Multiple random walks and interacting particle systems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) Automata, Languages and Programming, pp. 399–410. Springer, Berlin Heidelberg, Berlin, Heidelberg (2009)
Erdős, P., Rényi, A.: On the evolution of random graphs. In: Publication of the Mathematical Institute of the Hungarian Academy of Science, pp. 17–61 (1960)
Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci. 399, 236–245 (2008)
Legay, A., Delahaye, B., Bensalem, S.: Statistical model checking: an overview. In: Barringer, H., et al. (eds.) Runtime Verification. Lecture Notes in Computer Science, vol. 6418, pp. 122–135. Springer, Berlin Heidelberg (2010)
Nimal, V.: Statistical approaches for probabilistic model checking. Ph.D. thesis, University of Oxford (2010)
Nowakowski, R., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discret. Math. 43(2–3), 235–239 (1983)
Quilliot, A.: Problemes de jeux, de point fixe, de connectivité et de représentation sur des graphes, des ensembles ordonnés et des hypergraphes, pp. 131–145. These d’Etat, Université de Paris VI pp (1983)
Sen, K., Viswanathan, M., Agha, G.: Computer Aided Verification: 16th International Conference, CAV 2004, Boston, MA, USA, 13–17 July 2004. Proceedings, chap. Statistical Model Checking of Black-Box Probabilistic Systems, pp. 202–215. Springer Berlin Heidelberg, Berlin, Heidelberg (2004)
Sen, K., Viswanathan, M., Agha, G.: On statistical model checking of stochastic systems. In: 17th Intlernational Conference on Computer Aided Verification, CAV 2005, Edinburgh, Scotland, UK, 6–10 July 2005, pp. 266–280 (2005)
Wald, A.: Sequential tests of statistical hypotheses. Ann. Math. Stat. 16(2), 117–186 (1945)
Younes, H.L.: Verification and planning for stochastic processes with asynchronous events. Technical report, Carnegie-Mellon University (2005)
Younes, H.L.S., Simmons, R.G.: Probabilistic verification of discrete event systems using acceptance sampling. In: 14th International Conference on Computer Aided Verification, CAV 2002, Copenhagen, Denmark, 27–31 July 2002, pp. 223–235 (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Arora, S., Jain, A., Ramesh, Y., Panduranga Rao, M.V. (2019). Specialist Cops Catching Robbers on Complex Networks. In: Aiello, L., Cherifi, C., Cherifi, H., Lambiotte, R., Lió, P., Rocha, L. (eds) Complex Networks and Their Applications VII. COMPLEX NETWORKS 2018. Studies in Computational Intelligence, vol 812. Springer, Cham. https://doi.org/10.1007/978-3-030-05411-3_58
Download citation
DOI: https://doi.org/10.1007/978-3-030-05411-3_58
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-05410-6
Online ISBN: 978-3-030-05411-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)