Firefighting on a random geometric graph

  title={Firefighting on a random geometric graph},
  author={Amir Barghi and Peter Winkler},
  journal={Random Struct. Algorithms},
Let Gλ be the graph whose vertices are points of a planar Poisson process of density λ, with vertices adjacent if they are within distance 1. A “fire” begins at some vertex and spreads to all neighbors in discrete steps; in the meantime f vertices can be deleted at each time-step. Let fλ be the least f such that, with probability 1, any fire on Gλ can be stopped in finite time. We show that fλ is bounded between two linear functions of λ. The lower bound makes use of a new result concerning… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 15 times over the past 90 days. VIEW TWEETS
3 Citations
12 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 12 references


  • B. Bollobás, O. Riordan
  • Cambridge University Press, New York, NY
  • 2006
1 Excerpt

Catching the Fire on Grids

  • P. Fogarty
  • M.Sc. Thesis
  • 2003
1 Excerpt

Fire Control on Graphs

  • S. A. Moeller, P. Wang
  • Journal of Combinatorial Mathematics and…
  • 2002
1 Excerpt

Firefighter! An Application of Domination

  • B. L. Hartnell
  • presentation at the Twentieth Conference on…
  • 1995
2 Excerpts

Upper Bound on Poisson Tail Probabilities

  • P. W. Glynn
  • Operation Research Letters, Vol. 6
  • 1987
1 Excerpt

Über den Medien der Binomial- und Poissonverteilung (in German)

  • P. Neumann
  • Wissenschaftliche Zeitschrift der Technischen…
  • 1966
1 Excerpt

Similar Papers

Loading similar papers…