Equality of the critical thresholds for three-dimensional Brownian loop soup

Let \lphac\lpha_c, \lphau\lpha_u, \lphatr\lpha_{\rm tr}, and \lphab2b\lpha_{\mathop{\rm b2b}} denote the thresholds defined in the paper for, respectively, percolation, uniqueness, truncated-model percolation, and the remaining cutoff-based phase transition. Threshold equality conjecture.

αc=αu=αtr=αb2b.\alpha_c=\alpha_u=\alpha_{\rm tr}=\alpha_{\mathop{\rm b2b}}.

The paper states that all these thresholds are believed to coincide, but this remains an open problem. In particular, proving \lphac=αu\lpha_c=\alpha_u would rule out a phase with infinitely many unbounded clusters, each dense in R3\mathbb{R}^3; a naive Burton--Keane argument does not apply because infinitely many small loops almost surely intersect the boundary of any given ball.

Sources & referencesView supporting material

Primary source

Antoine Jego and Titus Lupu, “Three-dimensional Brownian loop soup clusters”, arXiv:2601.04840 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.