Mobile Geometric Graphs: Detection, Coverage and Percolation
Probability Seminar
Sep 22, 2010, 03:10 PM - 04:00 PM | 330 Evans Hall | Happening As Scheduled
Alexandre Stauffer, Computer Science Dept, U.C. Berkeley
We consider the following random graph model. At time 0, take a
Poisson point process over R^2 with constant intensity to be the
nodes of the graph and let each node move independently according to
Brownian motion. At any time t, we have an edge between every
pair of nodes for which their distance at time t is at most r. We
study three fundamental features in this model: detection (the
time...