Highly Influenced

# Firefighting on a random geometric graph

@article{Barghi2015FirefightingOA, title={Firefighting on a random geometric graph}, author={Amir Barghi and Peter Winkler}, journal={Random Struct. Algorithms}, year={2015}, volume={46}, pages={466-477} }

- Published 2015 in Random Struct. Algorithms
DOI:10.1002/rsa.20511

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

#### From This Paper

##### Figures, tables, and topics from this paper.

3 Citations

12 References

Similar Papers