A queueing theoretical proof of increasing property of Polya frequency functions
type: Item
instance of: scholarly article
title: A queueing theoretical proof of increasing property of Polya frequency functions
zbMATH Open document ID: 0851.60090
DOI: 10.1016/0167-7152(95)00015-1
author: Hans Daduna
author: Ryszard Szekli
published in: Statistics \& Probability Letters
publication date: 1996-06-05T00:00:00Z
review text: Let \(f_1, \dots, f_n\) be the Polya frequency counting density functions of order 2 \((\text{PF}_2\) functions) with supports \(E_j = [a_j, b_j]\), \(0 \leq a_j \leq b_j < \infty\), or \(E_j = [a_j, \infty)\), \(j = 1, \dots, n\), and \(X_1, \dots, X_n\) be independent integer-valued r.v.'s having these densities. Let \(S = X_1 + \cdots + X_n\) and \(\varphi\) be an increasing real-valued function defined on \(N^n\). The basic result is the queueing theoretical proof of the fact that \(E (\varphi (X_1, \dots, X_n) \mid S = s)\) is increasing in almost all \(s \in [\sum^n_1 a_j, \sum^n_1 b_j + 1)\). This fact (under a more general setup) has been proven by \textit{B. Efron} [Ann. Math. Stat. 36, 272-279 (1965; Zbl 0134.36704)]. Some applications to queueing networks are given.
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 885158
zbMATH Keywords: Polya frequency counting density functions
zbMATH Keywords: queueing networks
MaRDI profile type: Publication
full work available at URL: 0167-7152(95)00015-1
OpenAlex ID: W1968839625
cites work: A concept of negative dependence using stochastic ordering
cites work: Dependencies in Markovian networks
cites work: Increasing Properties of Polya Frequency Function
cites work: Closed Queuing Systems with Exponential Servers
cites work: Networks of Waiting Lines
cites work: Negative association of random variables, with applications
cites work: Q5624248
cites work: Markov chain models - rarity and exponentiality
cites work: Q3855869
cites work: Convergence of stochastic processes
cites work: Q3339068
cites work: On stochastic comparison of random vectors
cites work: On uniform conditional stochastic order conditioned on planar regions
cites work: The effect of increasing service rates in a closed queueing network
cites work: The preservation of likelihood ratio ordering under convolution
cites work: Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks
cites work: Throughput bounds for closed queueing networks with queue-dependent service rates
cites work: Second-Order Properties of the Throughput of a Closed Queueing Network
cites work: Stochastic monotonicity in general queueing networks
cites work: A Concept of Monotonicity and Its Characterization for Closed Queueing Networks
cites work: Monotonicity of the throughput of a closed exponential queueing network in the number of jobs
description: scientific article; zbMATH DE number 885158