Critical curve of loop percolation on the $d$-regular tree

Abstract: We consider clusters formed by a Poisson ensemble of random walk loops on the $d$-regular tree with an intensity parameter $α>0$ and a killing parameter $κ>-1$; the latter penalizes ($κ> 0$) or favors ($κ<0$) the appearance of large loops. We obtain an implicit formula for the critical curve $κ\mapsto α_c(κ)$ for the percolation phase transition; the curve is positive if and only if $κ>κ_c = \frac{2\sqrt{d-1}}{d}-1$, differentiable away from $κ_c$, and has order $\sqrt{κ-κ_c}$ as $κ\downarrowκ_c$ and order $(1+κ)^2$ as $κ\to\infty$. We show that for each $κ>-1$, an infinite cluster exists exactly when $α>α_c(κ)$. Finally, we identify the near-critical behavior of the susceptibility and the percolation probability: for $κ>κ_c$, the critical exponents take the mean-field values, while for $κ=κ_c$, the phase transition is of a higher order with the percolation probability decaying quadratically in $α-α_c$.