Connectivity properties of the adjacency graph of SLE. bubbles for ..(4,8)

We study the adjacency graph of bubbles, that is, complementary connected components of a SLE. curve for ..(4,8), with two such bubbles considered to be adjacent if their boundaries intersect. We show that this adjacency graph is a.s. connected for ..(4,.0], where .0.5.6158 is defined explicitly. This gives a partial answer to a problem posed by Duplantier, Miller and Sheffield (2014). Our proof in fact yields a stronger connectivity result for ..(4,.0], which says that there is a Markovian way of finding a path from any fixed bubble to .. We also show that there is a (nonexplicit) .1.(.0,8) such that this stronger condition does not hold for ..[.1,8) . Our proofs are based on an encoding of SLE. in terms of a pair of independent ./4-stable processes, which allows us to reduce our problem to a problem about stable processes. In fact, due to this encoding, our results can be rephrased as statements about the connectivity of the adjacency graph of loops when one glues together an independent pair of so-called ./4 -stable looptrees, as studied, for example, by Curien and Kortchemski (2014). The above encoding comes from the theory of Liouville quantum gravity (LQG), but the paper can be read without any knowledge of LQG if one takes the encoding as a black box.