Lattice paths with catastrophes

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...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete mathematics and theoretical computer science Vol. 19 no. 1; no. Analysis of Algorithms; pp. 1 - 32
Main Authors:	Banderier, Cyril, Wallner, Michael
Format:	Journal Article
Language:	English
Published:	Nancy DMTCS 01.01.2017 Discrete Mathematics & Theoretical Computer Science
Subjects:	05a16, 05a19, 60f05 Brownian motion Combinatorial analysis Combinatorics Complex Variables Computer Science computer science - discrete mathematics Data Structures and Algorithms Discrete Mathematics Encyclopedias Enumeration Formal Languages and Automata Theory Jumping Mathematics mathematics - combinatorics mathematics - probability Probability Queues Queuing theory Symbolic Computation
ISSN:	1365-8050, 1462-7264, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!