“…The main point in this method is that it is possible to relate the density of states of an interacting chain with the problem of computing the large deviation behavior of an associated Markov urn process [1][2][3] once the urn function of the problem is identified (see below). Here we deal with models that can be related to a two-color urn, first introduced by Hill, Lane and Sudderth [4][5][6][7], for which a detailed Large deviations theory has been recently developed [7]. In particular, we will provide an explicit example by studying the classic Random Walk range problem (RP, [8][9][10][11][12]), that is, computing the number of different lattice sites visited by a random walk of given lenght.…”