On the cut times of reflected random walks (Q4213435)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1210417
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the cut times of reflected random walks |
scientific article; zbMATH DE number 1210417 |
Statements
1 June 1999
0 references
cut times
0 references
reflected random walks
0 references
bilateral reflected random walks
0 references
0.8145002126693726
0 references
0.7420963048934937
0 references
0.7397215962409973
0 references
0.736050546169281
0 references
On the cut times of reflected random walks (English)
0 references
\textit{G. F. Lawler} has shown [Electron. J. Probab. 1, Paper 13 (1996; Zbl 0888.60059)] that, almost sure (a.s.), for the case of simple random walks, there are not any cut times in dimension \(d\leq 4\), while there are a.s. infinitely many cut times in dimension \(d\geq 5\). Following this result, the present note proves a similar one: the paths of bilateral reflected simple random walks in dimension \(n\geq 5\) have a.s. infinitely many cut times. For the entire collection see [Zbl 0893.00035].
0 references
