Simple proof of Dynkin's formula for single-server systems and polynomial convergence rates (Q2940158)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6390869
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simple proof of Dynkin's formula for single-server systems and polynomial convergence rates |
scientific article; zbMATH DE number 6390869 |
Statements
26 January 2015
0 references
Dynkin's formula
0 references
single-server queue
0 references
stationary regime
0 references
convergence rate
0 references
0.8022416234016418
0 references
0.7462732791900635
0 references
0.7456435561180115
0 references
0.7448393702507019
0 references
0.7412700057029724
0 references
