Percolation threshold for metric graph loop soup

In this short note, we show that the critical threshold for the percolation of metric graph loop soup on a large class of transient metric graphs (including quasi-transitive graphs such as ℤ^d, d≥ 3) is 1/2.