A combinatorial approach to a model of constrained random walkers - Archive ouverte HAL
Article Dans Une Revue Combinatorics, Probability and Computing Année : 2016

A combinatorial approach to a model of constrained random walkers

Résumé

In [1], the authors consider a random walk $(Z_{n,1},\ldots,Z_{n,K+1})\in \mathbb{Z}^{K+1}$ with the constraint that each coordinate of the walk is at distance one from the following one. A functional central limit theorem for the first coordinate is proved and the limit variance is explicited. In this paper, we study an extended version of this model by conditioning the extremal coordinates to be at some fixed distance at every time. We prove a functional central limit theorem for this random walk. Using combinatorial tools, we give a precise formula of the variance and compare it with the one obtained in [1].
Fichier principal
Vignette du fichier
prisoners-210214.pdf (205.55 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00950845 , version 1 (23-02-2014)

Identifiants

  • HAL Id : hal-00950845 , version 1

Citer

Thibault Espinasse, Nadine Guillotin-Plantard, Philippe Nadeau. A combinatorial approach to a model of constrained random walkers. Combinatorics, Probability and Computing, 2016, 25 (2), pp.222-235. ⟨hal-00950845⟩
213 Consultations
135 Téléchargements

Partager

More