题目：Universality for the 2D Random Walk Loop Soup

报告人：庞以豪，巴黎西岱大学（Université Paris Cité）

时间：2026年7月3日（星期五）上午9: 30-10: 30

地点：东区数学新楼310教室

报告摘要：

In this talk, 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.  Preprint available at https://arxiv.org/abs/2603.13161.

报告人简介：庞以豪，巴黎西岱大学（Université Paris Cité）博士生，中法数学英才班2019级学生。