Abstract: The famous Polya's recurrence theorem says that the simple random walk, in the integer lattice, is recurrent in dimensions 1 and 2 but not in higher dimensions (as a famous mathematician once explained: a drunk man leaving the bar and walking randomly through the streets will eventually come home). In this talk I will give a quantitative version of Polya's recurrence theorem and some related results for weakly dependent random walks.