Level crossing probabilities. II: Polygonal recurrence of multidimensional random walks
[For part I see ibid., 672--679 (2007; Zbl 1108.60037).] Let \(\{ S_n\}\) be a random walk in \(Z^d\) or \(R^d\). We call it polygonally recurrent (resp. transient) if there is a bounded set \(B\) (resp. there is no bounded set) such that a.s. there are infinitely many \(n\) with straight line between \(S_n\), \(S_{n+1}\) hitting \(B\). The authors show that a three-dimensional random walk whose three components are independent is polygonally transient. Also for any dimension \(d\geq 3\) the \(d\)-dimensional directionally reinforced random walks are always polygonally transient. An example is constructed for a transient but polygonally recurrent random walk with independent components on \(Z^2\).
- An Estimate of the Concentration Functionby the Esseen Method
- Directionally reinforced random walks
- scientific article; zbMATH DE number 3194856 (Why is no real title available?)
- Level crossing probabilities. I: One-dimensional random walks and symmetrization
- On the asymptotic distribution of sums of independent identically distributed random variables
- On the Kolmogorov-Rogozin inequality for the concentration function
- Escape probabilities for slowly recurrent sets
- Persistent random walks. I. Recurrence versus transience
- Conservative and semiconservative random walks: recurrence and transience
- On random walks and levels of the form n^
- Recurrence of multidimensional persistent random walks. Fourier and series criteria
- Level crossings of a two-parameter random walk
- Random walks with different directions
- Determining the mode for convolution powers of discrete uniform distribution
- On a directionally reinforced random walk
- Level crossing probabilities. I: One-dimensional random walks and symmetrization
- Maximal probabilities of convolution powers of discrete uniform distributions
This page was built for publication: Level crossing probabilities. II: Polygonal recurrence of multidimensional random walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861050)