The number of generations entirely visited for recurrent random walks on random environment - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Theoretical Probability Année : 2014

The number of generations entirely visited for recurrent random walks on random environment

Résumé

In this paper we are interested in a random walk in a random environment on a super-critical Galton-Watson tree. We focus on the recurrent cases already studied by Y. Hu and Z. Shi and G. Faraud. We prove that the largest generation entirely visited by these walks behaves like log n and that the constant of normalization which differs from a case to another is function of the inverse of the constant of Biggins' law of large number for branching random walks.
Fichier principal
Vignette du fichier
RWTree071211.pdf (228.67 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00652801 , version 1 (16-12-2011)

Identifiants

Citer

Pierre Andreoletti, Pierre Debs. The number of generations entirely visited for recurrent random walks on random environment. Journal of Theoretical Probability, 2014, pp.518-538. ⟨hal-00652801⟩
199 Consultations
90 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More