English

Tripod in uniform spanning tree and three-sided radial SLE$_2$

Probability 2025-11-17 v1

Abstract

Fix a bounded 33-polygon (Ω;x1,x2,x3)(\Omega; x_1, x_2, x_3) with three marked boundary points x1,x2,x3Ωx_1, x_2, x_3\in\partial\Omega and suppose (Ωδ;x1δ,x2δ,x3δ)(\Omega^{\delta}; x_1^{\delta}, x_2^{\delta}, x_3^{\delta}) is an approximation of (Ω;x1,x2,x3)(\Omega; x_1, x_2, x_3) on δ\delta-scaled hexagonal lattice. We consider uniform spanning tree (UST) in Ωδ\Omega^{\delta} with wired boundary conditions. Conditional on the event that both branches from x1δx_1^{\delta} and x2δx_2^{\delta} hit the boundary through x3δx_3^{\delta}, the two branches meet at a point tδ\mathfrak{t}^{\delta} which we call trifurcation, and the union of the three branches from xjδx_j^{\delta} to tδ\mathfrak{t}^{\delta} form a tripod in the UST. We compute the scaling limit of the tripod: the distribution of trifurcation is absolutely continuous with respect to Lebesgue measure with explicit density; given the trifurcation, the conditional law of the tripod is three-sided radial SLE2_2. Interestingly, the scaling limit of the observable for trifurcation coincides with the partition function for three-sided radial SLE2_2. The proof for the distribution of the trifurcation relies on Fomin's formula [Fom01] and tools from [CS11, CW21]. The proof of the convergence to three-sided radial SLE2_2 relies on tools developped recently from [HPW25]. We believe the conclusion is true for a large family of discrete lattice approximations, however, our proof uses the geometry of the hexagonal lattice in an essential way.

Keywords

Cite

@article{arxiv.2511.11151,
  title  = {Tripod in uniform spanning tree and three-sided radial SLE$_2$},
  author = {Jiacheng Ding and Mingchang Liu and Hao Wu},
  journal= {arXiv preprint arXiv:2511.11151},
  year   = {2025}
}

Comments

53pages, 8 figures

R2 v1 2026-07-01T07:37:13.463Z