Pith. sign in

REVIEW 1 cited by

Parity questions in critical planar Brownian loop-soups (or "where did the free planar bosons go?")

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.07830 v2 pith:WBCK565J submitted 2024-03-12 math.PR math-phmath.MP

classification math.PRmath-phmath.MP
keywords loop-souploopsbrownianfieldfieldsplanarbosonscollection
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The critical two-dimensional Brownian loop-soup is an infinite collection of non-interacting Brownian loops in a planar domain that possesses some combinatorial features related to the notion of indistinguishability of bosons. The properly renormalized occupation time field of this collection of loops is known to be distributed like the properly defined square of a Gaussian free field. In the present paper, we investigate aspects of the question about how much information these fields provide about the loop-soup. Among other things, we show that the exact set of points that are actually visited by some loops in the loop-soup is not determined by these fields. We further prove that given the fields, a dense family of special points will each have a conditional probability 1/2 of being part of the loop-soup. We also exhibit another instance where the possible decompositions (given the field) into individual loops and excursions can be grouped into two clearly different groups, each having a conditional probability 1/2 of occurring.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A switching identity for cable-graph loop soups and Gaussian free fields

    math.PR 2025-02 accept novelty 8.0 of 10

    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.

Pith tools