Multiple points on the boundaries of Brownian loop-soup clusters
Abstract
For a Brownian loop soup with intensity c∈(0,1] in the unit disk, we show that almost surely, the set of simple (resp. double) points on any portion of boundary of any of its clusters has Hausdorff dimension 2-c(2) (resp. 2-c(4)), where c(k) is the generalized disconnection exponent computed in arxiv:1901.05436. As a consequence, when the dimension is positive, such points are a.s. dense on every boundary of every cluster. There are a.s. no triple points on the cluster boundaries. As an intermediate result, we establish a separation lemma for Brownian loop soups, which is a powerful tool for obtaining sharp estimates on non-intersection and non-disconnection probabilities in the setting of loop soups. In particular, it allows us to define a family of generalized intersection exponents c(k, λ), and show that c(k) is the limit as λ 0 of c(k, λ).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.