For nearest neighbor Laplacian, you can find a short self-contained proof of the formula $$u(x)=\frac1{2\pi}\log |x|+c+O\left(\frac1{|x|^2}\right)$$ at [these lecture notes][1], pages 6-7. It is a simple exercise in Laplace's method to work out further coefficients of the asymptotic expansion, if necessary. The proof there is not the shortest possible; the easiest way would be to compare the double integral formula defining $G_0$ on page 6 with its counterpart for continuous Laplacian. But then you do not get the beautiful formula (4.4) along the way.

"Random Walk: a modern introduction" by Lawler and Limic does the same in much greater generality (not necessarily nearest neighbour), using local CLT with error bounds. 

Historically, the first sources usually cited for the above formula are 

Stohr, A., [50]: "Uber einige lineare partielle Differenzengleichungen mit konstanten Koefizienten," I, II, and Ill, Mathematische Nachrichten 3 (1950),

or even

W. H. McCrea and F. J. W. Whipple, Random paths in two and three dimensions, Proc. Roy. Soc. Edinburgh 60 (1940),

although the latter apparently proves a slightly weaker result (I have no access to it at the moment to check).
  [1]:https://wiki.helsinki.fi/download/attachments/155233241/LectureNotes20_04.pdf?version=2&modificationDate=1430322536394&api=v2