Timeline for What's the correct way to simulate a division winner?
Current License: CC BY-SA 3.0
5 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Sep 9, 2014 at 17:11 | vote | accept | Heisenberg | ||
Sep 9, 2014 at 14:46 | comment | added | whuber♦ |
To answer the question in the title, consider using rmultinom(1, 10^5, rep(1,4))) to count the number of times each of four teams will be the division winner in 10^5 independent simulations. The execution of this simulation is practically instantaneous and it scales beautifully (although for more than 2^31-1 iterations you would have to make multiple calls to this function and sum the results: do so by increasing its first argument).
|
|
Sep 9, 2014 at 14:31 | history | edited | Heisenberg |
edited tags
|
|
Sep 9, 2014 at 12:30 | answer | added | swmo | timeline score: 4 | |
Sep 9, 2014 at 3:08 | history | asked | Heisenberg | CC BY-SA 3.0 |