First-passage times for random walks in the triangular array setting

2020/05/01 by Denisov, Denis, Sakhanenko, Alexander, Wachtel, Vitali
#60G50 #FOS: Mathematics #Probability (math.PR)

paper · doi:10.48550/arxiv.2005.00240

Abstract

In this paper we continue our study of exit times for random walks with independent but not necessarily identical distributed increments. Our paper "First-passage times for random walks with non-identically distributed increments" was devoted to the case when the random walk is constructed by a fixed sequence of independent random variables which satisfies the classical Lindeberg condition. Now we consider a more general situation when we have a triangular array of independent random variables. Our main assumption is that the entries of every row are uniformly bounded by a constant, which tends to zero as the number of the row increases.

Related

• First-passage times for random walks with non-identically distributed\n increments
• Random walks and Brownian motion: A method of computation for first-passage times and related quantities in confined geometries
• A note on the times of first passage for `nearly right-continuous' random walks
• Local behaviour of first passage probabilities
• On the First Passage Times of Branching Random Walks in \mathbb R^d