Applications of Chernoff Bound
Chernoff bounds have very useful applications in set balancing and packet routing in sparse networks.
The set balancing problem arises while designing statistical experiments. Typically while designing a statistical experiment, given the features of each participant in the experiment, we need to know how to divide the participants into 2 disjoint groups such that each feature is roughly as balanced as possible between the two groups. Refer to this book section for more info on the problem.
Chernoff bounds are also used to obtain tight bounds for permutation routing problems which reduce network congestion while routing packets in sparse networks. Refer to this book section for a thorough treatment of the problem.
Read more about this topic: Chernoff Bound
Famous quotes containing the word bound:
“We that are bound by vows and by promotion,
With pomp of holy sacrifice and rites,
To teach belief in good and still devotion,
To preach of heaven’s wonders and delights—
Yet, when each of us in his own heart looks,
He finds the God there far unlike his books.”
—Fulke Greville (1554–1628)