Stable limit laws for random walk in a sparse random environment I: moderate sparsity

From MaRDI portal
Publication:6300913

arXiv1804.10633MaRDI QIDQ6300913FDOQ6300913


Authors: Dariusz Buraczewski, Piotr Dyszewski, Alexander Iksanov, Alexander Marynych, Alexander Roitershtein Edit this on Wikidata


Publication date: 27 April 2018

Abstract: A random walk in a sparse random environment is a model introduced by Matzavinos et al. [Electron. J. Probab. 21, paper no. 72: 2016] as a generalization of both a simple symmetric random walk and a classical random walk in a random environment. A random walk (Xn)ninmathbbNcup0 in a sparse random environment (Sk,lambdak)kinmathbbZ is a nearest neighbor random walk on mathbbZ that jumps to the left or to the right with probability 1/2 from every point of mathbbZsetminusldots,S1,S0=0,S1,ldots and jumps to the right (left) with the random probability lambdak+1 (1lambdak+1) from the point Sk, kinmathbbZ. Assuming that (SkSk1,lambdak)kinmathbbZ are independent copies of a random vector (xi,lambda)inmathbbNimes(0,1) and the mean mathbbExi is finite (moderate sparsity) we obtain stable limit laws for Xn, properly normalized and centered, as noinfty. While the case xileqM a.s. for some deterministic M>0 (weak sparsity) was analyzed by Matzavinos et al., the case mathbbExi=infty (strong sparsity) will be analyzed in a forthcoming paper.













This page was built for publication: Stable limit laws for random walk in a sparse random environment I: moderate sparsity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6300913)