|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Load optimization in a planar network
If you have a question about this talk, please contact Mustapha Amrani.
Stochastic Processes in Communication Sciences
We will analyze the asymptotic properties of an Euclidean optimization problem on the plane. Specifically, we consider a network with 3 bins and n objects spatially uniformly distributed, each object being allocated to a bin at a cost depending on its position. Two allocations are considered: the allocation minimizing the bin loads and the allocation allocating each object to its less costly bin. This model is motivated by issues in wireless cellular networks. We will aim at the asymptotic properties of these allocations as the number of objects grows to infinity. Using the symmetries of the problem, we will derive a law of large numbers, a central limit theorem and a large deviation principle for both loads with explicit expressions. In particular, we prove that the two allocations satisfy the same law of large numbers, but they do not have the same asymptotic fluctuations and rate functions.
This talk is part of the Isaac Newton Institute Seminar Series series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsBiological Anthropology Lent Term Seminars 2013 mechanics Perspectives on Inclusive and Special Education
Other talks“Variability in Psychological Reactivity: Vulnerability, Differential Susceptibility, or Vantage Sensitivity?” The Oldest Illustrated Book in Cambridge - a Reconsideration of the St Augustine Gospels To be announced To be announced What's happening to the world? 'Holocaust Anxiety in Philip Roth's Portnoy's Complaint' - Brett Ashley Kaplan