SearcharxivSearch

arXiv · 1610.00881

Heavy-tailed random walks on complexes of half-lines

Abstract

We study a random walk on a complex of finitely many half-lines joined at a common origin; jumps are heavy-tailed and of two types, either one-sided (towards the origin) or two-sided (symmetric). Transmission between half-lines via the origin is governed by an irreducible Markov transition matrix, with associated stationary distribution $μ_k$. If $χ_k$ is $1$ for one-sided half-lines $k$ and $1/2$ for two-sided half-lines, and $α_k$ is the tail exponent of the jumps on half-line $k$, we show that the recurrence classification for the case where all $α_k χ_k \in (0,1)$ is determined by the sign of $\sum_k μ_k \cot ( χ_k πα_k )$. In the case of two half-lines, the model fits naturally on $\mathbb{R}$ and is a version of the oscillating random walk of Kemperman. In that case, the cotangent criterion for recurrence becomes linear in $α_1$ and $α_2$; our general setting exhibits the essential non-linearity in the cotangent criterion. For the general model, we also show existence and non-existence of polynomial moments of return times. Our moments results are sharp (and new) for several cases of the oscillating random walk; they are apparently even new for the case of a homogeneous random walk on $\mathbb{R}$ with symmetric increments of tail exponent $α\in (1,2)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mikhail V. Menshikov, Dimitri Petritis, Andrew R. Wade. 2016-10-04. Heavy-tailed random walks on complexes of half-lines. https://doi.org/10.1007/s10959-017-0753-5

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