Lattice paths with catastrophes
Authors:
Preprint
Abstract
In queuing theory, it is usual to have some models with a "reset" of the queue. In terms of lattice paths, it is like having the possibility of jumping from any altitude to zero. These objects have the interesting feature that they do not have the same intuitive probabilistic behaviour as classical Dyck paths (the typical properties of which are strongly related to Brownian motion theory), and this article quantifies some relations between these two types of paths. We give a bijection with some other lattice paths and a link with a continued fraction expansion. Furthermore, we prove several formulae for related combinatorial structures conjectured in the On-Line Encyclopedia of Integer Sequences. Thanks to the kernel method and via analytic combinatorics, we provide the enumeration and limit laws of these "lattice paths with catastrophes" for any finite set of jumps. We end with an algorithm to generate such lattice paths uniformly at random.Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Lattice paths with catastrophesElectronic Notes in Discrete Mathematics, 2017
- Equivalence classes of ballot paths modulo strings of length 2 and 3Discrete Mathematics, 2016
- On batch queueing systems: A combinatorial approachJournal of Statistical Planning and Inference, 2010
- Dual processes to solve single server systemsJournal of Statistical Planning and Inference, 2005
- Restricted Dumont PermutationsAnnals of Combinatorics, 2005
- From object grammars to ECO systemsTheoretical Computer Science, 2004
- Random generation of words in an algebraic language in linear binary spaceInformation Processing Letters, 1995
- A calculus for the random generation of labelled combinatorial structuresTheoretical Computer Science, 1994
- On expansion of algebraic functions in power and Puiseux series, IJournal of Complexity, 1986
- Combinatorial aspects of continued fractionsDiscrete Mathematics, 1980