Timeline for What makes a good permutation table?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 5 at 20:56 | comment | added | U. Windl | I had similar experience when generating a random permutation. I had a look, and if I did not like the result, I re-shuffled. However that's no longer random then: If you have additional requirements (like not too many sequential numbers), it's actually not as "random" as it seems. | |
| Jan 25, 2016 at 13:09 | answer | added | Simon F | timeline score: 1 | |
| Jan 25, 2016 at 11:25 | answer | added | mhbuur | timeline score: 5 | |
| Jan 25, 2016 at 10:30 | comment | added | user2500 | Statistical tests for random number generators should be useful. Computing the expected number of in order (reverse order) pairs might be a good place to start with a test. This paper has lots of references: csrc.nist.gov/groups/ST/toolkit/rng/documents/nissc-paper.pdf. | |
| Jan 25, 2016 at 9:11 | history | edited | Martin Ender | CC BY-SA 3.0 |
added 130 characters in body
|
| Jan 25, 2016 at 9:04 | history | asked | Martin Ender | CC BY-SA 3.0 |