Jego–Lupu loop-soup critical-values conjecture
For the continuum Brownian loop soup on and the corresponding random-walk and metric-graph loop soups on the discrete models considered by Jego and Lupu, the critical intensities governing the relevant cluster-percolation and one-arm transition phenomena coincide. Equivalently, there is a common critical value such that all of the critical thresholds appearing in the conjecture equal .
References
- On loop-soup clusters in three dimensions and higher — arXiv — Yifan Gao
Source: arXiv
Progress summary
A new preprint claims to prove the conjecture by showing that several loop-soup transition thresholds coincide, but no independent mathematical assessment has appeared.
The Jego–Lupu conjecture links critical thresholds for continuum and discrete loop soups and proposes a common transition picture. Earlier work by Jego, Lupu, and Qian established substantial phase-transition results but left key equalities unresolved.
Known results
- Jego, Lupu, and Qian (2025): for , the annular one-arm probability has exponent .
- The same work identifies as a second critical value for large-loop percolation, leaves behavior at unclear, and formulates a conjecture for .
October 28, 2026 claimed resolution
Yifan Gao’s preprint On loop-soup clusters in three dimensions and higher claims that uniform one-arm estimates and capacity bounds prove equality of the relevant critical values in the stated models. This is an unrefereed complete-resolution claim, with no independent verification found.
Current status (as of October 2026): The conjecture is claimed solved by Gao’s preprint, but the claim is unverified; the earlier partial results and the absence of independent assessment leave the resolution unsettled.
Sources
Solutions 0
No solutions have been posted yet.