A RNG problem. I'm trying to uniformly sample paths on an SW --> NE grid, of size NS > EW, via random walk. So I generate a random number between 0 and 1 and go east if r < EW/(NS+EW)... but this seems to create a bias towards denser sampling of latter half of path
Conversation
Replying to
What happens when you fix the switching value at 0.5? If you reach the eastern border you then just walk up the boundary.
1
Replying to
Then you generate a strong SE bias because and your sampling has an off-diagonal bias. That was what I did initially. Now I've fixed the diagonal bias, but not the terminal bias.
Replying to
The walk is not truly random because as you progress, the area where you have degrees of freedom decreases. So there will always be more paths in the NE corner as the walk progresses unless you allow motions that can go W and S.
1
Replying to
Yeah, it's not properly random in 2d, but probably random in a nonlinear 1d space (treating north as negative east = west).
1
Show replies

