SearcharxivSearch

arXiv · 1512.04242

Non-homogeneous random walks on a half strip with generalized Lamperti drifts

Abstract

We study a Markov chain on $\mathbb{R}_+ \times S$, where $\mathbb{R}_+$ is the non-negative real numbers and $S$ is a finite set, in which when the $\mathbb{R}_+$-coordinate is large, the $S$-coordinate of the process is approximately Markov with stationary distribution $π_i$ on $S$. If $μ_i(x)$ is the mean drift of the $\mathbb{R}_+$-coordinate of the process at $(x,i) \in \mathbb{R}_+ \times S$, we study the case where $\sum_{i} π_i μ_i (x) \to 0$, which is the critical regime for the recurrence-transience phase transition. If $μ_i(x) \to 0$ for all $i$, it is natural to study the Lamperti case where $μ_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 $μ_i (x) \to d_i$ for $d_i \neq 0$ for at least some $i$, then it is natural to study the generalized Lamperti case where $μ_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 existence of moments results 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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chak Hei Lo, Andrew R. Wade. 2016-07-29. Non-homogeneous random walks on a half strip with generalized Lamperti drifts. https://arxiv.org/abs/1512.04242

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR