Mobile Geometric Graphs: Detection, Coverage and Percolation

Details Mobile Geometric Graphs: Detection, Coverage and Percolation Mobile Geometric Graphs: Detection, Coverage and Percolation

2010-07-31

arxiv.org/abs/1008.0075v2

Mathematics

Probability

Scientific paper

We consider the following dynamic Boolean model introduced by van den Berg, Meester and White (1997). At time 0, let the nodes of the graph be a Poisson point process in R^d with constant intensity and let each node move independently according to Brownian motion. At any time t, we put an edge between every pair of nodes if their distance is at most r. We study three features in this model: detection (the time until a target point---fixed or moving---is within distance r from some node of the graph), coverage (the time until all points inside a finite box are detected by the graph), and percolation (the time until a given node belongs to the infinite connected component of the graph). We obtain precise asymptotics for these features by combining ideas from stochastic geometry, coupling and multi-scale analysis.

Affiliated with

Also associated with

No associations

Rating

Mobile Geometric Graphs: Detection, Coverage and Percolation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Mobile Geometric Graphs: Detection, Coverage and Percolation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mobile Geometric Graphs: Detection, Coverage and Percolation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-8660