Connectivity of the adjacency graph of complementary components of the SLE fan
Cillian Doherty, Konstantinos Kavvadias, and Jason Miller

TL;DR
This paper proves that the adjacency graph of the components formed by the Gaussian free field flow lines is almost surely connected and that the flow lines are uniquely determined by their fan configuration.
Contribution
It establishes the almost sure connectivity of the adjacency graph of GFF flow line components and shows the fan uniquely determines the individual flow lines.
Findings
The adjacency graph of components is almost surely connected.
The flow line fan uniquely determines each flow line.
Flow lines are almost surely determined by the fan configuration.
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 ${\mathbf…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Graph Labeling and Dimension Problems · Advanced Graph Theory Research
