1 / 32

Randomized Algorithms CS648

Randomized Algorithms CS648. Lecture 22 Chebyshev Inequality Method of Bounded Difference. Chernoff Bound . Theorem : Suppose be independent Bernoulli random variables with parameters , that is, takes value 1 with probability and 0 with probability . Let and . For any ,

italia
Télécharger la présentation

Randomized Algorithms CS648

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Randomized AlgorithmsCS648 Lecture 22 ChebyshevInequality Method of Bounded Difference

  2. ChernoffBound Theorem : Suppose be independent Bernoulli random variables with parameters , that is, takes value 1 with probability and 0 with probability . Let and . For any , Limitations: • Works only for bounding sum of random variables. • Requires independence among .

  3. Three examples to illustrate the inapplicability of chernoff bound

  4. Red-blueballs out of bin Randomized Experiment: There are red and blue balls in a bag. We take out balls from the bag uniformly randomly and without replacement. : no. of red balls in the sample. Aim: To show is concentrated around . Question: Can we apply Chernoff bound ? Answer: NO because’s are NOT independent.

  5. Balls into Bins(number of empty bins) 1 2 3 4 5 … m-1 m : random variable denoting the number of empty bins.  [] Aim: To show that is concentrated around . Question: Can we apply Chernoff bound ? Answer: NO because’s are NOT independent. for 1 2 3 … … n

  6. Number of Triangles in a random graph : A graph on vertices where each edge is present with probability independent of others. : random variable denoting the number of triangles. • [] Aim: To show that is concentrated around . Question: Can we apply Chernoff bound ? Answer: NO because’s are NOT independent. for

  7. Chebyshev’s inequality

  8. Chebyshev’s inequality Let be a random variable defined over a probability space. Question: How to capture deviation of from ? Define Question: What is ? Answer: Redefine Question: What is ? Answer: Called variance of

  9. Chebyshev’s inequality Let be a random variable defined over a probability space. Applying Markov Inequality, Limitations: • Calculating is sometimes difficult. • Usually gives bounds that are better than Markov Inequality but inferior to the bound achieved by other methods. • Simple practice problems will be given to you on the use of Chebyshev Inequality.

  10. The most powerful method for bounding the probability of deviation of a random variable from expected value Method Of Bounded Difference (MOBD)

  11. The Power of MOBD • Tightest bound for Randomized Quick Sortwas derived using MOBD. : number of comparisons during randomized quick sort on elements. • MOBD subsumes Chernoffbound. • Based on theory of Martingales. Note: Proof similar and almost as hard as the proof of Chernoff bound. [Not part of the course]

  12. Notations : a sequence of random variables. be a function of random variables. Objective: to achieve a bound on the probability of deviation of from. = ? Notations: “” means “”

  13. A new perspective The value of is well defined once the values taken by is exposed. View the process of exposing the values of happening gradually in steps. • In the beginning, when none of the is revealed, all we can say about value of is that its expected value is . • In first step, is exposed. If takes value , all we can say about value of is that its expected value is . • In second step, is also exposed. If takes value , all we can say about value of is that its expected value is . … The next slide will give a visual description of the process mentioned above. But ponder over this slide before pressing the next button.

  14. The value of and the gradual exposition of ’s Examples to illustrate the meaning of Algorithm : Quick sort : no. of comparisons during quick sort on elements. : Given first pivot elements, the expected number of comparisons during quick sort on elements. … … … … …

  15. The value of and the gradual exposition of ’s Examples to illustrate the meaning of Stochastic Process : Ball-Bin problem : no. of empty bins : Given the destination of first balls, the expected number of empty bins. … … … … …

  16. Gradual exposition of ’s Examples to illustrate the meaning of Random Structure : Random graph : no. of triangles in : Given the presence/absence of edges, the expected number of triangles in the random graph. … … … … …

  17. The Intuition underlying MOBD

  18. Method of Bounded Difference … … … … …

  19. Method of Bounded Difference For any , and any ,, if if is small, then Most probably will be close to . Think for a while over the above statement before proceeding further. … … … … …

  20. Method of Bounded Difference - I Theorem 1: If there are positive numbers ’s such that for any , and any ,, Then Note: In order to get a meaningful bound using Therem1, you must have small’s . … … … … …

  21. Method of Bounded Difference - II Definition: function is said to satisfy Lipschitz condition with parameters ’s if For all , that differ only at th coordinate. Theorem 2: If satisfies Lipschitz condition and are independent, then Remark: This form is easiest to use but requires independence.

  22. MOBD SubsumesChernoffBound

  23. MOBD subsumesChernoff Bound are 0-1 independent random variables. • satisfies Lipschitz condition with parameters Hence applying Theorem 2 for for

  24. problem 1No. of Emptybins

  25. Balls into Bins(number of empty bins) 1 2 3 4 5 … n-1 n : random variable denoting the number of balls in th bin. : number of empty bins. Observation: takes value in range [,]. Question: What is s.t. for any given ,? Answer: For ,, This will give very inferior bound 1 2 3 … … n

  26. Balls into Bins(number of empty bins) 1 2 3 4 5 … n-1 n : random variable denoting the destination of th ball. : number of empty bins. Observation: • are independent. • satisfies Lipschitz condition with parameters Hence We failed because our choice of random variables for defining was bad. Can you think of other random variables such that is a function of them ? 1 2 3 … … n for

  27. Balls into Bins(number of empty bins) Theorem: If balls are thrown r.u.i. into bins, thenthe number of empty bins will be within range with probability at least . Lesson to be learnt from this exercise: Be careful in selecting the base random variables used in defining .

  28. problem 2Red-blueballs out of bin

  29. Red-blueballs out of bin Randomized Experiment: There are red and blue balls in a bag. We take out balls from the bag uniformly randomly and without replacement. : no. of red balls in the sample. Observation: are not independent • Can apply Theorem 1 only. Question: What is s.t. for any given, ?

  30. Red-blueballs out of bin balls th ball Let has red balls.  Applying Theorem 1 … … … for

  31. Red-blueballs out of bin Theorem: There are red and blue balls in a bag. Suppose we take out balls from the bag uniformly randomly and without replacement. The number of red balls in the sample is within range with probability at least .

  32. Do it as exercise. This problem will also be posted in practice sheet. problem 3No. of Triangles inRandom graph

More Related