As mathematical abstractions go, graphs are among the simplest. Scatter a bunch of points in a plane. Connect some of them with lines. That’s all a graph is. And yet they are incredibly powerful. They ...
Lawler, Schramm and Werner showed that the scaling limit of the loop-erased random walk on ℤ 2 is SLE 2 . We consider scaling limits of the loop-erasure of random walks on other planar graphs (graphs ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback