Conjecture on the asymptotic mean absolute self-linking number of confined random walks and polygons

Let $SL$ denote the self-linking number of an oriented uniform random walk or polygon in confined space, and let $E$ denote expectation. Mean absolute self-linking conjecture. As the number $n$ of edges increases, one has

$$\sqrt{E[SL^2]}\sim E[\sqrt{SL^2}]=E[\left|SL\right|].$$

The observed mean absolute self-linking number grows at rate $O(n)$, with a fitted coefficient close to the square root of the coefficient governing the mean squared self-linking number. The statement is supported only by the numerical study in the source.