The preservation of likelihood ratio ordering under convolution (Q1087229)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The preservation of likelihood ratio ordering under convolution |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The preservation of likelihood ratio ordering under convolution |
scientific article |
Statements
The preservation of likelihood ratio ordering under convolution (English)
0 references
1986
0 references
Unlike stochastic ordering \((\geq^{st})\), which is preserved under convolution (i.e., summation of independent random variables), so far it is only known that likelihood ratio ordering \((\geq^{lr})\) is preserved under convolution of log-concave \((PF_ 2)\) random variables. In this paper we define a stronger version of likelihood ratio ordering, termed shifted likelihood ratio ordering \((\geq_{\uparrow}^{lr})\) and show that it is preserved, under convolution. An application of this closure property to closed queueing network is given. Other properties of shifted likelihood ratio ordering are also discussed.
0 references
conditional stochastic order
0 references
likelihood ratio ordering
0 references
shifted likelihood ratio ordering
0 references
queueing network
0 references