Random walks with different directions

DOI10.1007/S00440-015-0635-7MaRDI QIDQ267033zbMATH OpenOpenAlexFDO

Authors Simão Herdade, Van Vu

Publication date 7 April 2016

Published in Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1409.7991

zbMATH Keywords

random walksreturn probability

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Arithmetic progressions (11B25)

Abstract: As an extension of Polya's classical result on random walks on the square grids ($$), we consider a random walk where the steps, while still have unit length, point to different directions. We show that in dimensions at least 4, the returning probability after $n$ steps is at most $n^{-d/2-d/(d-2)+o(1)}$, which is sharp. The real surprise is in dimensions 2 and 3. In dimension 2, where the traditional grid walk is recurrent, our upper bound is $n^{-omega(1)}$, which is much worse than higher dimensions. In dimension 3, we prove an upper bound of order $n^{-4+o(1)}$. We discover a new conjecture concerning incidences between spheres and points in $R^3$, which, if holds, would improve the bound to $n^{-9/2+o(1)}$, which is consistent % with the $dge4$ case. to the $dge4$ case. This conjecture resembles Szemer'edi-Trotter type results and is of independent interest.

Recommendations

• Explicit bounds for the return probability of simple random walks
• How likely is Polya's drunkard to stay in \(x\geq y\geq z\)?
• Lost in space
• A non-backtracking Pólya's theorem
• Level crossing probabilities. II: Polygonal recurrence of multidimensional random walks

Cites work

• Additive combinatorics
• Estimates for the concentration function of combinatorial number theory and probability
• Factorization in generalized arithmetic progressions and application to the Erdős-Szemerédi sum-product problems
• Optimal inverse Littlewood-Offord theorems
• The Hardy-Littlewood method.

Cited in

(4)

• Random walks with multiple step lengths
• A non-backtracking Pólya's theorem
• Explicit bounds for the return probability of simple random walks
• How likely is Polya's drunkard to stay in \(x\geq y\geq z\)?

This page was built for publication: Random walks with different directions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q267033)