I would like to perform a random walk on a J-dimensional simplex. However, since this is part of a metropolis-hastings algorithm application, my understanding is that the steps need to be drawn from a symmetric distribution (is this correct?)
I was wondering if there is a standard/established way to approach this.
Any help/pointers are greatly appreciated!
Noushin