Balancing sums of random vectors
From MaRDI portal
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.
Recommendations
- scientific article; zbMATH DE number 9390
- Balancing sets of vectors
- Balancing sets of vectors
- Balancing Gaussian vectors
- On Sums Of Independen Random Vectors
- Random Averaging of Vector Elements
- Balancing vectors in the max norm
- Comparing the distributions of sums of independent random vectors
- On the PDF of the sum of random vectors
- Random sums of random variables and vectors: including infinite means and unequal length sums
Cites work
- Balanced Allocations
- Balanced partitions of vector sequences
- Dynamic concentration of the triangle-free process
- How asymmetry helps load balancing
- Multicolour Discrepancies
- On the Power of Linear Dependencies
- On-line load balancing
- Parallel randomized load balancing
- Random points and lattice points in convex bodies
- Random triangle removal
- The \((1 + {\beta})\)-choice process and weighted balls-into-bins
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The triangle-free process and the Ramsey number \(R(3,k)\)
Cited in
(5)
This page was built for publication: Balancing sums of random vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645029)
