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 must remember when we speak of the “negativism” of the toddler that this is also the child who is intoxicated with the discoveries of the second year, a joyful child who is firmly bound to his parents and his new-found world through ties of love. The so-called negativism is one of the aspects of this development, but under ordinary circumstances it does not become anarchy. It’s a kind of declaration of independence, but there is no intention to unseat the government.”
—Selma H. Fraiberg (20th century)