This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
en:group:seminars:20101214 [2010/11/16 13:21] maatouk |
en:group:seminars:20101214 [2016/06/23 11:26] (current) |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ---- dataentry seminar ---- | ---- dataentry seminar ---- | ||
| date_dt : 2010-12-14 | date_dt : 2010-12-14 | ||
| - | title : TBA | + | title : Detection and Percolation in Mobile Geometric Graphs |
| speaker : Alexandre Stauffer | speaker : Alexandre Stauffer | ||
| affiliation : UC Berkeley. | affiliation : UC Berkeley. | ||
| Line 13: | Line 13: | ||
| ==== abstract ==== | ==== abstract ==== | ||
| - | TBA | + | Motivated by mobile wireless networks we consider a random graph over |
| + | R^2, where nodes perform independent Brownian motions and edges are | ||
| + | kept between pairs of nodes within distance r of each other. Combining | ||
| + | ideas from stochastic geometry, coupling and | ||
| + | multi-scale analysis, we obtain precise asymptotics for detection (the | ||
| + | time until a given target is within distance r to some node of the | ||
| + | graph) and percolation (the time until a given node belongs to the | ||
| + | infinite connected component of the graph). | ||
| + | (This is a joint work with Yuval Peres, Alistair Sinclair and Perla Sousi.) | ||