This post is intended in a similar direction to an earlier one Can I use Compile to speed up InverseCDF? . I now wish to generate uniform points in an $n$-simplex (specifically $n=8$), making use of the indicated "golden-ratio" generalization procedure of Martin Roberts for a low-discrepancy sequence of points in the hypercube $[0,1]^{n+1}$.
I take it that now instead of the command
P = InverseCDF[NormalDistribution[0, 1], T] in the earlier post (where T is the (n+1)-vector of real numbers in the hypercube), I could replace NormalDistribution by GammaDistribution (and then normalize $P$ to sum to 1).
Then, what pair of parameters (one of them should be 1) should be employed in the argument of GammaDistribution?
Or is there a more appropriate/obvious approach to utilizing the Roberts methodology? (Might DirichletDistribution be employed?)
I see that there is a good deal of related discussion on this site Uniformly distributed n-dimensional probability vectors over a simplex