Level crossing probabilities. II: Polygonal recurrence of multidimensional random walks

From MaRDI portal



Abstract: In part I (math.PR/0406392) we proved for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n is of the maximal order square root of n. In higher dimensions we call a random walk 'polygonally recurrent' (resp. transient) if a.s. infinitely many (resp. finitely many) of the straight lines between two consecutive sites hit a given bounded set. The above estimate implies that three-dimensional random walks with independent components are polygonally transient. Similarly a directionally reinforced random walk on Z^3 in the sense of Mauldin, Monticino and v.Weizsaecker [1] is transient. On the other hand we construct an example of a transient but polygonally recurrent random walk with independent components on Z^2.


[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\).











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)