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
This is a different problem than tackled by permute currently and it pertains to the Golden Jackals example, where even though there are only 184,756 useful permutations, numPerms() will report a far higher value as we are just randomly shuffling the data with respect to the grouping variable. With sufficient data this shouldn't be a problem and potential duplicate permutations are unlikely to crop up often. However it would be useful to include this as a choice.
The text was updated successfully, but these errors were encountered:
This is related to vegan issue vegandevs/vegan#132: with class variables, several unique permutations replicate the original classes (= were permuted within the same classes). A consequence of this is that minimum possible P-value is higher than 1/(nperm+1) because some permutations necessarily replicate the original allocation. However, with unequal class sizes probabilities of shuffling within one class level varies among levels. Random permutation disregarding any classification takes care of unequal classification probabilities and also correctly shows the effect in minimum possible P-value.
I don't think this CrossValidated question answers the same problem. It tells you how to do sample(n,k) when k < n, but this does not guarantee unique groups. Moreover, R already has sample(n,k).
Assume we have six observations with factor values A,B,B,C,C,C. We have 6! = 720 permutations for six observations, but only 6!/2!/3! = 60 different combinations of these three values (A,B,C).
The distinct sequences are easily exhausted only in small data sets, but there they can be disturbing. Here a function to estimate the number of distinct sequences of vector a (presumably a factor):
Hmm, I need to revisit my thinking then; when I was playing with this for a two group example it was doing what we needed, but perhaps that was due to the simplicity of the example I was working with...?
This is a different problem than tackled by permute currently and it pertains to the Golden Jackals example, where even though there are only 184,756 useful permutations,
numPerms()
will report a far higher value as we are just randomly shuffling the data with respect to the grouping variable. With sufficient data this shouldn't be a problem and potential duplicate permutations are unlikely to crop up often. However it would be useful to include this as a choice.The text was updated successfully, but these errors were encountered: