Balancing sums of random vectors
Probability
2018-03-13 v3 Combinatorics
Abstract
We study a higher-dimensional 'balls-into-bins' problem. An infinite sequence of i.i.d. random vectors is revealed to us one vector at a time, and we are required to partition these vectors into a fixed number of bins in such a way as to keep the sums of the vectors in the different bins close together; how close can we keep these sums almost surely? This question, our primary focus in this paper, is closely related to the classical problem of partitioning a sequence of vectors into balanced subsequences, in addition to having applications to some problems in computer science.
Cite
@article{arxiv.1610.05221,
title = {Balancing sums of random vectors},
author = {Juhan Aru and Bhargav Narayanan and Alex Scott and Ramarathnam Venkatesan},
journal= {arXiv preprint arXiv:1610.05221},
year = {2018}
}
Comments
17 pages, Discrete Analysis