## Abstract

A two-dimensional lattice walk model is said to be reluctant if its defining step set has a strong drift away from the negative half-planes. We consider the uniform random generation of reluctant walks of length n in the positive quadrant, noting that a naive rejection from unconstrained walks has exponential time complexity. A baseline algorithm using the recursive method requires Θ(n^{4}) time and memory. We consider an alternative strategy which draws unidimensional walks from a well-chosen half-plane model, as identified by Johnson, Mishna and Yeats. The resulting generator is provably efficient, and typically outperforms the baseline algorithm. A general analysis of its complexity requires further developments to characterize the subexponential growth factors of reluctant walks, and motivates the design of efficient algorithms for the generation of 1D walks taking irrational step sets.

Original language | English (US) |
---|---|

Pages (from-to) | 99-114 |

Number of pages | 16 |

Journal | Electronic Notes in Discrete Mathematics |

Volume | 59 |

DOIs | |

State | Published - Jun 2017 |

Externally published | Yes |

## All Science Journal Classification (ASJC) codes

- Discrete Mathematics and Combinatorics
- Applied Mathematics

## Keywords

- 2D walk
- analytic combinatorics
- random generation