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 Simon Fraser University - Department of Mathematics
3 AMIB - Algorithms and Models for Integrative Biology
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France
4 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
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.
Keywords : 2D walks Random generation analytic combinatorics
Document type :
Conference papers
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download
https://hal.inria.fr/hal-01291164
Contributor : Yann Ponty <>
Submitted on : Monday, March 21, 2016 - 9:50:23 AM
Last modification on : Wednesday, March 27, 2019 - 4:41:29 PM
Long-term archiving on : Wednesday, June 22, 2016 - 10:38:39 AM

Files

LuMiPo16.pdf
Files produced by the author(s)

Licence

Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Collections

X | LIX | X-LIX | INRIA | PARISTECH | CENTRALESUPELEC | UNIV-PARIS-SACLAY | X-DEP-INFO

Citation

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

869

Files downloads

184

Contact


archive-ouverte@inria.fr