![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Load optimization in a planar network
Load optimization in a planar networkAdd to your list(s) Download to your calendar using vCal
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 listsRomina Vuono Cambridge University Science and Policy Exchange (CUSPE) International Cafe ScientifiqueOther talksSciBar: Sleep, Dreams and Consciousness A V HILL LECTURE - The cortex and the hand of the primate: a special relationship Perfect toposes and infinitesimal weak generation Saving the People of the Forest: one chocolate bar and one nebulizer treatment at a time Localization estimates for hypoelliptic equations Structurally unravelling ATP synthase |