Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10118310 | European Journal of Combinatorics | 2019 | 21 Pages |
Abstract
We show that, almost surely, the asymptotic proportion of strings of k consecutive visible lattice points visited by such an α-random walk is a certain constant ck(α), which is actually an (explicitly computable) polynomial in α of degree 2â(kâ1)â2â. For k=1, this gives that, almost surely, the asymptotic proportion of time the random walker is visible from the origin is c1(α)=6âÏ2, independently of α.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Javier Cilleruelo, José L. Fernández, Pablo Fernández,