Timeline for Probability of seeing m nonzero bits in off any d consecutive bits in a circle of n bits
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 1, 2013 at 5:14 | comment | added | ofer zeitouni | As I wrote in my answer: the method is the same as in the papers I quoted, at least if k is a fraction of n or if it goes to zero with n as in the second reference (fluctuations in k will not destroy the method, which uses Chen-Stein). You can also easily de-randomize by starting with the random case, noting the monotonicity in $k$ and using an a-priori estimate on the fluctuations of $k$ when it is random. | |
| Nov 1, 2013 at 2:22 | comment | added | Abhijit | k is not random but given. I mean I intend to get the joint or conditional distribution with k. | |
| Oct 30, 2013 at 2:54 | history | answered | ofer zeitouni | CC BY-SA 3.0 |