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
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 in a sparse random environment is a nearest neighbor random walk on that jumps to the left or to the right with probability from every point of and jumps to the right (left) with the random probability () from the point , . Assuming that are independent copies of a random vector and the mean is finite (moderate sparsity) we obtain stable limit laws for , properly normalized and centered, as . While the case a.s. for some deterministic (weak sparsity) was analyzed by Matzavinos et al., the case (strong sparsity) will be analyzed in a forthcoming paper.
Central limit and other weak theorems (60F05) Strong limit theorems (60F15) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Processes in random environments (60K37)
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)