You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The pvalue to never be exactly 0 in permutations (because observed data belong to permutation set). There are multiple ways to do it
Obv. the first one is the simplest one, (does it reduce to adding 1/(nperm+1) to your p-value ?)
But isn't there a julia library for permutation tests? That would be even more versatile. I am also asking, because there are several methods to try to estimate the tails of permutation distributions, in order to reduce the number of permutations needed. Maybe those are already implemented there as well
The pvalue to never be exactly 0 in permutations (because observed data belong to permutation set). There are multiple ways to do it
![grafik](https://user-images.githubusercontent.com/10183650/108119294-dcb6a380-709f-11eb-946d-897c884690b9.png)
Obv. the first one is the simplest one, (does it reduce to adding 1/(nperm+1) to your p-value ?)
But isn't there a julia library for permutation tests? That would be even more versatile. I am also asking, because there are several methods to try to estimate the tails of permutation distributions, in order to reduce the number of permutations needed. Maybe those are already implemented there as well
Originally posted by @behinger in #12 (comment)
The text was updated successfully, but these errors were encountered: