Poisson convergence in the restricted $k$-partioning problem
| dc.creator | Bovier, Anton | |
| dc.creator | Kurkova, Irina | |
| dc.date | 2004-09-21 | |
| dc.date.accessioned | 2026-07-07T03:00:55Z | |
| dc.date.available | 2026-07-07T03:00:55Z | |
| dc.description | The randomized $k$-number partitioning problem is the task to distribute $N$ i.i.d. random variables into $k$ groups in such a way that the sums of the variables in each group are as similar as possible. The restricted $k$-partitioning problem refers to the case where the number of elements in each group is fixed to $N/k$. In the case $k=2$ it has been shown that the properly rescaled differences of the two sums in the close to optimal partitions converge to a Poisson point process, as if they were independent random variables. We generalize this result to the case $k>2$ in the restricted problem and show that the vector of differences between the $k$ sums converges to a $k-1$-dimensional Poisson point process. | |
| dc.description | 31pp, AMSTeX | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0409532 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0409532 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/24908 | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.subject | Computational Complexity | |
| dc.subject | Probability | |
| dc.title | Poisson convergence in the restricted $k$-partioning problem | |
| dc.type | text |