Search arXivSearch

arXiv · 1608.08377

Fluctuation theory for Markov random walks

Abstract

Two fundamental theorems by Spitzer/Erickson and Kesten/Maller on the fluctuation type (positive divergence, negative divergence or oscillation) of a real-valued random walk $(S_{n})_{n\ge 0}$ with iid increments $X_{1},X_{2},\ldots$ and the existence of moments of various related quantities like the first passage into $[x,\infty)$ and the last exit time from $(-\infty,x]$ for arbitrary $x\in\mathbb{R}_{\geqslant}$ are studied in the Markov-modulated situation when the $X_{n}$ are governed by a positive recurrent Markov chain $M=(M_{n})_{n\ge 0}$ on a countable state space $\mathcal{S}$, thus for a Markov random walk $(M_{n},S_{n})_{n\ge 0}$. Our approach is based on the natural strategy to draw on the results in the iid case for the embedded ordinary random walks $(S_{\tau_{n}(i)})_{n\ge 0}$, where $\tau_{1}(i),\tau_{2}(i),\ldots$ denote the successive return times of $M$ to state $i$, and an analysis of the excursions of the walk between these epochs. However, due to these excursions, generalizations of the afore-mentioned theorems are not one-to-one extensions of those in the iid case and cannot be as illustrated by a number of counterexamples. In fact, various excursion measures will have to be introduced so as to characterize the existence of moments of different quantities.

Explore related subjects

Keep this discovery

BibTeXRIS

Gerold Alsmeyer, Fabian Buckmann. 2016-08-30. Fluctuation theory for Markov random walks. https://arxiv.org/abs/1608.08377

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