Abstract
Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n,p) random graphs to include random power law graphs. We investigate asymptotic results for the game of Cops and Robber played on G(w) and G(n,p). Under mild conditions on the degree sequence w, an asymptotic lower bound for the cop number of G(w) is given. We prove that the cop number of random power law graphs with n vertices is asymptotically almost surely Θ(n). We derive concentration results for the cop number of G(n,p) for p as a function of n.
The authors gratefully acknowledge support from NSERC and MITACS.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aigner, M., Fromme, M.: A game of cops and robbers. Discrete Applied Mathematics 8, 1–12 (1984)
Alspach, B.: Sweeping and searching in graphs: a brief survey. Matematiche 59, 5–37 (2006)
Bonato, A., Hahn, G., Wang, C.: The cop density of a graph. Contributions to Discrete Mathematics (accepted)
Bollobás, B.: Random Graphs. Cambridge University Press, Cambridge (2001)
Chung, F.R.K., Lu, L.: The average distance in a random graph with given expected degrees. Internet Mathematics 1, 91–114 (2006)
Chung, F.R.K., Lu, L.: Complex graphs and networks. American Mathematical Society, U.S.A. (2006)
Cooper, C., Klasing, R., Zito, M.: Lower bounds and algorithms for dominating sets in web graphs. Internet Mathematics 2, 275–300 (2005)
Janson, S., Łuczak, T., Ruciński, A.: Random Graphs. Wiley, New York (2000)
Nowakowski, R., Winkler, P.: Vertex to vertex pursuit in a graph. Discrete Mathematics 43, 230–239 (1983)
Quilliot, A.: Jeux et pointes fixes sur les graphes, Ph.D. Dissertation, Université de Paris VI (1978)
Wieland, B., Godbole, A.P.: On the domination number of a random graph. The Electronic Journal of Combinatorics 8 #R37 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bonato, A., Prałat, P., Wang, C. (2007). Vertex Pursuit Games in Stochastic Network Models. In: Janssen, J., Prałat, P. (eds) Combinatorial and Algorithmic Aspects of Networking. CAAN 2007. Lecture Notes in Computer Science, vol 4852. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77294-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-77294-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77293-4
Online ISBN: 978-3-540-77294-1
eBook Packages: Computer ScienceComputer Science (R0)