Connectivity of the adjacency graph of complementary components of the SLE fan
Probability
2024-11-21 v1
Abstract
Suppose that is an instance of the Gaussian free field (GFF) on a simply connected domain and are distinct. Fix and for each let be the flow line of from to . Recall that for the fan of flow lines of from to is the closure of the union of as varies in any fixed countable dense subset of . We show that the adjacency graph of components of is a.s. connected, meaning it a.s. holds that for every pair of components there exist components so that , , and for each . We further show that a.s. determines the flow lines used in its construction. That is, for each we prove that is a.s. determined by as a set.
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