Timeline for A fast algorithm for a probabilistic counting problem without replacement?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 22, 2021 at 12:05 | vote | accept | Simd | ||
| Apr 18, 2021 at 8:10 | answer | added | Brendan McKay | timeline score: 2 | |
| Apr 17, 2021 at 19:36 | history | edited | Simd | CC BY-SA 4.0 |
added 128 characters in body
|
| Apr 17, 2021 at 19:33 | comment | added | Simd | @MaxAlekseyev Yes. After every integer is sampled the probability of the remaining integers will of course have to be scaled to make them add to one. | |
| Apr 17, 2021 at 19:12 | comment | added | Max Alekseyev | Do you mean probability proportional to $p_i$ rather than equal to $p_i$? Even if initially we have $\sum_i p_i=1$ after the first sampling the sum of the remaining $p_i$ will not be 1 anymore. | |
| Apr 17, 2021 at 7:57 | review | First posts | |||
| Apr 17, 2021 at 8:18 | |||||
| Apr 17, 2021 at 7:55 | history | edited | Francesco Polizzi | CC BY-SA 4.0 |
added 15 characters in body
|
| Apr 17, 2021 at 6:49 | history | asked | Simd | CC BY-SA 4.0 |