Timeline for Why sum of samples without replacement is more concentrated than with replacement?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 17, 2023 at 11:23 | comment | added | Dotman | In this case does this mean that I can apply concentration inequalities for with replacement (like chernoff bounds) for the case without replacement, just based on the variance inequality? I know that in "Probability Inequalities for Sums of Bounded Random Variables" Theorem 4 Hoeffding proved that you can use them but the proof was not based on the variance inequality. | |
| Feb 1, 2017 at 11:56 | history | edited | Carlo Beenakker | CC BY-SA 3.0 |
added 24 characters in body
|
| Feb 1, 2017 at 11:34 | history | answered | Carlo Beenakker | CC BY-SA 3.0 |