Campus Event Calendar
Event Entry
What and Who
Detection and Percolation in Mobile Geometric Graphs
Alexandre Stauffer
UC Berkeley
AG1 Mittagsseminar (own work)
AG 1
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Friday, 17 December 2010
13:00
30 Minutes
E1 4
024
Saarbrücken
Abstract
Motivated by mobile wireless networks we consider a random graph over R^2, where nodes are given by a Poisson point process and 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.)
Contact
Tobias Friedrich
--email hidden
passcode not visible
logged in users only
Tobias Friedrich, 11/12/2010 12:24 -- Created document.