Heavy-tailed random walks on complexes of half-lines
Mikhail V. Menshikov, Dimitri Petritis, Andrew R. Wade

TL;DR
This paper analyzes the recurrence behavior of heavy-tailed random walks on a complex of half-lines connected at a point, providing a cotangent-based criterion and studying moments of return times, extending classical oscillating random walk results.
Contribution
It introduces a general cotangent criterion for recurrence of heavy-tailed walks on complexes of half-lines, including new moment existence results and non-linearity insights.
Findings
Recurrence classification depends on the sign of a cotangent sum involving tail exponents and stationary distribution.
The model generalizes oscillating random walks and reveals non-linear recurrence criteria.
Sharp results on the existence of polynomial moments of return times, including new cases for symmetric heavy-tailed walks.
Abstract
We study a random walk on a complex of finitely many half-lines joined at a common origin; jumps are heavy-tailed and of two types, either one-sided (towards the origin) or two-sided (symmetric). Transmission between half-lines via the origin is governed by an irreducible Markov transition matrix, with associated stationary distribution . If is for one-sided half-lines and for two-sided half-lines, and is the tail exponent of the jumps on half-line , we show that the recurrence classification for the case where all is determined by the sign of . In the case of two half-lines, the model fits naturally on and is a version of the oscillating random walk of Kemperman. In that case, the cotangent criterion for recurrence becomes linear in and ;…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
