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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Discrete mathematics and theoretical computer science Ročník 19 no. 1; číslo Analysis of Algorithms; s. 1 - 32
Hlavní autori:	Banderier, Cyril, Wallner, Michael
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Nancy DMTCS 01.01.2017 Discrete Mathematics & Theoretical Computer Science
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!