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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete mathematics and theoretical computer science Jg. 19 no. 1; H. Analysis of Algorithms; S. 1 - 32
Hauptverfasser:	Banderier, Cyril, Wallner, Michael
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Nancy DMTCS 01.01.2017 Discrete Mathematics & Theoretical Computer Science
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!