Publication

Multiplicative chaos of the Brownian loop soup

Abstract

We construct a measure on the thick points of a Brownian loop soup in a bounded domain DDD of the plane with given intensity theta>0θ>0\theta >0, which is formally obtained by exponentiating the square root of its occupation field. The measure is constructed via a regularisation procedure, in which loops are killed at a fix rate, allowing us to make use of the Brownian multiplicative chaos measures previously considered in Aidekon et al. (Ann. Probab. 48 (2020), no. 4, 1785-1825), Bass et al. (Ann. Probab. 22 (1994), no. 2, 566-625) and Jego (Ann. Probab. 48 (2020), no. 4, 1597-1643), or via a discrete loop soup approximation. At the critical intensity theta=1/2θ=1/2\theta = 1/2, it is shown that this measure coincides with the hyperbolic cosine of the Gaussian free field, which is closely related to Liouville measure. This allows us to draw several conclusions which elucidate connections between Brownian multiplicative chaos, Gaussian free field and Liouville measure. For instance, it is shown that Liouville-typical points are of infinite loop multiplicity, with the relative contribution of each loop to the overall thickness of the point being described by the Poisson-Dirichlet distribution with parameter theta=1/2θ=1/2\theta = 1/2. Conversely, the Brownian chaos associated to each loop describes its microscopic contribution to Liouville measure. Along the way, our proof reveals a surprising exact integrability of the multiplicative chaos associated to a killed Brownian loop soup. We also obtain some estimates on the discrete and continuous loop soups which may be of independent interest.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.