The Type-problem on the Average for random walks on graphs

Abstract

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 {\it recurrence} and {\it transience} {\it 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.

10 pages, 3 figures. to appear on EPJ B

Cited by in corpus (11)

• Random walks on graphs: ideas, techniques and results
• Bose-Einstein Condensation on inhomogeneous complex networks
• Bose-Einstein Condensation on inhomogeneous networks: mesoscopic aspects versus thermodynamic limit
• Heterogeneous excitable systems exhibit Griffiths phases below hybrid phase transitions
• Topology, Hidden Spectra and Bose Einstein Condensation on low dimensional complex networks
• Phase ordering and universality for continuous symmetry models on graphs
• Non-equilibrium critical properties of the Ising model on product graphs
• On the growth of bounded trees
• Probing the local structure: macromolecular combs in external fields
• Percolation on the average and spontaneous magnetization for q-states Potts model on graph
• Classification on the average of random walks