题目：Uniform spanning forests on biased d-dimensional integer lattice
报告人: 向开南（教授，南开大学）
时间：6月28日9：00一10：00
地点：数学院楼425
摘要：We prove that the uniform spanning forest associated with the biased random walk on d-dimensional integer lattice has finitely many trees if and only if d<4; which is a novel phase transition phenomenon. The talk is based on a joint work with Vladas Sidoravicius (NYU-Shanghai), Zhan Shi (Paris VI Univ.), He Song (宋贺, 泰州学院) and Longmin Wang (王龙敏, 南开大学).
