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:
“When you think of the huge uninterrupted success of a book like Don Quixote, you’re bound to realize that if humankind have not yet finished being revenged, by sheer laughter, for being let down in their greatest hope, it is because that hope was cherished so long and lay so deep!”
—Georges Bernanos (1888–1948)