The type-problem on the average for random walks on graphs
Istituto Nazionale di Fisica della Materia, Dipartimento di Fisica, Università di Parma,
Parco Area delle Scienze n.7A,
43100 Parma, Italy
Published online: 15 June 2000
When averages over all starting points are considered, the type problem for the recurrence or transience of a simple random walk on an inhomogeneous network in general differs from the usual "local" type problem. This difference leads to a new classification of inhomogeneous discrete structures in terms of recurrence and transience on the average, describing their large scale topology from a "statistical" point of view. In this paper we analyze this classification and the properties connected to it, showing how the average behavior affects the thermodynamic properties of statistical models on graphs.
PACS: 05.40.Fb – Random walks and Levy flights / 02.90.+p – Other topics in mathematical methods in physics / 02.10.Eb – Combinatorics
© EDP Sciences, Società Italiana di Fisica, Springer-Verlag, 2000