On the Exit Time of a Random Walk with Positive Drift - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2007

On the Exit Time of a Random Walk with Positive Drift


We study a random walk with positive drift in the first quadrant of the plane. For a given connected region $\mathcal{C}$ of the first quadrant, we analyze the number of paths contained in $\mathcal{C}$ and the first exit time from $\mathcal{C}$. In our case, region $\mathcal{C}$ is bounded by two crossing lines. It is noted that such a walk is equivalent to a path in a tree from the root to a leaf not exceeding a given height. If this tree is the parsing tree of the Tunstall or Khodak variable-to-fixed code, then the exit time of the underlying random walk corresponds to the phrase length not exceeding a given length. We derive precise asymptotics of the number of paths and the asymptotic distribution of the exit time. Even for such a simple walk, the analysis turns out to be quite sophisticated and it involves Mellin transforms, Tauberian theorems, and infinite number of saddle points.
Fichier principal
Vignette du fichier
dmAH0122.pdf (224.43 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01184773 , version 1 (17-08-2015)



Michael Drmota, Wojciech Szpankowski. On the Exit Time of a Random Walk with Positive Drift. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. pp.319-332, ⟨10.46298/dmtcs.3525⟩. ⟨hal-01184773⟩


416 View
408 Download



Gmail Facebook Twitter LinkedIn More