English

Connectivity of the adjacency graph of complementary components of the SLE fan

Probability 2024-11-21 v1

Abstract

Suppose that hh is an instance of the Gaussian free field (GFF) on a simply connected domain DCD \subseteq {\mathbf C} and x,yDx,y \in \partial D are distinct. Fix κ(0,4)\kappa \in (0,4) and for each θR\theta \in {\mathbf R} let ηθ\eta_\theta be the flow line of hh from xx to yy. Recall that for θ1<θ2\theta_1 < \theta_2 the fan F(θ1,θ2){\mathbf F}(\theta_1,\theta_2) of flow lines of hh from xx to yy is the closure of the union of ηθ\eta_\theta as θ\theta varies in any fixed countable dense subset of [θ1,θ2][\theta_1,\theta_2]. We show that the adjacency graph of components of DF(θ1,θ2)D \setminus {\mathbf F}(\theta_1,\theta_2) is a.s. connected, meaning it a.s. holds that for every pair U,VU,V of components there exist components U1,,UnU_1,\ldots,U_n so that U1=UU_1 = U, Un=VU_n = V, and UiUi+1\partial U_i \cap \partial U_{i+1} \neq \emptyset for each 1in11 \leq i \leq n-1. We further show that F(θ1,θ2){\mathbf F}(\theta_1,\theta_2) a.s. determines the flow lines used in its construction. That is, for each θ[θ1,θ2]\theta \in [\theta_1,\theta_2] we prove that ηθ\eta_\theta is a.s. determined by F(θ1,θ2){\mathbf F}(\theta_1,\theta_2) as a set.

Keywords

Cite

@article{arxiv.2411.13133,
  title  = {Connectivity of the adjacency graph of complementary components of the SLE fan},
  author = {Cillian Doherty and Konstantinos Kavvadias and Jason Miller},
  journal= {arXiv preprint arXiv:2411.13133},
  year   = {2024}
}

Comments

66 pages, 15 figures