Taming reluctant random walks in the positive quadrant
From MaRDI portal
Publication:1687784
DOI10.1016/j.endm.2017.05.008zbMath1426.60053arXiv1603.06321OpenAlexW2953793591WikidataQ57220938 ScholiaQ57220938MaRDI QIDQ1687784
Yann Ponty, Marni Mishna, Jérémie Lumbroso
Publication date: 4 January 2018
Full work available at URL: https://arxiv.org/abs/1603.06321
Related Items
Weighted lattice walks and universality classes ⋮ A combinatorial understanding of lattice path asymptotics
Cites Work
- Unnamed Item
- Unnamed Item
- Complexity of anticipated rejection algorithms and the Darling-Mandelbrot distribution
- On 3-dimensional lattice walks confined to the positive octant
- Random generation of words in an algebraic language in linear binary space
- On the exit time from a cone for Brownian motion with drift
- Grid methods in simulation and random variate generation
- A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
- A calculus for the random generation of labelled combinatorial structures
- On the enumeration and generation of generalized Dyck words
- Basic analytic combinatorics of directed lattice paths
- Random walks in cones
- Counting walks in a quadrant: a unified approach via boundary value problems
- Random walks in cones: the case of nonzero drift
- Random walks in $(\mathbb{Z}_{+})^{2}$ with non-zero drift absorbed at the axes
- Walks with small steps in the quarter plane
- Automatic Classification of Restricted Lattice Walks
- On the Importance Sampling of Self-Avoiding Walks
- Culminating paths
- Exact-size Sampling for Motzkin Trees in Linear Time via Boltzmann Samplers and Holonomic Specification
