Once reinforced random walk on Z × Γ - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Once reinforced random walk on Z × Γ

Bruno Schapira
  • Function : Author
  • PersonId : 950892
Arvind Singh
  • Function : Author
  • PersonId : 1036609


We revisit Vervoort's unpublished paper [16] on the once reinforced random walk, and prove that this process is recurrent on any graph of the form Z × Γ, with Γ a finite graph, for sufficiently large reinforcement parameter. We also obtain a shape theorem for the set of visited sites, and show that the fluctuations around this shape are of polynomial order. The proof involves sharp general estimates on the time spent on subgraphs of the ambiant graph which might be of independent interest.
Fichier principal
Vignette du fichier
ORRW_Ladder_final.pdf (413.02 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01876969 , version 1 (19-09-2018)


  • HAL Id : hal-01876969 , version 1


Daniel Kious, Bruno Schapira, Arvind Singh. Once reinforced random walk on Z × Γ. 2018. ⟨hal-01876969⟩
59 View
55 Download


Gmail Facebook Twitter LinkedIn More