Pith. sign in

REVIEW 1 cited by

The stochastic Jacobi flow

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 2306.12716 v1 pith:CDK2KSHO submitted 2023-06-22 math.PR

classification math.PR
keywords flowbrownianjacobimotionprocessessabottarrcase
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

The problem of conditioning on the occupation field was investigated for the Brownian motion in 1998 independently by Aldous [4] and Warren and Yor [34] and recently for the loop soup at intensity $1/2$ by Werner [35], Sabot and Tarr\`es [30], and Lupu, Sabot and Tarr\`es [22]. We consider this problem in the case of the Brownian loop soup on the real line, and show that it is connected with a flow version of Jacobi processes, called Jacobi flow. We give a pathwise construction of this flow simultaneously for all parameters by means of a common Brownian motion, via the perturbed reflecting Brownian motion. The Jacobi flow is related to Fleming--Viot processes, as established by Bertoin and Le Gall [9] and Dawson and Li [11]. This relation allows us to interpret Perkins' disintegration theorem between Feller continuous state branching-processes and Fleming--Viot processes as a decomposition of Gaussian measures. Our approach gives a unified framework for the problems of disintegrating on the real line. The connection with Bass--Burdzy flows which was drawn in Warren [33] and Lupu, Sabot and Tarr\`es [23] is shown to be valid in the general case.

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