Taming reluctant random walks in the positive quadrant

Jeremie Lumbroso (1, 2) , Marni Mishna (2) , Yann Ponty (3, 4)

1 Computer Science Department [Princeton]
2 SFU - Department of Mathematics [Burnaby]
3 AMIB - Algorithms and Models for Integrative Biology
4 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]

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.

Mots clés: analytic combinatorics; 2D walks; Random generation

Domaines: Bio-informatique [q-bio.QM]

Jeremie Lumbroso, Marni Mishna, Yann Ponty. Taming reluctant random walks in the positive quadrant. GASCOM - 10th conference on random generation of combinatorial structures - 2016, Jun 2016, Bastia, France. pp.99 -- 114, ⟨10.1016/j.endm.2017.05.008⟩. ⟨hal-01291164⟩