






























We consider a random walk on the Manhattan lattice. The walker must follow the orientations of the bonds in this lattice, and the walker is not allowed to visit a site more than once. When both possible steps are allowed, the walker chooses between them with equal probability. The walks generated by this model are known to be related to interfaces for bond percolation on a square lattice. So it is natural to conjecture that the scaling limit is SLE$_6$. We test this conjecture with Monte Carlo simulations of the random walk model and find strong support for the conjecture.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。