BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Load optimization in a planar network - Bordenave\, C (Toulouse)
DTSTART:20100407T100000Z
DTEND:20100407T110000Z
UID:TALK24079@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:We will analyze the asymptotic properties of an Euclidean opti
 mization problem on the plane. Specifically\, we consider a network with 3
  bins and n objects spatially uniformly distributed\, each object being al
 located to a bin at a cost depending on its position. Two allocations are 
 considered: the allocation minimizing the bin loads and the allocation all
 ocating each object to its less costly bin. This model is motivated by iss
 ues in wireless cellular networks. We will aim at the asymptotic propertie
 s of these allocations as the number of objects grows to infinity. Using t
 he symmetries of the problem\, we will derive a law of large numbers\, a c
 entral limit theorem and a large deviation principle for both loads with e
 xplicit expressions. In particular\, we prove that the two allocations sat
 isfy the same law of large numbers\, but they do not have the same asympto
 tic fluctuations and rate functions.
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR