On some random walk problems

LO, CHAK HEI (2017) On some random walk problems. Doctoral thesis, Durham University.
Copy

We consider several random walk related problems in this thesis. In the first part, we study a Markov chain on $\RP \times S$, where $\RP$ is the non-negative real numbers and $S$ is a finite set, in which when the $\RP$-coordinate is large, the $S$-coordinate of the process is approximately Markov with stationary distribution $\pi_i$ on $S$. Denoting by $\mu_i(x)$ the mean drift of the $\RP$-coordinate of the process at $(x,i) \in \RP \times S$, we give an exhaustive recurrence classification in the case where $\sum_{i} \pi_i \mu_i (x) \to 0$, which is the critical regime for the recurrence-transience phase transition. If $\mu_i(x) \to 0$ for all $i$, it is natural to study the \emph{Lamperti} case where $\mu_i(x) = O(1/x)$; in that case the recurrence classification is known, but we prove new results on existence and non-existence of moments of return times. If $\mu_i (x) \to d_i$ for $d_i \neq 0$ for at least some $i$, then it is natural to study the \emph{generalized Lamperti} case where $\mu_i (x) = d_i + O (1/x)$. By exploiting a transformation which maps the generalized Lamperti case to the Lamperti case, we obtain a recurrence classification and an existence of moments result for the former. The generalized Lamperti case is seen to be more subtle, as the recurrence classification depends on correlation terms between the two coordinates of the process. In the second part of the thesis, for a random walk $S_n$ on $\R^d$ we study the asymptotic behaviour of the associated centre of mass process $G_n = n^{-1} \sum_{i=1}^n S_i$. For lattice distributions we give conditions for a local limit theorem to hold. We prove that if the increments of the walk have zero mean and finite second moment, $G_n$ is recurrent if $d=1$ and transient if $d \geq 2$. In the transient case we show that $G_n$ has diffusive rate of escape. These results extend work of Grill, who considered simple symmetric random walk. We also give a class of random walks with symmetric heavy-tailed increments for which $G_n$ is transient in $d=1$.


picture_as_pdf
C.H.LO_eThesis_osRWp.pdf
subject
Accepted Version
subject
On some random walk problems

View Download

EndNote Reference Manager Refer Atom Dublin Core ASCII Citation MODS OpenURL ContextObject METS HTML Citation OpenURL ContextObject in Span MPEG-21 DIDL Data Cite XML
Export