Timeline for Concentration bound for sum of indicators of maximum value of k combinations
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 16, 2021 at 15:21 | history | edited | Iosif Pinelis |
edited tags
|
|
| Dec 12, 2021 at 21:56 | vote | accept | bolzano | ||
| Dec 12, 2021 at 8:33 | answer | added | Iosif Pinelis | timeline score: 1 | |
| Dec 12, 2021 at 2:35 | answer | added | Iosif Pinelis | timeline score: 1 | |
| Dec 11, 2021 at 7:11 | comment | added | mike | It seems to me that the sum should expressible simple in terms of the number of r.v.s > t, for example, if n=10 , k=5, and there are 2 r.v.s > t then in order not to get a max > t, you have to draw all your samples from the 8 r.v.s < t, and the sum is $10 \choose 5 - 8 \choose 5$ | |
| Dec 10, 2021 at 21:42 | history | asked | bolzano | CC BY-SA 4.0 |