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

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

2000-04-12

arxiv.org/abs/cond-mat/0004188v1

Physics

Condensed Matter

Statistical Mechanics

10 pages, 3 figures. to appear on EPJ B

Scientific paper

10.1007/s100510051170

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.

Affiliated with

Also associated with

No associations

Rating

The Type-problem on the Average for random walks on graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Type-problem on the Average for random walks on graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Type-problem on the Average for random walks on graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-201725