Conditioning two cable-graph points to lie in the same Brownian loop-soup cluster adds an odd-numbered Poisson cloud of Brownian excursions between them, yielding an exact law for the conditional cluster and its GFF analogue.
Cluster explorations of the loop soup on a metric graph related to the Gaussian free field
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We consider the loop soup at intensity ${1\over 2}$ conditioned on having local time $0$ on a set of vertices with positive occupation field in their vicinities. We give a relation between this loop soup and the usual loop soup conditioned on its local times. We deduce a domain Markov property for the loop soup, in the vein of the discrete Markov property proved by Werner: when exploring a cluster, the bridges outside the cluster form a Poisson point process. We show how it is related to the property due to Le Jan that the local times of the loop soup are distributed as the squares of a Gaussian free field. Finally, our results naturally give the law of the loop soup conditioned on its occupation field via Fleming--Viot processes. The discrete analog of this question was addressed by Werner in terms of the random current model, and by Lupu, Sabot and Tarr\`es by means of a self-interacting process.
citation-role summary
citation-polarity summary
fields
math.PR 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
A switching identity for cable-graph loop soups and Gaussian free fields
Conditioning two cable-graph points to lie in the same Brownian loop-soup cluster adds an odd-numbered Poisson cloud of Brownian excursions between them, yielding an exact law for the conditional cluster and its GFF analogue.