Consider a 2-dimensional soft random geometric graph G(λ,s,ϕ), obtained by placing Poisson(λs2) number of vertices uniformly at in square side s, with edges placed between each pair x,y probability ϕ(‖x−y‖), where ϕ: R+→[0,1] is finite-range connection function. This paper concerned the asymptotic behaviour G(λ,s,ϕ) large-s limit (λ,ϕ) fixed. We prove that proportion largest component converges...