Answers are grounded in this paper and cite their sources.
We study the critical Brownian loop soup on the metric graph Zᵈ. Using a new unified approach, we determine the one-arm probability up to multiplicative constants in all dimensions d≥3. In particular, at the upper critical dimension dc=6, we show that the one-arm probability is comparable to r⁻²(log r)¹², and moreover, with high probability a box of radius r contains on the order of log r macroscopic clusters, each with volume of order r⁴(log r)⁻¹². For d≠6, we recover the one-arm estimates of Cai and Ding, r-(d-2)/2 for $d=3,4,5$ and r⁻² for $d>6$ (arXiv:2406.02397; Probab. Theory Relat. Fields, 2025), and the three-dimensional estimate of Drewitz, Prévost and Rodriguez (Probab. Theory Relat. Fields, 2026). Our proof adapts the entropy method of Dewan and Muirhead (Probab. Theory Relat. Fields, 2023) to the loop-soup setting. This yields a renormalization inequality for the one-arm probability, from which we derive the upper bounds. Independently, Rodriguez, Shi, and Zhang (arXiv:2611.05357) have recently used a closely related entropy approach to recover the one-arm estimates for $d>6$ and improve the upper bound for $d=6$. They also announce the same sharp one-arm estimate for $d=6$ in forthcoming work.
No takes yet. Share an insight, caveat, or question.
Yifan Gao (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: