Taming Reluctant Random Walks in the Positive Quadrant
classification
🧮 math.CO
keywords
randomreluctantwalksboundariesdefiningdescribedriftefficient
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.