Load optimization in a planar network

Details Load optimization in a planar network Load optimization in a planar network

2009-02-25

arxiv.org/abs/0902.4304v2

Mathematics

Probability

Annals of Applied Probability 2010, Vol. 20, No. 6, 2040-2085 Published in at http://dx.doi.org/10.1214/09-AAP676 the Annals o

Scientific paper

We analyze the asymptotic properties of a Euclidean optimization problem on the plane. Specifically, we consider a network with three 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. We analyze the asymptotic properties of these allocations as the number of objects grows to infinity. Using the symmetries of the problem, we 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.

Affiliated with

Also associated with

No associations

Rating

Load optimization in a planar network does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Load optimization in a planar network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Load optimization in a planar network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-157523