Stephen Brooks 🦆 on Nostr: npub1uy9xf…ht4st npub1c9m22…z9xjd For large n, wouldn't the path wander around by ...

npub1uy9xf9yrwzh9spkq732led29dxkc72klm2xtk8gvd33uwgd9wa9sdht4st (npub1uy9…t4st) npub1c9m22hkc5h6zgrwkz48crhcpw6vch2rf6j97746ugl3neys86jeqyz9xjd (npub1c9m…9xjd) For large n, wouldn't the path wander around by O(sqrt(n)), which is also large, before getting to (3,4)? So really the paths would look "the same" but only because their wandering is much larger than the start-end distance.

If you pick start-end O(sqrt(n)) apart, that's fine, but the whole thing looks like continuous Brownian motion because sqrt(n) is large.