Linking number of grid models

Abstract: This paper studies the linking numbers of random links within the grid model. The linking number is treated as a random variable on the isotopy classes of 2-component links, with the paper exploring its asymptotic growth as the diagram size increases. The main result is that the $u$th moment of the linking number for a random link is a polynomial in the grid size with degree $d\leq u$, and all odd moments vanishing. The limits of the moments of the normalized linking number are computed, and it is shown that the distribution of the normalized linking number converges weakly as the grid size tends to infinity.