



























Abstract:We show that the scaling limit of the random walk loop soup on suitable planar graphs is the Brownian loop soup, under a topology on multisets of unrooted, unparameterized, and macroscopic loops. The result holds assuming only convergence of simple random walk to Brownian motion, a Russo-Seymour-Welsh type crossing estimate, and the bounded density of the graphs. The proof relies on Wilson's algorithm and Schramm's finiteness theorem. Precisely, we approximate the random walk loop soup by the set of loops erased in a greedy variant of Wilson's algorithm, thereby establishing convergence. The resulting limit is identified using the result of Lawler and Trujillo Ferreras arXiv:math/0409291.
From: Yihao Pang [view email]
[v1]
Fri, 13 Mar 2026 16:53:44 UTC (58 KB)
[v2]
Tue, 21 Jul 2026 13:34:44 UTC (58 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。