arXiv Analytics

Sign in

arXiv:math/0104252 [math.PR]AbstractReferencesReviewsResources

Classification on the average of random walks

Daniela Bertacchi, Fabio Zucca

Published 2001-04-26, updated 2002-03-14Version 2

We introduce a new method for studying large scale properties of random walks. The new concepts of transience and recurrence on the average are compared with the ones introduced by R.Burioni, D.Cassi and A.Vezzani and with the usual ones; their relationships are analyzed and various examples are provided.

Comments: Reduced number of pages to 28, added final paragraph of conclusions with some new results
Categories: math.PR, math.FA
Subjects: 82B41, 60G50
Related articles: Most relevant | Search more
arXiv:1406.3764 [math.PR] (Published 2014-06-14)
Monotone interaction of walk and graph: recurrence versus transience
arXiv:1305.4878 [math.PR] (Published 2013-05-21, updated 2014-09-20)
Recurrence or transience of random walks on random graphs generated by point processes in $\mathbb{R}^d$
arXiv:1408.3339 [math.PR] (Published 2014-08-14, updated 2014-11-10)
Random Walks in the Quarter-Plane: Advances in Explicit Criterions for the Finiteness of the Associated Group in the Genus 1 Case