Taming Reluctant Random Walks in the Positive Quadrant
Jeremie Lumbroso, Marni Mishna, Yann Ponty

TL;DR
This paper introduces efficient methods for generating reluctant lattice walks in the positive quadrant, which are characterized by a strong drift towards the boundaries, addressing challenges in modeling such walks.
Contribution
It provides novel random generation strategies specifically designed for reluctant lattice walks with boundary drift.
Findings
Developed efficient algorithms for reluctant walk generation
Demonstrated improved performance over existing methods
Applicable to various boundary drift scenarios
Abstract
A lattice walk model is said to be reluctant if the defining step set has a strong drift towards the boundaries. We describe efficient random generation strategies for these walks.
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.
