Visibility properties of lattice points in multiple random walks
Consider \(n\) independent random walks on \({\mathbb{N}}^k\), with arbitrary probability \(\alpha_i\) of going in the \(i\)th coordinate direction. A lattice point is \textit{visible} if there is no other lattice point between it and the origin; that is, if the GCD of its coordinates is 1. The author computes the limiting density of the set of times at which all \(k\) walks, or exactly \(m\) walks, are simultaneously visible. The density approaches this limit almost surely. The proofs use results from number theory as well as probability.
- Arithmetical Functions of a Greatest Common Divisor. I
- Asymptotic evaluation of certain totient sums.
- Generalized lattice-point visibility in \(\mathbb{N}^k\)
- Generalized visibility of lattice points in higher dimensions
- scientific article; zbMATH DE number 108037 (Why is no real title available?)
- scientific article; zbMATH DE number 3523640 (Why is no real title available?)
- scientific article; zbMATH DE number 718681 (Why is no real title available?)
- scientific article; zbMATH DE number 783336 (Why is no real title available?)
- scientific article; zbMATH DE number 3257531 (Why is no real title available?)
- Lattice point problems involving index and joint visibility
- Lattice point visibility on generalized lines of sight
- Sur les nombres de fractions ordinaires inégales qu'on peut exprimer en se servant de chiffres qui n'excèdent pas un nombre donné.
- The Asymptotic Density of Some k-Dimensional Sets
- Visibility in the plane
- Visible lattice points along curves
- Visible lattice points in random walks
This page was built for publication: Visibility properties of lattice points in multiple random walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547995)