English

Uniform multicommodity flow in the hypercube with random edge capacities

Optimization and Control 2016-04-01 v3 Data Structures and Algorithms Combinatorics

Abstract

We give two results for multicommodity flows in the dd-dimensional hypercube Qd{Q}^d with independent random edge capacities distributed like CC where Pr[C>0]>1/2\Pr[C>0]>1/2. Firstly, with high probability as dd \rightarrow \infty, the network can support simultaneous multicommodity flows of volume close to E[C]E[C] between all antipodal vertex pairs. Secondly, with high probability, the network can support simultaneous multicommodity flows of volume close to 21dE[C]2^{1-d} E[C] between all vertex pairs. Both results are best possible.

Keywords

Cite

@article{arxiv.1406.4433,
  title  = {Uniform multicommodity flow in the hypercube with random edge capacities},
  author = {Colin McDiarmid and Alex Scott and Paul Withers},
  journal= {arXiv preprint arXiv:1406.4433},
  year   = {2016}
}

Comments

36 pages, 4 figures

R2 v1 2026-06-22T04:40:33.337Z